i had already understood what you claimed But MY CLAIM: every pair of nodes in the connected component is connected to every other node in the same connected component. U CANNOT UPDATE ALL THE PAIRS AS EASILY AS U ARE SAYING. For any two nodes in DFS of Graph corresponding entry is 1. Got it?
-- 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.
