* Re: Shortest path between two points of a graph
2000-02-09 0:00 Shortest path between two points of a graph helder da silva
@ 2000-02-09 0:00 ` Larry Kilgallen
2000-02-09 0:00 ` Ted Dennison
1 sibling, 0 replies; 4+ messages in thread
From: Larry Kilgallen @ 2000-02-09 0:00 UTC (permalink / raw)
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.
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: Shortest path between two points of a graph
2000-02-09 0:00 Shortest path between two points of a graph helder da silva
2000-02-09 0:00 ` Larry Kilgallen
@ 2000-02-09 0:00 ` Ted Dennison
2000-02-17 0:00 ` G
1 sibling, 1 reply; 4+ messages in thread
From: Ted Dennison @ 2000-02-09 0:00 UTC (permalink / raw)
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.
^ permalink raw reply [flat|nested] 4+ messages in thread
* Shortest path between two points of a graph
@ 2000-02-09 0:00 helder da silva
2000-02-09 0:00 ` Larry Kilgallen
2000-02-09 0:00 ` Ted Dennison
0 siblings, 2 replies; 4+ messages in thread
From: helder da silva @ 2000-02-09 0:00 UTC (permalink / raw)
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 ?
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: Shortest path between two points of a graph
2000-02-09 0:00 ` Ted Dennison
@ 2000-02-17 0:00 ` G
0 siblings, 0 replies; 4+ messages in thread
From: G @ 2000-02-17 0:00 UTC (permalink / raw)
ASSET_A_230
If you can find that file on asset.com, you will find implementations in
Ada95 of the
algorithm in 2 and 3-dimensional spaces.
-G.
^ permalink raw reply [flat|nested] 4+ messages in thread
end of thread, other threads:[~2000-02-17 0:00 UTC | newest]
Thread overview: 4+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2000-02-09 0:00 Shortest path between two points of a graph helder da silva
2000-02-09 0:00 ` Larry Kilgallen
2000-02-09 0:00 ` Ted Dennison
2000-02-17 0:00 ` G
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox