Dijsktra

To find the shortest path in a weighted, directed, loop free, positive weights graph.

To find ahortest oath in unweighted graph use BFS
to find shortest path in graph with negative weights use Bellman Ford