undirected graph

Definition

A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).