A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).