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,
	MSGID_RANDY 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: Ted Dennison <dennison@telepath.com>
Subject: Re: Shortest path between two points of a graph
Date: 2000/02/09
Message-ID: <87sb6o$nc3$1@nnrp1.deja.com>#1/1
X-Deja-AN: 583731485
References: <87qddp$t13$1@bw107zhb.bluewin.ch>
X-Http-Proxy: 1.0 x30.deja.com:80 (Squid/1.1.22) for client 204.48.27.130
Organization: Deja.com - Before you buy.
X-Article-Creation-Date: Wed Feb 09 18:21:18 2000 GMT
X-MyDeja-Info: XMYDJUIDtedennison
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.7 [en] (WinNT; I)
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> wrote:
> 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 ?

I suspect that algorithm finds exactly that. Otherwise its just telling
you that there *is* a shortest path, which is equivalent to finding if
there is *any* path, in which case I suspect Dijkstra would have billed
it as such. He's a pretty smart guy. :-)

If this is an assignment for a class, I'd highly suggest talking this
over with your instructor. That's what you're paying them for. Either
way, this is an algorithm question, not an Ada question.

--
T.E.D.

http://www.telepath.com/~dennison/Ted/TED.html


Sent via Deja.com http://www.deja.com/
Before you buy.