From: "Alex R. Mosteo" <devnull@mailinator.com>
Subject: Re: Graph library with minimum spanning tree
Date: Thu, 04 Oct 2007 20:46:15 +0200
Date: 2007-10-04T20:46:15+02:00 [thread overview]
Message-ID: <5mkqnnFdtrpdU1@mid.individual.net> (raw)
In-Reply-To: 4704ddee$0$30381$9b4e6d93@newsspool4.arcor-online.net
Georg Bauhaus wrote:
> 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
Thanks. Am I missing something of that's C++ without Ada bindings?
next prev parent reply other threads:[~2007-10-04 18:46 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
2007-10-04 18:46 ` Alex R. Mosteo [this message]
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