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
	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: Robert Dewar <robert_dewar@my-dejanews.com>
Subject: Re: Dijkstra's shortest path algorithm?
Date: 1999/05/12
Message-ID: <7hal7n$be$1@nnrp1.deja.com>#1/1
X-Deja-AN: 476806797
References: <37389A3F.C9C5C36F@santandersupernet.com>
X-Http-Proxy: 1.0 x40.deja.com:80 (Squid/1.1.22) for client 205.232.38.14
Organization: Deja.com - Share what you know. Learn what you don't.
X-Article-Creation-Date: Wed May 12 01:24:11 1999 GMT
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; 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.

Perhaps the instructor expects you to research the algorithm
and then design and code the Ada 95 program yourself .... or
is this a class in how to get information from the internet?




--== Sent via Deja.com http://www.deja.com/ ==--
---Share what you know. Learn what you don't.---