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 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,5ef86a63a9935f39 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-06-28 22:52:01 PST Path: archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!dispose.news.demon.net!news.demon.co.uk!demon!pogner.demon.co.uk!zap!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Easiest graph pakcage Date: 29 Jun 2001 06:13:26 +0100 Organization: CodeFella Message-ID: References: <9hdc6v$ln3$1@news.huji.ac.il> NNTP-Posting-Host: localhost X-NNTP-Posting-Host: pogner.demon.co.uk:158.152.70.98 X-Trace: news.demon.co.uk 993793861 nnrp-01:4974 NO-IDENT pogner.demon.co.uk:158.152.70.98 X-Complaints-To: abuse@demon.net NNTP-Posting-Date: 29 Jun 2001 05:13:26 GMT X-Newsreader: Gnus v5.7/Emacs 20.7 Xref: archiver1.google.com comp.lang.ada:9233 Date: 2001-06-29T05:13:26+00:00 List-Id: Ted Dennison 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?