Which of the following statements is true about weakly connected graphs?

Question

Accepted Answer

In a weakly connected graph, there is an undirected path between every pair of 
 nodes when treating the graph as undirected.

Answer

A weakly connected graph has a directed path between every pair of nodes, 
 regardless of edge direction.

Answer

A weakly connected graph must also be strongly connected.

Answer

A weakly connected graph has a directed path between every pair of nodes, but 
 only in directed graphs.

Answer

A weakly connected graph has no directed path between any pair of nodes.

Crowdly