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,XPRIO autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,5ef86a63a9935f39,start X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-06-27 12:31:45 PST Path: archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!logbridge.uoregon.edu!news.huji.ac.il!not-for-mail From: "Ehud Lamm" Newsgroups: comp.lang.ada Subject: Easiest graph pakcage Date: Wed, 27 Jun 2001 22:21:54 +0300 Organization: The Hebrew University of Jerusalem Message-ID: <9hdc6v$ln3$1@news.huji.ac.il> NNTP-Posting-Host: di2-89.dialin.huji.ac.il X-Trace: news.huji.ac.il 993670176 22243 132.64.12.89 (27 Jun 2001 19:29:36 GMT) X-Complaints-To: abuse@news.huji.ac.il NNTP-Posting-Date: Wed, 27 Jun 2001 19:29:36 +0000 (UTC) X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.00.2014.211 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2014.211 Xref: archiver1.google.com comp.lang.ada:9160 Date: 2001-06-27T22:21:54+03:00 List-Id: 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!