This paper presents a review kind of algorithm for solving shortest path problem. Many methods or algorithms can be used to solve the shortest path problem in the graph, but there are many differences in each method or algorithm although the same expected goal is to find the shortest / minimum trajectory that is optimal and efficient. Although the main purpose is to find the shortest path but there is also another goal that is to find the shortest path optimal with a fast search time. but it is very difficult to get both. The shortest or fastest path of the optimum course takes the maximum time also by the arena that many ways that can be used to search the shortest path on the graph with the advantages and disadvantages of each. However, to determine which is most effective requires an algorithm that can provide conclusions based on several parameters added, such as the length of each point distance, the condition of the path between points, as well as the density of traffic each point.