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,
	MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5a8bef5d2b8ce055
X-Google-Attributes: gid103376,public
From: dennison@telepath.com
Subject: Re: Dijkstra's shortest path algorithm?
Date: 1999/05/12
Message-ID: <7hc368$5sm$1@nnrp1.deja.com>#1/1
X-Deja-AN: 477002895
References: <37389A3F.C9C5C36F@santandersupernet.com>
X-Http-Proxy: 1.0 x42.deja.com:80 (Squid/1.1.22) for client 204.48.27.130
Organization: Deja.com - Share what you know. Learn what you don't.
X-Article-Creation-Date: Wed May 12 14:28:56 1999 GMT
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.5 [en] (WinNT; I)
Date: 1999-05-12T00:00:00+00:00
List-Id: <comp.lang.ada>

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.---