Undirected Graph

An UndirectedGraph is a DataStructure containing a vertex set V and an edge set E, where each edge is an unordered pair of vertices.

Variants of this data structure:
Definition: http://www.nist.gov/dads/HTML/undirectgraf.html
CategoryDataStructure

EditText of this page (last edited June 7, 2004) or FindPage with title or text search