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,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.107.29.80 with SMTP id d77mr9750883iod.27.1518449803611; Mon, 12 Feb 2018 07:36:43 -0800 (PST) X-Received: by 10.157.94.15 with SMTP id d15mr455545oti.4.1518449803533; Mon, 12 Feb 2018 07:36:43 -0800 (PST) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!news.linkpendium.com!news.linkpendium.com!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!w142no1006018ita.0!news-out.google.com!s63ni2415itb.0!nntp.google.com!o66no1002197ita.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Mon, 12 Feb 2018 07:36:43 -0800 (PST) In-Reply-To: <955937c4-b9f9-4e21-9d22-98382df2f45f@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=158.135.166.110; posting-account=k4UVZAoAAAD7q5AG5HC5D7afZoN88AuC NNTP-Posting-Host: 158.135.166.110 References: <955937c4-b9f9-4e21-9d22-98382df2f45f@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: New to Ada need help implementing Warshall's algorithm From: jre11712@gmail.com Injection-Date: Mon, 12 Feb 2018 15:36:43 +0000 Content-Type: text/plain; charset="UTF-8" Xref: reader02.eternal-september.org comp.lang.ada:50386 Date: 2018-02-12T07:36:43-08:00 List-Id: On Wednesday, September 21, 2016 at 5:05:12 PM UTC-5, James Brewer wrote: > Hello I hope this is right forum for this question. I have been asked to write a program that implements Warshall's algorithm using Ada. The problem, I have never written an Ada program and I a limited time frame to put this together. > I have have the IDE installed and am in the process of writing some rudimentary programs to familiarize myself with the language but I'm afraid that I may run out of time. > > The input data I have is a series of connections between 7 to 9 entities that would be stored in a file. > > examples: A->B A->D C->D > alice->bob alice->larry bob -> larry > 1 -> 3 1 -> 5 2 -> 5 > > Any help you could offer would be greatly appreciated. > Thanks THIS GUY WAS HAVING TROUBLE WITH OLE BURRIS!!!!!