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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,b56070c6f56f1b4e,start
X-Google-Attributes: gid103376,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news3.google.com!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: "Alex R. Mosteo" <devnull@mailinator.com>
Newsgroups: comp.lang.ada
Subject: Graph library with minimum spanning tree
Date: Wed, 03 Oct 2007 16:38:24 +0200
Message-ID: <5mhnr2Fdkeo9U1@mid.individual.net>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7Bit
X-Trace: individual.net gn77UQdad1JcC5WrvcLfdQTETFnymsww9MtO/YCHDeOb1Slzo=
Cancel-Lock: sha1:IXcZioM5egP6/zU4h3cpcMGmlJQ=
User-Agent: KNode/0.10.5
Xref: g2news2.google.com comp.lang.ada:2265
Date: 2007-10-03T16:38:24+02:00
List-Id: <comp.lang.ada>

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?