Shortest Path First algorithm
We execute N steps
typically N is the number of nodes in the network. During each step we find the path(s) to one node.
We initialise the computation by moving ourselves to the TENT list
Previous slide
Next slide
Back to first slide
View graphic version