[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]


Tests whether a graph is bidirected
a graph structure


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

See Also

make_undirected_graph / 2