gives an undirected graph from the directed graph g.


uses rules vw to specify the graph g.

Details and Options

  • The undirected edge uv is an edge in the resulting undirected graph if either of the directed edges uv or vu is an edge of g.
  • UndirectedGraph works with directed graphs, multigraphs, and mixed graphs.


open allclose all

Basic Examples  (1)

Give an undirected graph from a directed graph:

Scope  (7)

The input is unchanged for undirected graphs:

UndirectedGraph works with directed graphs:


Mixed graphs:

Use rules to specify the graph:

Directed edges with different directions convert to one undirected edge:

UndirectedGraph works with large graphs:

Properties & Relations  (4)

An undirected graph can be constructed by a list of UndirectedEdge objects:

A graph is either undirected or directed:

A symmetric adjacency matrix is interpreted to be an undirected graph:

Use DirectedEdges->True to interpret it as a directed graph:

The incidence matrix of an undirected graph has no negative entries:

Introduced in 2010
Updated in 2014