This CD defines symbols for handling directed and undirected graphs.
Authored by Hans Cuypers and Erik Postma.
This version is edited by amc; bugfix JHD after Robbins.
This symbol represents an undirected graph. It takes two
arguments: the vertex set of the graph and the edge set.
The vertices can be arbitrary OpenMath objects. Each edge should be a set consisting of two vertices.
This symbol refers to a digraph. It has two arguments. The first is the set of vertices, the second is the set of arrows. Arrows are represented by lists of length two, where a list represents the arrow from the first element to the second.