See: Description
| Interface | Description |
|---|---|
| Graph<V extends Vertex,E extends Edge<V>> |
A graph consisting of a set of vertices of type
V set and a set of edges of type
E. |
| Class | Description |
|---|---|
| DepthFirstIterator<V extends Vertex,E extends Edge<V>> |
Iterator over all the vertices in a graph using a depth first traversal algorithm.
|
| DirectedGraph<V extends Vertex,E extends Edge<V>> |
A
DirectedGraph, suitable for sparse graphs, that permits parallel edges.. |
| Edge<V extends Vertex> |
This class represents a generic edge in a graph.
|
| EdgeAttribute |
A generic edge attribute.
|
| Tree<V extends Vertex,E extends Edge<V>> |
A subtype of Graph which is a (directed, rooted) tree.
|
| UndirectedGraph<V extends Vertex,E extends Edge<V>> |
A
DirectedGraph, suitable for sparse graphs, that permits parallel edges.. |
| Vertex |
This class represents a generic vertex (node) in a graph.
|
| VertexAttribute |
A generic node attribute.
|
| Enum | Description |
|---|---|
| EdgeType |
Defines the possible edge types for graphs which assign types to edges.
|

Copyright © 2015 University of Glasgow. All rights reserved.