<div>Hi Dhirendra</div>
<div> </div>
<div>years ago we wrote some code for shortest path using MG4. We used Dijkstra procedures.</div>
<div>I will try to describe briefly what we did.</div>
<div> </div>
<div>We generated network topology using Autocad Map.</div>
<div>We wrote lisp routines to store topology info on a data base.</div>
<div>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).</div>
<div>We wrote routines to get closest nodes from starting and ending adresses.</div>
<div>We uses Dijkstra algorithm to calculate shortest path.</div>
<div>Once we got the nodes ordered form startng to ending points, we queried the topology to get the liks between the nodes.</div>
<div>Then we displayed them on MG.</div>
<div> </div>
<div>You can find Dijkstra algorithm in internet written in many languajes like c, c++ an so on.</div>
<div> </div>
<div> </div>
<div><br><br> </div>
<div><span class="gmail_quote">2007/6/18, Dhirendra Kumar <<a href="mailto:dhirendra.mgos@gmail.com">dhirendra.mgos@gmail.com</a>>:</span>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid"><br>Hi All,<br><br>I want to find out shortest path between two given points, Please anyone<br>give me idea about it. Thankyou in Advance.
<br><br><br>Regards,<br><br>Dhirendra Kumar<br>--<br>View this message in context: <a href="http://www.nabble.com/Shortest-path-between-two-points-tf3944291s16610.html#a11188505">http://www.nabble.com/Shortest-path-between-two-points-tf3944291s16610.html#a11188505
</a><br>Sent from the MapGuide Users mailing list archive at <a href="http://Nabble.com">Nabble.com</a>.<br><br>_______________________________________________<br>mapguide-users mailing list<br><a href="mailto:mapguide-users@lists.osgeo.org">
mapguide-users@lists.osgeo.org</a><br><a href="http://lists.osgeo.org/mailman/listinfo/mapguide-users">http://lists.osgeo.org/mailman/listinfo/mapguide-users</a><br></blockquote></div><br><br clear="all"><br>-- <br>Lic. Jorge Rubio