comp.lang.ada
 help / color / mirror / Atom feed
From: "Pat Rogers" <progers@classwide.com>
Subject: Re: Easiest graph pakcage
Date: Wed, 27 Jun 2001 15:55:44 -0500
Date: 2001-06-27T15:55:44-05:00	[thread overview]
Message-ID: <kLr_6.821$rs5.5741@nnrp1.sbc.net> (raw)
In-Reply-To: 9hdc6v$ln3$1@news.huji.ac.il

The "NOSC Tools" for Ada 83 that were developed by Intermetrics has a graph
package I've used many times in the past.  I believe those packages are on
the PAL, or the ASR, or whatever it is called nowadays...

"Ehud Lamm" <mslamm@mscc.huji.ac.il> wrote in message
news:9hdc6v$ln3$1@news.huji.ac.il...
> 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!
>
>
>
>
>
>





  parent reply	other threads:[~2001-06-27 20:55 UTC|newest]

Thread overview: 7+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2001-06-27 19:21 Easiest graph pakcage Ehud Lamm
2001-06-27 20:45 ` 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 [this message]
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