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