next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Graphs
(missing documentation) ::
isWeaklyConnected
isWeaklyConnected -- checks if a digraph is weakly connected
Synopsis
Usage:
r = isWeaklyConnected D
Inputs:
D
,
an object of class
Digraph
(missing documentation)
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
See also
weaklyConnectedComponents
(missing documentation)
isStronglyConnected
-- checks if a digraph is strongly connected
Ways to use
isWeaklyConnected
:
isWeaklyConnected(Digraph)