| Interface | Description |
|---|---|
| BfsVertex |
Utility interface used as shorthand for vertices that implement ChildVertex, ColoredVertex,
and DistanceVertex, as needed for breadth-first search
|
| ChildVertex |
Vertex that can maintain a parent-child relationship to other vertices
|
| ColoredVertex |
Vertex that supports coloring.
|
| ComponentVertex |
Vertex supporting a field for distinguishing different components
of a graph.
|
| DfsVertex |
Utility interface used as shorthand for vertices that implement ColoredVertex
and VisitedVertex, as needed for the most basic kind of depth-first search.
|
| DistanceVertex |
Vertex that maintains a distance field
|
| EdgeColorVertex<E extends EdgeColorData> |
Vertex that maintains a Color for its adjacencies
|
| EdgeDataVertex<T> |
Specification for vertices supporting edge data.
|
| EdgeDataVertexFactory<T,V extends EdgeDataVertex<T>> | |
| EdgeTypeDfsVertex<T extends EdgeTypeData> |
Utility interface used as shorthand for vertices that implement DfsVertex, ChildVertex
and EdgeTypeVertex, as needed for a depth-first search in which edge type is to be
determined.
|
| EdgeTypeVertex<T extends EdgeTypeData> |
Vertex that maintains an EdgeType for its adjacencies
|
| EdgeWeightVertex<T extends EdgeWeightData> |
Vertex that maintains an edge weight for its adjacencies
|
| KruskalVertex<E extends SpanningTreeEdgeData> |
Interface specifying the necessary characteristics of vertices for graphs on which Kruskal's algorithm
can run.
|
| OrderedDfsVertex |
Utility interface used as shorthand for vertices that implement ColoredVertex, VisitedVertex,
OrderedSearchVertex and ComponentVertex, as needed for ordered depth-first search.
|
| OrderedSearchVertex |
Vertex that supports a field for conducting searches in a specific order
|
| PrimVertex<E extends SpanningTreeEdgeData> |
Interface specifying the necessary characteristics of vertices for graphs on which Prim's algorithm
can run.
|
| ShortestPathVertex<E extends EdgeWeightData> | |
| Vertex |
Basic specification which any Vertex class must implement
|
| VertexFactory<V extends Vertex> |
Requires a factory method for creating new vertices of the given type.
|
| VisitedVertex |
Vertex that supports fields for marking discovery and finish times, as required
in depth=first search
|
| WeightedVertex |
Vertex that maintains a floating point weight.
|
| Class | Description |
|---|---|
| AbstractVertex | |
| DirectedDfsVertex<E extends DfsEdgeData> |
Directed vertex supporting the operations required for depth-first search.
|
| DirectedEdgeDataVertex<T> | |
| DirectedOrderedDfsVertex |
Simple vertex class supporting ordered depth-first search.
|
| DirectedShortestPathVertex<E extends ShortestPathEdgeData> | |
| DirectedSimpleColoredVertex | |
| DirectedSimpleVertex | |
| ReverseSearchOrderComparator | |
| SearchOrderComparator | |
| UndirectedBfsVertex |
Undirected vertex supporting the operations required for breadth-first search.
|
| UndirectedEdgeDataVertex<T> | |
| UndirectedKruskalVertex<E extends SpanningTreeEdgeData> |
Undirected vertex supporting the functions necessary for Kruskal's algorithm.
|
| UndirectedKruskalVertexBuilder<E extends SpanningTreeEdgeData> | |
| UndirectedPrimVertex<E extends SpanningTreeEdgeData> |
Undirected vertex supporting the functions necessary for Prim's algorithm.
|
| UndirectedSimpleVertex |
Vertex to be used in undirected graphs.
|
| WeightComparator |
| Enum | Description |
|---|---|
| DirectedOrderedDfsVertex.Factory |