Loop Avoidance
Consider LAN a graph G = (E, V), with LANs as vertices, and bridges as edges [well, sort of… see footnote p.212]
Spanning Trees:
- A spanning tree of an undirected, connected graph G is a subgraph which is both a tree and contains all vertices in G
- Thus, the ST will throw out some edges and be cycle-free