Open SarangSpin opened 1 month ago
In graph notes, 3rd question on directed acyclic graph ancestors identification the time complexity should be O(V(V+E)) right?
Yes. Will fix in next graphs PR about LCA and articulation points.
In graph notes, 3rd question on directed acyclic graph ancestors identification the time complexity should be O(V(V+E)) right?