| Interface | Description |
|---|---|
| DirectedGraph | |
| DirectedHyperGraph | |
| DirectedSimpleGraph | |
| EdgeSet | |
| GrphIntSet | |
| GrphPrimitives | |
| TopologyListener |
Objects that listen to graph topology changes need to implement this
interface.
|
| UndirectedGraph | |
| UndirectedHyperGraph | |
| UndirectedSimpleGraph | |
| UnqualifiedGraph |
A graph with no information on the type of its edges
|
| VertexSet |
| Class | Description |
|---|---|
| Cache | |
| DefaultIntSet | |
| ElementFilter |
A filter for selecting (or not) vertices or edges.
|
| ElementFilter.DegreeFilter | |
| ElementFilter.LeafFilter | |
| ElementFilter.LoopFilter | |
| ElementFilter.SimplicialVertexFilter | |
| Grph |
A full-featured graph object, exhibiting all available operations and
algorithms.
|
| GrphAlgorithm<R> |
The definition for general graph algorithms.
|
| GrphAlgorithmCache<E> |
A graph algorithm wrapper that cache the result computed by its underlying
algorithm.
|
| GrphLogger | |
| GrphWebNotifications | |
| Paths | |
| RunTests | |
| VertexPair |
A pair of vertices.
|
| Enum | Description |
|---|---|
| Grph.DIRECTION | |
| Grph.MaxIndependentSetAlgorithm |
Implemented Maximum Independent Set algorithms.
|
| Grph.MinVertexCoverAlgorithm |
Implemented Minimum Vertex Cover algorithms.
|
| Grph.TYPE |