Undirected Graphs
An undirected graph is a graph in which each edge is considered to be unordered.
For an undirected graph: ei = { va(i), vb(i) }
For a directed graph: ei = ? va(i), vb(i) ?
An undirected graph is equivalent to a digraph for a symmetric binary relation.
Arrowheads are unnecessary.