@senthil: thanks for the interest.. I did that purposely..(just wanted to see if any1 is interested or not).. here are the details...
I have a map..of a small area (say a college campus).. in OSM(openstreetmap) format or it could also be in kml (google map) format.. Now the application is supposed to take two points on the map as input and display the optimal/shortest route between them.. For ex: consider any college campus.. user enters ITY dept as the source and CSE Dept as the destination.. then our application is supposed to display the shortest/optimal path. We can also take into account the modee of transport.. Right now.. I am going through the OSM maps.. my idea is to classify the map into nodes, ways etc.. then applying the algorithm to find the shortest path.. The problem which i am facing is to classify the map into nodes, ways, finding out the distance between each node.. some of you might be having a better idea in implementing this... I request you to share it here.. Guys we have discussed lot of algos here.. but this requires the application of whatever we have learned...so please come forward and lets implement this... hoping for a positive response... Regards, Abhishek -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
