@Abhishek: Let me know your input we can modify it accordingly. On Thu, Jul 1, 2010 at 2:05 PM, Anand <anandut2...@gmail.com> wrote:
> I wrote a small code for finding the shortest path from any given to node > to every other node present in the network. > > I am using adjacency matrix for indicating the edges between the node and > Distance matrix for indication the between any two connected edges. This > could be a good starting point. > > http://codepad.org/pts7KuB2 > > Thanks, > Anand > > On Tue, Jun 29, 2010 at 4:05 PM, Anand <anandut2...@gmail.com> wrote: > >> @ Abhishek, >> >> Initially to start with let's take every Dept as Nodes and find the >> shortest route between them. if this works we can extend it further for >> other areas also. >> >> >> >> >> On Mon, Jun 28, 2010 at 10:31 AM, Abhishek Sharma <jkabhishe...@gmail.com >> > wrote: >> >>> @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<algogeeks%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> > -- 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.
