Dijkstra’s algorithm
- P: (ID, path-cost, next-hop) triples.
- ID: node id.
- Path-cost: cost of path from root to node
- Next-hop: ID of next-hop on shortest path from the root to reach that node
- P: Set of nodes for which the best path cost (and next-hop from root) have been found.
- T: (ID, path-cost, next-hop):
- Set of candidate nodes at a one-hop distance from some node in P.
- Note: there is only one entry per node. In the interim, some nodes may not lie in P or T.
- R=Routing table: (ID, next-hop) to be created