This preview shows page 1. Sign up to view the full content.
Unformatted text preview: In-class activity: Shortest Path Spanning Tree
In the following network, find the shortest paths from R2 to every other network: From R2 Destination Network R1 LAN R3 LAN R4 LAN R5 LAN Shortest Path R2 R1 R2 R5 R4 R3 R2 R5 R4 R2 R5 Cost 20+2=22 10+10+10+2= 32 10+10+2=22 10+2=12 ...
View Full Document
This note was uploaded on 03/11/2012 for the course LSDHFA 234 taught by Professor Sdaf during the Spring '12 term at UOIT.
- Spring '12