FINDING SHORTEST PATH USING DIJKSTRA ALGORITHM
Daftar Isi:
- Advances in information technology is now increasingly widespread and very rapidly growing, so it can help people to enjoy the various conveniences that have been generated by these technologies. The main problem of finding the shortest route is of course to find the shortest route or path possible. But for its implementation, this issue can be expanded more widely among others to find the minimum cost, etc. The point is to find the most effective solution that can be applied in the problems faced. Algorithm is a computational procedure that transforms a number of inputs into a number of outputs. Dijkstra's algorithm is a graph search algorithm that completes the shortest path single source problem in which Dijkstra will look for the shortest path from a start vertex by examining and comparing each path. The purpose of this research is to search the shortest route and calculate the path with primary point and direction node. Based on the result, the conclusion is Dijkstra's algorithm can be used to search the shortest route and can calculate the path with primary point and direction node.