UndirectedGraph

UndirectedGraph[g] gives an undirected graph from the directed graph g.

• UndirectedGraph[{v -> w, ...}] uses rules v -> w to specify the graph g.

This function converts a directed graph to an undirected graph by removing edge direction.

Examples

UndirectedGraph[Graph[{1 -> 2, 2 -> 3, 3 -> 1}]]

UndirectedGraph[{a -> b, b -> c, c -> d}]

g = DirectedGraph[CycleGraph[5]];
UndirectedGraph[g]

*See the official Wolfram Language Reference for more details.