isWeaklyConnected -- checks if a digraph is weakly connected

Usage:

r = isWeaklyConnected D
Inputs:
- D, a digraph,
Outputs:
- r, a Boolean value,

Description

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.

i1 : D = digraph({1,2,3,4},{{1,2},{2,3},{3,4},{4,2}});

i2 : isWeaklyConnected D

o2 = true

Ways to use isWeaklyConnected:

isWeaklyConnected(Digraph)

For the programmer

The object isWeaklyConnected is a method function.

The source of this document is in Graphs.m2:4751:0.

isWeaklyConnected -- checks if a digraph is weakly connected

Description

See also

Ways to use isWeaklyConnected:

For the programmer