Interface | Description |
---|---|
EdgeLabeler<N,E> |
Callback interface to forward the labelling of each new edge back to
the user.
|
Graph<N,E> |
General Graph interface, for graphs of N-typed nodes, each having
0 or more edges to other nodes, labeled L.
|
NodeLabeler<N,E> |
Callback interface to forward the labelling of new nodes back to
the user.
|
PartitionGraph.PartitionCallbacks<N,E> |
Class | Description |
---|---|
AdjacencyMatrix |
Output an adjacency matrix of a graph, in a form suitable for MatLab/Octave.
|
debug |
Custom debug class with support for various print statements, different debug levels
and a ring-buffer to store debug message history that is only printed out if
a message of at least a certain level (e.g.
|
Edge<N,E> |
An edge, identified immutably by <from,to,label>, of some mutable weight.
|
MultiDiGraph<N,E> |
A multi-edge, directed graph implementation of the
Graph interface. |
MultiGraph<N,E> |
A multi-edge, undirected edge graph implementation.
|
PartitionGraph<N,E> |
Partition the nodes of the supplied graph.
|
ShortestPathFirst<N,E> |
Dijkstra's Shortest Path First algoritm, implemented to act on a
Graph of N-nodes and Edges, with L-labels
|
SimpleDiGraph<N,E> |
Simple, directed edge graph: no self-loop edges allowed and no more than 1
edge between nodes.
|
SimpleGraph<N,E> |
Simple, undirected graph: No self-loop edges allowed and 0 or 1 edges
between nodes.
|
SyncGraph<N,E> |
Enum | Description |
---|---|
debug.levels |