hard20 pts · first answer countsgraphsdfsstrongly-connected

Is every node reachable from every node

How can you check that a directed graph is strongly connected in O(V + E)?

A.Run DFS from every node and check each reaches allB.Search from one node in the graph and in its reverse; both must reach allC.Check that every node has in-degree and out-degree at least 1D.Check that the undirected version is connected

Discussion 0

Join free to post in the discussion.

Is every node reachable from every node

Discussion 0

Related questions