POV-Ray: Newsgroups: povray.binaries.images: { minimum spanning tree }:{ kruskal algorithm } : kruskal_01.png 95KB : kruskal_02.png 134 KB: Re: { minimum spanning tree }:{ kruskal algorithm } : kruskal_01.png 95KB : kruskal

POV-Ray : Newsgroups : povray.binaries.images : { minimum spanning tree }:{ kruskal algorithm } : kruskal_01.png 95KB : kruskal_02.png 134 KB : Re: { minimum spanning tree }:{ kruskal algorithm } : kruskal_01.png 95KB : kruskal_02.png 134 KB		Server Time 10 Aug 2024 07:15:14 EDT (-0400)

From: Dave Blandston
Date: 28 Sep 2004 02:03:39
Message: <4158febb$1@news.povray.org>

"pan" <pan### [at] syixcom> wrote in message news:4158fb48@news.povray.org...
> minimum spanning trees (MST) can be maps of nodes and edges such that a
> single path
> is calculated that all nodes lie on and such that the total length of the
> path is
> at (or near) a minimum value.

Does the path double-back? Otherwise, it looks like there are a bunch of
dead ends.

Post a reply to this message