Shortest Path First example
Second iteration
- Move D to PATHS with cost 3 and insert in RIB its prefixes
- Move neighbors of D to TENT: G, found better path to C, ignore A
- TENT: C cost 6 via S3, B cost 3 via S0, G cost 15 via S3
- PATHS: A, D cost 3 via S3
- Unknown: E F