Re: Shortest path between two points of a graph

[Ted Dennison <dennison@telepath.com>]

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.