[mapguide-users] Shortest path between two points
techswami at hotmail.com
Sat Dec 15 04:47:01 EST 2007
can you guys share code here so we can get detail idea how you used it, i
think this will be great to have routing in MGOS , please provide code and
some instrctions that would be great help
Jorge Rubio wrote:
> Hi Dhirendra
> years ago we wrote some code for shortest path using MG4. We used Dijkstra
> I will try to describe briefly what we did.
> We generated network topology using Autocad Map.
> We wrote lisp routines to store topology info on a data base.
> We wrote lisp routines to get nodes coordinates and perform distance
> calculations between them in order to fill Dijkstra arrays (and store them
> on a data base).
> We wrote routines to get closest nodes from starting and ending adresses.
> We uses Dijkstra algorithm to calculate shortest path.
> Once we got the nodes ordered form startng to ending points, we queried
> topology to get the liks between the nodes.
> Then we displayed them on MG.
> You can find Dijkstra algorithm in internet written in many languajes like
> c, c++ an so on.
> 2007/6/18, Dhirendra Kumar <dhirendra.mgos at gmail.com>:
>> Hi All,
>> I want to find out shortest path between two given points, Please anyone
>> give me idea about it. Thankyou in Advance.
>> Dhirendra Kumar
>> View this message in context:
>> Sent from the MapGuide Users mailing list archive at Nabble.com.
>> mapguide-users mailing list
>> mapguide-users at lists.osgeo.org
> Lic. Jorge Rubio
> mapguide-users mailing list
> mapguide-users at lists.osgeo.org
View this message in context: http://www.nabble.com/Shortest-path-between-two-points-tp11188505s16610p14349265.html
Sent from the MapGuide Users mailing list archive at Nabble.com.
More information about the mapguide-users