[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]

Re: minimal spanning tree patch

To: graphthing-discuss@seul.org
Subject: Re: minimal spanning tree patch
From: Dave Symonds <ds@seul.org>
Date: Sun, 22 Feb 2004 14:55:38 +1100
Delivered-to: archiver@seul.org
Delivered-to: graphthing-discuss-outgoing@seul.org
Delivered-to: graphthing-discuss@seul.org
Delivery-date: Sat, 21 Feb 2004 23:30:19 -0500
In-reply-to: <Pine.LNX.4.58.0402211026360.3857@hp4tm17.c7.campus.utcluj.ro>
References: <Pine.LNX.4.58.0402211026360.3857@hp4tm17.c7.campus.utcluj.ro>
Reply-to: graphthing-discuss@seul.org
Sender: owner-graphthing-discuss@seul.org
User-agent: Mutt/1.5.5.1+cvs20040105i

On Sat, Feb 21, 2004 at 10:33:41AM +0200, Ion Savin wrote:
> Here is a patch to enable minimum spanning tree algorithm.
> Given a graph it selects the edges and verteces that belong to the minimum
> spanning tree. You can use "Invert selection"+delete in order to obtain
> just the spanning tree.

Great, thanks for the patch! I've integrated it into 0.9.5 after some
reformatting to fit into the existing coding style better, and it works
like a charm.


Dave.

-- 
"Computer science is no more about computers
  than astronomy is about telescopes."
	- E.W. Dijkstra

References:
- minimal spanning tree patch
  - From: Ion Savin <comp_@gmx.net>

Prev by Author: GraphThing 0.9.4 RPMs
Next by Author: GraphThing 0.9.5 released
Previous by thread: minimal spanning tree patch
Next by thread: GraphThing 0.9.5 released
Index(es):
- Author
- Thread