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!news2.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed01.chello.at!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Thu, 04 Oct 2007 14:34:54 +0200
From: Georg Bauhaus <rm.tsoh+bauhaus@maps.futureapps.de>
User-Agent: Thunderbird 2.0.0.6 (Windows/20070728)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Graph library with minimum spanning tree
References: <5mhnr2Fdkeo9U1@mid.individual.net>
In-Reply-To: <5mhnr2Fdkeo9U1@mid.individual.net>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <4704ddee$0$30381$9b4e6d93@newsspool4.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 04 Oct 2007 14:34:54 CEST
NNTP-Posting-Host: 6c86f653.newsspool4.arcor-online.net
X-Trace: 
 DXC=1gFMgS3DL4Xf8j24CD<3lP4IUK<Cl32<Q4Fo<]lROoRQ^YC2XCjHcbYFNRc[_KfYlUN[W<lHX`=BT\6BhD5G6\i\hh`U40PkabT
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:2294
Date: 2007-10-04T14:34:54+02:00
List-Id: <comp.lang.ada>

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