Skip to main content

All Questions

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
0 answers
69 views

Digraph weak connectivity in $O(V)$ space and $O(V+E)$ time

A digraph is called weakly connected if its underlying undirected graph is connected. You are given a digraph $G$ with $V$ vertices and $E$ edges as a read-only data structure consisting of lists of ...
Brendan McKay's user avatar