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