You are given a graph G. if there exists a path from ai to aj in G, then store in matrix CLOSUREMATRIX[i][j]=1 You have to find connectivity between all pairs. is it clear now?
-- 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.
