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

make_undirected_graph(+DirectedGraph, -UndirectedGraph)

Creates an undirected from a directed graph
a graph structure
will be bound to a graph structure


Creates an undirected graph from a directed graph by adding reverse edges for every existing edge (with EdgeData being shared). Moreover, all loops (edges from S to S) are removed from the undirected graph.

Modes and Determinism

See Also

graph_is_bidirected / 1