Shortest Path Calculation

• Once the map is known to a router, it can compute the shortest path to all other routers

• Variables:

• • S: Source node
  • E: All evaluated nodes (shortest path known)
  • R: Remaining nodes (shortest path not known)
  • O: Sorted list of paths
  • P: Shortest cost path in O
  • V: The last router in path P