Quiz: SCC Count

Flight Routes Check: Determine if you can travel from any city to any other city. The directed graph has $n$ nodes. When is this true?

1. A.When every node has at least one outgoing edge
2. B.When there's exactly $1$ SCC containing all nodes
3. C.When the graph has $n - 1$ edges
4. D.When the graph is connected (ignoring direction)