SEARCHING ALGORITHM
Breadth First Search
From the tree root it explores all of the neighbor nodes at the present depth prior to moving on to the nodes at next depth level.
More
Depth First Search
It starts at the tree root and explores as far as possible along each branch in it's descendant before backtracking.
More
Dijkstra Algorithm
For a given source node in the graph, the algorithm finds the shortest path between that node and every other.
More
A* Algorithm
It is an informed search algorithm, as it uses information about path cost and also uses heuristics to find the solution.
More
