| Issue |
E3S Web Conf.
Volume 400, 2023
International Conference on Sciences, Mathematics, and Education (ICoSMEd 2022)
|
|
|---|---|---|
| Article Number | 03004 | |
| Number of page(s) | 6 | |
| Section | Theory and Application in Mathematics | |
| DOI | https://doi.org/10.1051/e3sconf/202340003004 | |
| Published online | 03 July 2023 | |
Implementation of the Floyd-Warshall Algorithm and Bellman-Ford Algorithm to Determine the Shortest Path in the Distribution of LPG Gas
Department of Mathematics, Universitas Negeri Gorontalo, Bone Bolango 96554, Indonesia
* e-mail: kikyyusuf5@gmail.com
** e-mail: nurwan@ung.ac.id
*** e-mail: djihad@ung.ac.id
**** e-mail: lailany.math@gmail.com
In this article, the method use to determine the shortest path in the distribution of LPG is the Floyd-Warshall algorithm and the Bellman-Ford algorithm. These two methods will be compared to find out methods that can provide the best result. The best result is the path that has the minimum distance of distribution of LPG. Both of these algorithms are focused on simulating calculations that begin by representing the map in the form of a graph. Finally, the results obtained from this study are that using the Floyd-Warshall algorithm produces a path with a total distance of 111.05 KM while the Bellman-Ford algorithm produces 332.3 KM.
© The Authors, published by EDP Sciences, 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.