From: Simon Wright <simon@pushface.org>
Subject: Re: Easiest graph pakcage
Date: 29 Jun 2001 06:13:26 +0100
Date: 2001-06-29T05:13:26+00:00 [thread overview]
Message-ID: <x7vofr7vpft.fsf@smaug.pushface.org> (raw)
In-Reply-To: VBr_6.1152$f4.17664@www.newsranger.com
Ted Dennison<dennison@telepath.com> writes:
> In article <9hdc6v$ln3$1@news.huji.ac.il>, Ehud Lamm says...
> >operations. Not something overly clever, just something that can be easily
> >resued by students to build interesting stuff that's based on using graph
> ..
> >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.
>
> I certianly wouldn't envy someone trying to explain to Ada novices
> how to instantiate those packages.
Oh, so a (brief?) tutorial would be in order for the next release?
next prev parent reply other threads:[~2001-06-29 5:13 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 [this message]
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