From: kilgallen@eisner.decus.org (Larry Kilgallen)
Subject: Re: Shortest path between two points of a graph
Date: 2000/02/09
Date: 2000-02-09T00:00:00+00:00 [thread overview]
Message-ID: <2000Feb9.075318.1@eisner> (raw)
In-Reply-To: 87qddp$t13$1@bw107zhb.bluewin.ch
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.
prev parent reply other threads:[~2000-02-09 0:00 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-02-09 0:00 Shortest path between two points of a graph helder da silva
2000-02-09 0:00 ` Ted Dennison
2000-02-17 0:00 ` G
2000-02-09 0:00 ` Larry Kilgallen [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox