What is the use of Dijkstra’s algorithm

Dijkstra’s algorithm is used to solve the single-source shortest-paths problem; for a given vertex called the source in a weighted connected graph, find the shortest path to all its other vertices. The single-source shortest-paths problem asks for a family of paths, each leading from the source to a different vertex in the graph, though paths, may have edges in common.