From: "Alex R. Mosteo" <devnull@mailinator.com>
Subject: Graph library with minimum spanning tree
Date: Wed, 03 Oct 2007 16:38:24 +0200
Date: 2007-10-03T16:38:24+02:00 [thread overview]
Message-ID: <5mhnr2Fdkeo9U1@mid.individual.net> (raw)
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?
next reply other threads:[~2007-10-03 14:38 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2007-10-03 14:38 Alex R. Mosteo [this message]
2007-10-04 12:34 ` Graph library with minimum spanning tree Georg Bauhaus
2007-10-04 18:46 ` Alex R. Mosteo
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