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=0.6 required=5.0 tests=BAYES_40,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5a8bef5d2b8ce055,start
X-Google-Attributes: gid103376,public
From: JOAQUIN <JMATAMO@santandersupernet.com>
Subject: Dijkstra's shortest path algorithm?
Date: 1999/05/11
Message-ID: <37389A3F.C9C5C36F@santandersupernet.com>#1/1
X-Deja-AN: 476739089
Content-Transfer-Encoding: 7bit
Organization: Telefonica Transmision de Datos
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1999-05-11T00:00:00+00:00
List-Id: <comp.lang.ada>

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.