From: dennison@telepath.com
Subject: Re: Dijkstra's shortest path algorithm?
Date: 1999/05/12
Date: 1999-05-12T00:00:00+00:00 [thread overview]
Message-ID: <7hc368$5sm$1@nnrp1.deja.com> (raw)
In-Reply-To: 37389A3F.C9C5C36F@santandersupernet.com
In article <37389A3F.C9C5C36F@santandersupernet.com>,
JOAQUIN <JMATAMO@santandersupernet.com> wrote:
> I am looking for the Dijkstra's shortest path algorithm.
> I have to do an exercise in class with uses it.
> Where can i find it in ADA 95.
> Joaquin
> I am using a matrix to store the graph.
I'm not sure you will be able to find a freely-available version of that
algorithm already written in Ada for you. But you should be able to find
the algorithm in some other form. Just translate that algorithm into
Ada. If you can't do that, you probably deserve a low grade anyway...
If there's some particlar part of the translation process that is
stumping you, ask us a *specific* question about it here and we should
be able to be more helpful.
--
T.E.D.
--== Sent via Deja.com http://www.deja.com/ ==--
---Share what you know. Learn what you don't.---
next prev parent reply other threads:[~1999-05-12 0:00 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-05-11 0:00 Dijkstra's shortest path algorithm? JOAQUIN
1999-05-12 0:00 ` Robert Dewar
1999-05-12 0:00 ` dennison [this message]
1999-05-13 0:00 ` JOAQUIN
1999-05-13 0:00 ` David Botton
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox