[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
graph_is_bidirected(+Graph)
Tests whether a graph is bidirected
- Graph
- a graph structure
Description
A graph is bidirected if for every edge from S to T there is a
corresponding edge from T to S. In case of loops (i.e. an edge
from S to S) a second, different edge from S to S is required
to satisfy the bidirectedness condition.
Modes and Determinism
- graph_is_bidirected(+) is semidet
See Also
make_undirected_graph / 2