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]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
