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.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4492ca3223e4184
X-Google-Attributes: gid103376,public
From: kilgallen@eisner.decus.org (Larry Kilgallen)
Subject: Re: Shortest path between two points of a graph
Date: 2000/02/09
Message-ID: <2000Feb9.075318.1@eisner>#1/1
X-Deja-AN: 583644331
References: <87qddp$t13$1@bw107zhb.bluewin.ch>
X-Trace: news.decus.org 950100804 24286 KILGALLEN [216.44.122.34]
Organization: LJK Software
Reply-To: Kilgallen@eisner.decus.org.nospam
Newsgroups: comp.lang.ada
Date: 2000-02-09T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <87qddp$t13$1@bw107zhb.bluewin.ch>, "helder da silva" <pc-tech@bluewin.ch> writes:
> Algorithms, Graphs :
> 
> I found how to calculate the shortest path between two points of a graph,
> http://www.ee.uwa.edu.au/~plsd210/ds/dijkstra.html
> 
> but how to know which points exactly the path goes through ?

You do it by using mathematics, which would be covered somewhere other
that the Ada newsgroup.