Path Finding Algorithms

In this survey we have compared five different path finding algorithms, namely, Dijkastra’s algorithm, A* Search, Greedy Best First Search, Breadth First Search and Depth First Search on the basis of the following criteria: Complexity: It refers to the rate at which the execution time grows with respect to the input size. Reliability: It refers to whether the algorithm is able to guarantee the shortest path. Weighted/unweighted: Some algorithms are not suited for weighted graphs and thus have a major limitation. Their respective advantages and disadvantages have also been discussed.