| | Class | Description |
| | Edge |
Edge class that implements the IEdge interface
an edge has an id, two nodes a potential data
object and may be associated with an IVisualEdge
|
| | Graph |
Graph implements a graph datastructure G(V,E)
with vertices V and edges E, except that we call the
vertices nodes, which is here more in line with similar
implementations. |
| | GTree |
This class represents a spanning
tree, rooted in the given root node
of the connected component of the
associated graph. |
| | Node |
Implements the Node data structure, which is part of
a graph. |