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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4213dc3f3c38df8e X-Google-Attributes: gid103376,public From: Charles Hixson Subject: Re: need ada implementation Date: 2000/04/04 Message-ID: <38EA18E7.9257C3BF@earthlink.net>#1/1 X-Deja-AN: 606627455 Content-Transfer-Encoding: 7bit References: <8ccmj0$e1o$1@bunyip.cc.uq.edu.au> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-Complaints-To: abuse@earthlink.net X-Trace: newsread2.prod.itd.earthlink.net 954865897 198.94.156.19 (Tue, 04 Apr 2000 09:31:37 PDT) Organization: EarthLink Inc. -- http://www.EarthLink.net MIME-Version: 1.0 NNTP-Posting-Date: Tue, 04 Apr 2000 09:31:37 PDT Newsgroups: comp.lang.ada Date: 2000-04-04T00:00:00+00:00 List-Id: I'd start with Knuth's The Art of Computer Programming (V.3, I think). But any good book on Algorithms should give you what you want. It's fairly easy to translate from Pascal or C into Ada, so you could look into Wirth's Algorithms + Data Structures = Programs. Then there are the Sedgwick books on Algorithms. None of these are specifically Ada, but I think that there's a red-black tree at the AdaPower site that you could adapt. Riyaz Mansoor wrote: > hi guys > > i need a an ada implementaion of the algorithms for doing > > 1) breadth first search > 2) depth first search > > can anyone give me web address or 'anything' ? > > thanx > > riyaz > > *******************