Dijkstra's algorithm-Single source shortest path problem

The algorithm finds the shortest path from a given node or source to rest all nodes in the graph,it is applicable both for directed and undirected graph with non negative weights.