BELLMAN-FORD-DIJKSTRA ALGORITHM (BFD) TO DETERMINE THE SHORTEST PATH ON GRAPH

Abstract

The shortest path problem is a problem related to the sum of edges weights in a graph. In this final project disscused on a graph containing a negative edges weights, but does not contain a cycle with a negative esges weughts. The method used is Bellman-Ford-Dijkstra (BFD) method where the method is a combination of Bellman-Ford method and Dijkstra method. The completion of the method uses the Dijkstra method which is modified by updating the selected vertex value with the Bellman-Ford method, where this method has more efficient algorithm completion because it requires fewer operations than the Bellman-Ford algorithm. From the results of the BFD method implementation in Semarang Regency Goverment Tourism office network, the graph has the shortest path tree which is the results of the shortest path from the starting point of travel to all other tourist points are obtained from the Semarang Regency Goverment Tourism. Keywords : Shortest Path Problem, Direct Acyclic Graph Network, BellmanFord-Dijkstra