Network Layer4-1 Spanning trees r Suppose you have a connected undirected graph m Connected: every node is reachable from every other node m Undirected:
Introduction. Readings r Van Steen and Tanenbaum: 5.1 r Coulouris: 10.3.
