Graph library with minimum spanning tree

Graph library with minimum spanning tree

[Alex R. Mosteo]

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?

Re: Graph library with minimum spanning tree

[Georg Bauhaus]

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

Re: Graph library with minimum spanning tree

[Alex R. Mosteo]

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?

Re: Graph library with minimum spanning tree

[Georg Bauhaus]

On Thu, 2007-10-04 at 20:46 +0200, Alex R. Mosteo wrote:
> 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?

No, sorry. I was too quick in switching from "binding" to LEDA
as an interesting possibility.

Re: Graph library with minimum spanning tree

[Alex R. Mosteo]

Georg Bauhaus wrote:

> On Thu, 2007-10-04 at 20:46 +0200, Alex R. Mosteo wrote:
>> 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?
> 
> No, sorry. I was too quick in switching from "binding" to LEDA
> as an interesting possibility.

Well -- it is. At least is seems simpler than Boost. Now, my situation is
that the two Ada libraries lack algorithms, and the two that have it don't
have Ada bindings :)