From: James Brewer <firstvestor@gmail.com>
Subject: New to Ada need help implementing Warshall's algorithm
Date: Wed, 21 Sep 2016 15:05:03 -0700 (PDT)
Date: 2016-09-21T15:05:03-07:00 [thread overview]
Message-ID: <955937c4-b9f9-4e21-9d22-98382df2f45f@googlegroups.com> (raw)
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
next reply other threads:[~2016-09-21 22:05 UTC|newest]
Thread overview: 11+ messages / expand[flat|nested] mbox.gz Atom feed top
2016-09-21 22:05 James Brewer [this message]
2016-09-23 4:31 ` New to Ada need help implementing Warshall's algorithm Shark8
2016-09-23 6:26 ` Simon Wright
2016-09-23 15:07 ` James Brewer
2016-09-25 16:06 ` Stephen Leake
2016-09-26 20:40 ` Simon Wright
2016-09-23 14:54 ` James Brewer
2018-02-12 17:45 ` Lucretia
2016-09-26 17:38 ` James Brewer
2016-09-26 18:29 ` Stephen Leake
2018-02-12 15:36 ` jre11712
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox