r = isWeaklyConnected D
A digraph is said to be weakly connected if the underlying graph of D, that is, the graph formed by taking away direction from the edges so each edge becomes "2-way" again, is connected.
|
|
The object isWeaklyConnected is a method function.