3.7.253. Undirected graph

A constraint that deals with an undirected graph. An undirected graph is a graph whose edges consist of unordered pairs of vertices.