Shortest Path First example
First iteration
- Move A (ourself) to PATHS with cost 0
- Move neighbors of A to TENT: B, C, D Note that TWCC succeeds since B, C, D reports an adjacency to A
- Find first-hop info in adjacency database
- TENT: D cost 3 via S3, C cost 7 via S2, B cost 3 via S0
- PATHS: A
- Unknown: E F G