Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!husc6!cmcl2!adm!xadmx!DPickett@pco-multics.hbi.honeywell.com
From: DPickett@pco-multics.hbi.honeywell.com
Newsgroups: comp.lang.pascal
Subject: re: min tree
Message-ID: <18423@adm.BRL.MIL>
Date: 21 Feb 89 17:48:49 GMT
Sender: news@adm.BRL.MIL
Lines: 7


    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.