From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,b56070c6f56f1b4e
X-Google-Attributes: gid103376,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news3.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Newsgroups: comp.lang.ada
Subject: Re: Graph library with minimum spanning tree
From: Georg Bauhaus <rm.tsoh+bauhaus@maps.futureapps.de>
In-Reply-To: <5mkqnnFdtrpdU1@mid.individual.net>
References: <5mhnr2Fdkeo9U1@mid.individual.net>
	 <4704ddee$0$30381$9b4e6d93@newsspool4.arcor-online.net>
	 <5mkqnnFdtrpdU1@mid.individual.net>
Content-Type: text/plain
Content-Transfer-Encoding: 7bit
Message-Id: <1191527378.15721.30.camel@kartoffel>
Mime-Version: 1.0
X-Mailer: Evolution 2.10.1 
Date: Thu, 04 Oct 2007 21:49:38 +0200
Organization: Arcor
NNTP-Posting-Date: 04 Oct 2007 21:49:34 CEST
NNTP-Posting-Host: 64b0d647.newsspool1.arcor-online.net
X-Trace: 
 DXC=DVZoIPM[<UYYI9]OHn9o5^ic==]BZ:af^4Fo<]lROoRQ4nDHegD_]RUUPA4EGQ5QH\N[W<lHX`=BT\6BhD5G6\i\TK^V`cXUoPW
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:2301
Date: 2007-10-04T21:49:34+02:00
List-Id: <comp.lang.ada>

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.