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