2.3 Spanning Tree Alg. Contd.
nA minimum spanning tree is one for which the distance between the root node and all other nodes is the shortest (least hops if all LAN segments are of equal bit rate, if unequal bit rates exist, then the higher the bit rate the lower the cost of the link and the shortest path refers to high bit rate path).
n