oops, my warshall algo will simply tell if there exists a path or not!! to find if the path exist between two nodes of length K in O(K) is interesting..i donot understand the logic of this problem, why of length k in O(k), any real problem on this?
Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 On Tue, Jul 6, 2010 at 7:11 AM, Devendra Pratap Singh < [email protected]> wrote: > @ashish > > how using trasistivity matrix .. will u prepare matrix for each value > of k or something else ... ?? > > > On Jul 5, 8:52 am, Ashish Goel <[email protected]> wrote: > > i would prepare the transitivity matrix while inserting the edge into the > > matrix > > > > the search then would be a O(1) > > > > Best Regards > > Ashish Goel > > "Think positive and find fuel in failure" > > +919985813081 > > +919966006652 > > > > On Sun, Jul 4, 2010 at 3:15 PM, jalaj jaiswal <[email protected] > >wrote: > > > > > A graph is given. You need to design a data structure with minimum > space > > > complexity such that it does the follows > > > --> Finds whether nodes u and v have a path in between them in O(1) > time. > > > --> Finds whether there is a path of length k between u and v in O(k) > time. > > > The same data structure to be used for both the purposes. > > > > > -- > > > With Regards, > > > Jalaj Jaiswal > > > +919026283397 > > > B.TECH IT > > > IIIT ALLAHABAD > > > > > -- > > > 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]> > <algogeeks%[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]<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.
