MODEL LINTASAN TERPENDEK BERBASIS PERBANDINGAN JARAK TEMPUH DAN KENDALA PENGHAMBAT DENGAN PENDEKATAN CHEAPEST LINK

A road network can be modeled representing its reality in the form of a directed graph, so that the determination of shortest path by using any method will not be as complicated as the one without modeling. A road network has been modeled to contain some edge of paths, where the weights of all the edges may be different. The edges of path can also consider associated constraints such as traffic jump and traffic lights. The purpose of this study is to determine the
shortest path and the constraints involving the mileage of existing inhibitors using Cheapest Link algorithm. The results has yet to provide the shortest path solution. It is because of existing small weights of related arcs. Based of Cheapest Link algorithm, the procedure begins by selecting
shortest arc with weight, without need of a starting point for research. While Greedy algorithm only iterates on the basis of its initial point, regardless of other arcs whose weights are smaller. Thus, the distance obtained by the Cheapest Link algorithm has been longer in comparation with
the one yielded by Greedy algorithm.