Abstract
The shortest path is a very important thing in a business sector, especially in sending goods by land. One of the obstacles faced in the shipment of goods is the determination of the trajectory. Determining the best trajectory can minimize shipping costs and time is more efficient A designated algorithm or system is required to search for the shortest and the most optimal traffic path from various numbers of existing alternative pathways. The Kruskal algorithm is one of the algorithms used in solving minimum spanning tree problems by choosing the side that has the smallest weight of each node with the notes that the selected sides cannot form a closed circular. For Case on study, we used data activities is controlled by land transportation from PT. T A. The results showed that with the application of the Kruskal algorithm in the case of finding the closest route to the building store for shipping goods, the optimal path was obtained. The distances of the 12 data that was tried there were 83% data which were smaller than the google map direction API.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
