Undirected graphs
Undirected graphs contain edges that have no orientation (\(i\rightarrow j\) and \(j\rightarrow i\) are equivalent). Vertices are identified by an integer index, VertexIndex, ranging from \(0\) to \(n-1\), where \(n\) is the number of vertices.