Dijkstra Algorithm

We consider a graph with n vertices, all pairs of which are connected by an edge; each edge is of given positive length. The following two basich problems are solved.

1. Construct the tree of minimal total length between the n vertices (A tree is a graph with one and only one path between any two vertices)
2. Find the path of minimal total length between two given vertices

Reference

[Dijkstra1959]

"Dijkstra Algorithm" is mentioned on: Core Extraction Distributed Ad Hoc Routing Protocol