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:19:35 EDT (-0400)
  Re: { minimum spanning tree }:{ kruskal algorithm } : kruskal_01.png 95KB : kruskal_02.png 134 KB  
From: Mike Williams
Date: 28 Sep 2004 04:50:03
Message: <SWvorBAYuQWBFwM1@econym.demon.co.uk>
Wasn't it Dave Blandston who wrote:
>"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.

The walk is not actually a path, it's not even a trail, it's actually a
tree.

-- 
Mike Williams
Gentleman of Leisure


Post a reply to this message

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.