an adjacency matrix.... On Sun, Jul 11, 2010 at 8:45 AM, sharad <[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. > > -- > 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. > > -- yezhu malai vaasa venkataramana Govinda Govinda -- 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.
