On Tue, Nov 24, 2009 at 3:21 PM, Rohit Saraf <[email protected]>wrote:
> @aditya: If you run DFS once.. you can in O(1) decide whether a point is > connected to the root of dfs tree. > but not with other points. > It is an undirected graph right? So, you can go from node A to root to node B, if you want to prove that two nodes that you have visited in the same dfs tree are connected. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
