This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)

UndirectedGraph

UndirectedGraph[g]
gives an undirected graph from the directed graph g.
  • The undirected edge is an edge in the resulting undirected graph if either of the directed edges or is an edge of g.
Give an undirected graph from a directed graph:
Give an undirected graph from a directed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
The input is unchanged for undirected graphs:
UndirectedGraph works with directed graphs:
Directed edges with different directions convert to one undirected edge:
Works with large graphs:
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:
New in 8