1.Previous
3.Next

to determine the shortest path from itself to every other node in the network; generally, some variant of Dijkstra's algorithm is used. A node maintains two data structures: a Tree data structure tree containing nodes which are "done", and a list of candidates. The algorithm starts with both structures empty; it then adds to the first one the node itself. The variant of a greedy algorithm

1.Previous
3.Next