Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm

  • Lusiani A
  • Sartika E
  • Binarto A
  • et al.
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

… Discussion of the benefits of combining graph theories and board games for the Dijkstra and Prim minimum spanning tree theories have been conducted in introducing competitive …

Cite

CITATION STYLE

APA

Lusiani, A., Sartika, E., Binarto, A., Habinuddin, E., & Azis, I. (2021). Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm. In Proceedings of the 2nd International Seminar of Science and Applied Technology (ISSAT 2021) (Vol. 207). Atlantis Press. https://doi.org/10.2991/aer.k.211106.039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free