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,XPRIO autolearn=no autolearn_force=no
	version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4492ca3223e4184,start
X-Google-Attributes: gid103376,public
From: "helder da silva" <pc-tech@bluewin.ch>
Subject: Shortest path between two points of a graph
Date: 2000/02/09
Message-ID: <87qddp$t13$1@bw107zhb.bluewin.ch>#1/1
X-Deja-AN: 583455401
X-Trace: bw107zhb.bluewin.ch 950057209 29731 195.186.169.98 (9 Feb 2000
 00:46:49 GMT)
Organization: Swisscom AG, the blue window
X-MSMail-Priority: Normal
X-Priority: 3
Reply-To: "helder da silva" <pc-tech@bluewin.ch>
NNTP-Posting-Date: 9 Feb 2000 00:46:49 GMT
Newsgroups: comp.lang.ada
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
X-Complaints-To: newsmaster@bluewin.ch
Date: 2000-02-09T00:46:49+00:00
List-Id: <comp.lang.ada>

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 ?