COMPARISON BETWEEN REVERSE-DELETE AND BORUVKA ALGORITHM FOR CONSTRUCTING SHORTEST HIGHWAY SYSTEM
Daftar Isi:
- The minimum spanning tree can solve the problem of finding the shortest path in the graph. One thing that can be resolved is to find the optimal route in the construction of a highway system that connect all city, which is expected to reduce cost so that they can be allocated to the other sectors. The data used represents the name of the city and also the edge that connect the cities. After that the data will be processed by the program using the Reverse Delete and Boruvka algorithm, so that the result can be compared betweem Reverse Delete and Boruvka algorithm After testing the data that has been collected, it can be concluded that both Reverse Delete and Boruvka algorithm can find the shortest MST path to build a highway system with accuracy of 63%, so the results of the two algorithm still cannot be used as the main reference, because it needs some more considerations like whether the land to be used is available or not, whether the terrain supports it, whether the location is strategic. For speed testing, the Boruvka algorithm is faster than Reverse Delete on a graph with a higher number of edges than the number of nodes.