right!! On Wed, Nov 25, 2009 at 4:38 PM, Aditya Shankar < iitm.adityashan...@gmail.com> wrote:
> > > On Wed, Nov 25, 2009 at 2:13 PM, Ankur Parashar <ankurlnm...@gmail.com>wrote: > >> Use Flyod Warshal.....All pair shortest path algo. >> initialise d[0] = 1 (i,j) is and edge >> now apply flyod warhsal > > That is O(n^3) right? > >> >> >> On Wed, Nov 25, 2009 at 8:59 AM, Aditya Shankar < >> iitm.adityashan...@gmail.com> wrote: >> >>> >>> On Tue, Nov 24, 2009 at 10:46 PM, Rohit Saraf < >>> rohit.kumar.sa...@gmail.com> wrote: >>> >>>> 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? >>>> >>> If the problem is to _fill_ up matrix entries, unless you can get around >>> using adjacency lists/matrices, your complexity will be O(n^2). However, we >>> can use an implicit data structure, since all nodes are connected to each >>> other. Just use a vector of sets, each set containing the vertices of a >>> connected component. >>> >>> Regards >>> Aditya Shankar >>> >>> >>> >>>> -- >>>> 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<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<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<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.
