Utilization of the Prim Algorithm to Determine the Nearest Path Car Transportation Problems of Goods Carrier Box

Abstract

Prim’s algorithm has been proven to be able to be used in determining the closest path, minimum spanning tree in the problem of transporting box cars carrying goods. Based on the results of theoretical analysis tests that have been carried out from several experimental data, it can be obtained results showing that, the results of Prim’s algorithm complexity are as follows O(n2). By defining n here is the number of vertices contained in the graph. So it can be concluded that, empirically, the data from the average travel time of this prim algorithm shows a graph that has a quadratic nature. As for the large number of edges contained in a graph, it has no effect on the complexity of finding the nearest path, the problem of transporting box cars carrying goods is a minimum spanning tree using the Prims algorithm.

Keywords

• prim algorithm
• transportation problem