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.36.214.212 with SMTP id o203mr1648564itg.34.1474495504047; Wed, 21 Sep 2016 15:05:04 -0700 (PDT) X-Received: by 10.157.43.242 with SMTP id u105mr1169417ota.17.1474495504017; Wed, 21 Sep 2016 15:05:04 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!news.glorb.com!x192no2968042itb.0!news-out.google.com!w143ni8348itb.0!nntp.google.com!x192no2968040itb.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 21 Sep 2016 15:05:03 -0700 (PDT) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=2601:2c4:103:6d70:91a:dab:cb08:1097; posting-account=bfqYCQoAAADhOBV9jx08D2gm5EA72sgj NNTP-Posting-Host: 2601:2c4:103:6d70:91a:dab:cb08:1097 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <955937c4-b9f9-4e21-9d22-98382df2f45f@googlegroups.com> Subject: New to Ada need help implementing Warshall's algorithm From: James Brewer Injection-Date: Wed, 21 Sep 2016 22:05:04 +0000 Content-Type: text/plain; charset=UTF-8 Xref: news.eternal-september.org comp.lang.ada:31834 Date: 2016-09-21T15:05:03-07:00 List-Id: 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