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