Ok bfs cannot be used in this. I thought that as the graph is un weighted I could use bfs. Thanks for your advice. Thanks for that idea. Actually for dijkstra I need to have a node list. Could you tell me what should I consider as node. I think I should take node as each (x,y) pair ?
On Mon, Jun 13, 2011 at 5:19 PM, Divye Kapoor <divyekap...@gmail.com> wrote: > You could also use a priority queue based search (A*) where you explore all > vertices with cost 0 before exploring all vertices with cost 1 etc. > Essentially, that is the same as Dijkstra's in this case. > > -- > DK > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/5Po4JF4ZD_YJ. > > To post to this group, send email to algogeeks@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. > -- Thanks and Regards , Gaurav Saxena -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
