This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In Order to Form a More Perfect UNION
March/April 2001 (vol. 3 no. 2)
pp. 60-64
In this computing prescription we present an algorithm for finding a minimum spanning tree. Figure 1 shows a typical application of this MST algorithm. Here we have 11 data points in a plane and would like to find some structure among them. Suppose we draw dotted lines between each pair of points (see Figure 1a). If we consider the points vertices and the dotted lines edges, we have a complete graph on 11 points. In Figure 1b, we choose just enough of the edges to keep the graph connected. This is a spanning tree of the graph. A graph can have many spanning trees. The one shown is an MST--that is, a spanning tree that minimizes the total length of edges.
Citation:
Isabel Beichl, Francis Sullivan, "In Order to Form a More Perfect UNION," Computing in Science and Engineering, vol. 3, no. 2, pp. 60-64, March-April 2001, doi:10.1109/5992.909004
Usage of this product signifies your acceptance of the Terms of Use.