Time complexity error - Githubissues

DeathStroke19891 / CP_Notes

5 stars 3 forks source link

Open SarangSpin opened 1 month ago

SarangSpin commented 1 month ago

In graph notes, 3rd question on directed acyclic graph ancestors identification the time complexity should be O(V(V+E)) right?

DeathStroke19891 commented 1 month ago

Yes. Will fix in next graphs PR about LCA and articulation points.