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

Re: minimal spanning tree patch

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.


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