[comp.lang.pascal] min tree

DPickett@pco-multics.hbi.honeywell.com (02/22/89)

    This method, Prim's I believe, is very simple.  Move edges from the
full graph to a tree by the following criteria:  1.  the first edge is
the shortest edge of the original graph.  2.  the next edges are the
shortest edge of the rest that has one end on a node of the tree.  3.
when you have n-1 edges, you are done.  A sorted linked list of the
original graph helps speed the construction of the tree.