Revision as of 06:59, 12 May 2010 edit 158.108.238.253 (talk) Link to David Peleg (Scientist) ← Previous edit		Revision as of 08:59, 15 June 2010 edit undo MF (talk \| contribs) 6 edits Ethernet bridges spanning tree is not necessarily a minimum one Tag: section blanking Next edit →
Line 17: As the output of the algorithm, every node knows which of its links belong to the Minimum Spanning Tree and which do not. ~~== Applications ==~~ ~~Ethernet switches use a distributed minimum spanning tree algorithm to construct a loop-free topology. See [[spanning tree protocol]].~~ == References ==

Distributed minimum spanning tree: Difference between revisions