[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
# make_undirected_graph(+DirectedGraph, -UndirectedGraph)

Creates an undirected from a directed graph
*DirectedGraph*
- a graph structure
*UndirectedGraph*
- will be bound to a graph structure

## Description

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

- make_undirected_graph(+, -) is det

## See Also

graph_is_bidirected / 1