From: "Ehud Lamm" <mslamm@mscc.huji.ac.il>
Subject: Easiest graph pakcage
Date: Wed, 27 Jun 2001 22:21:54 +0300
Date: 2001-06-27T22:21:54+03:00 [thread overview]
Message-ID: <9hdc6v$ln3$1@news.huji.ac.il> (raw)
What's the easiest to use package for graph based algortihms? I am looking
for something the exports a graph data type, and allows the obvious
operations. Not something overly clever, just something that can be easily
resued by students to build interesting stuff that's based on using graph
representations. I'd love to have the standard operations (e.g., transitive
closure) but I can even live without those. I want the package to use as
basic Ada as possible, which essentially means no tagged types. Generic are
fine.
I know of the Booch components, of course, but it seems to me that
installing them and understanding their terminology (managed/unmanaged etc.)
is quite an overkill for what I have in mind.
Any suggestions?
--
Ehud Lamm mslamm@mscc.huji.ac.il
http://purl.oclc.org/NET/ehudlamm <== Me!
next reply other threads:[~2001-06-27 19:21 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2001-06-27 19:21 Ehud Lamm [this message]
2001-06-27 20:45 ` Easiest graph pakcage Ted Dennison
2001-06-29 5:13 ` Simon Wright
2001-06-29 8:15 ` Ehud Lamm
2001-06-29 14:32 ` Ted Dennison
2001-06-27 20:55 ` Pat Rogers
2001-06-27 22:30 ` Ehud Lamm
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox