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
X-Google-Thread: 103376,5a8bef5d2b8ce055
X-Google-Attributes: gid103376,public
From: David Botton <David@Botton.com>
Subject: Re: Dijkstra's shortest path algorithm?
Date: 1999/05/13
Message-ID: <373ADE68.6D55A63C@Botton.com>#1/1
X-Deja-AN: 477427305
Content-Transfer-Encoding: 8bit
References: <37389A3F.C9C5C36F@santandersupernet.com>
 <373A8DC7.14CD2305@santandersupernet.com>
X-Accept-Language: en
Content-Type: text/plain; charset=iso-8859-1
X-Complaints-To: abuse@gate.net
X-Trace: news.gate.net 926604906 23328 199.227.148.215 (13 May 1999 14:15:06
 GMT)
Organization: CyberGate, Inc.
Mime-Version: 1.0
NNTP-Posting-Date: 13 May 1999 14:15:06 GMT
Newsgroups: comp.lang.ada
Date: 1999-05-13T14:15:06+00:00
List-Id: <comp.lang.ada>

Perhaps post it on www.adapower.com

David Botton


JOAQUIN wrote:
> 
> JOAQUIN escribi�:
> 
> > 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.
> 
> got it, i have done it, i will post it soon  to everyone who wants it,
> 
> Joaquin