Undirected graph
= Undirected graph
An undirected <graph> has edges that are unordered pairs of vertices. In a simple undirected graph there are no loops or multiple edges. The <skeleton of a directed graph> forgets the directions of its edges and is an undirected graph.