From: Georg Bauhaus <rm.tsoh+bauhaus@maps.futureapps.de>
Subject: Re: Graph library with minimum spanning tree
Date: Thu, 04 Oct 2007 14:34:54 +0200
Date: 2007-10-04T14:34:54+02:00 [thread overview]
Message-ID: <4704ddee$0$30381$9b4e6d93@newsspool4.arcor-online.net> (raw)
In-Reply-To: <5mhnr2Fdkeo9U1@mid.individual.net>
Alex R. Mosteo wrote:
> Dear all,
>
> I'm interested in a weighted graph library with algorithms for finding the
> minimum spanning tree (Prim's or so) before rolling out my own. Booch and
> ASL have graph containers but no algorithms AFAIK. A binding (to Boost for
> example) would also be ok.
>
> Do you know of such a thing out there?
http://www.algorithmic-solutions.info/leda_guide/graph_algorithms/spanning_tree.html
next prev parent reply other threads:[~2007-10-04 12:34 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2007-10-03 14:38 Graph library with minimum spanning tree Alex R. Mosteo
2007-10-04 12:34 ` Georg Bauhaus [this message]
2007-10-04 18:46 ` Alex R. Mosteo
2007-10-04 19:49 ` Georg Bauhaus
2007-10-04 22:51 ` Alex R. Mosteo
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox