This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: A B C D E 4 2 2 1 1 3 2 1 2 1 1 1 (2) Consider a network with the following topology. Assume the link metrics of both directions are the same. Unless indicated otherwise, link weights are 1. Use Dijkistra’s shortest path algorithm to find the spanning tree which contains all paths from router A to the rest of the routers in the network. Show the results of the first four steps of the algorithm. A B C D E F H G 3 4 2 2 3...
View Full Document
- Spring '11
- Graph Theory, Shortest path problem, distance vector, following network, shortest path algorithm