i will choose BFS. As we just don't want to show a connection.. we want to show the shortest one.
On Sat, Sep 18, 2010 at 4:12 PM, soundar <soundha...@gmail.com> wrote: > Even if u are connected to that person via some another friend it'll > show the shortest chain by which you are connected to that > person......So DFS will be optimum i guess........Why do you think it > wouldn't be optimum.....? > > -- > 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.
