| Interface | Description |
|---|---|
| DirectedAcyclicGraph.TopoOrderMap<V> |
An interface for storing the topological ordering.
|
| DirectedAcyclicGraph.VisitedStrategy |
A strategy for marking vertices as visited.
|
| DirectedAcyclicGraph.VisitedStrategyFactory |
A visited strategy factory.
|
| EdgeSetFactory<V,E> |
A factory for edge sets.
|
| Class | Description |
|---|---|
| AbstractBaseGraph<V,E> |
The most general implementation of the
Graph interface. |
| AbstractGraph<V,E> |
A skeletal implementation of the Graph interface, to minimize the effort required to
implement graph interfaces.
|
| AsGraphUnion<V,E> |
Read-only union of two graphs.
|
| AsSubgraph<V,E> |
A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some
base graph.
|
| AsUndirectedGraph<V,E> |
An undirected view of the backing directed graph specified in the constructor.
|
| AsUnmodifiableGraph<V,E> |
An unmodifiable view of the backing graph specified in the constructor.
|
| AsUnweightedDirectedGraph<V,E> | Deprecated
In favor of
AsUnweightedGraph. |
| AsUnweightedGraph<V,E> |
An unweighted view of a graph.
|
| AsWeightedDirectedGraph<V,E> | Deprecated
In favor of
AsWeightedGraph. |
| AsWeightedGraph<V,E> |
A weighted view of a graph.
|
| ClassBasedEdgeFactory<V,E> |
An
EdgeFactory for producing edges by using a class as a factory. |
| ClassBasedVertexFactory<V> |
A
VertexFactory for producing vertices by using a class as a factory. |
| DefaultDirectedGraph<V,E> |
A directed graph.
|
| DefaultDirectedWeightedGraph<V,E> |
A directed weighted graph.
|
| DefaultEdge |
A default implementation for edges in a
Graph. |
| DefaultGraphMapping<V,E> |
Implementation of the GraphMapping interface.
|
| DefaultGraphType |
Default implementation of the graph type.
|
| DefaultGraphType.Builder |
A builder for
DefaultGraphType. |
| DefaultListenableGraph<V,E> |
A graph backed by the the graph specified at the constructor, which can be listened by
GraphListener s and by
VertexSetListener s. |
| DefaultWeightedEdge |
A default implementation for edges in a weighted graph.
|
| DirectedAcyclicGraph<V,E> |
A directed acyclic graph (DAG).
|
| DirectedAcyclicGraph.Region |
An inclusive range of indices: [start, finish].
|
| DirectedAcyclicGraph.TopoVertexBiMap<V> |
A dual map implementation of the topological order map.
|
| DirectedAcyclicGraph.VisitedArrayImpl |
A visited strategy using an array.
|
| DirectedAcyclicGraph.VisitedArrayListImpl |
A visited strategy using an
ArrayList. |
| DirectedAcyclicGraph.VisitedBitSetImpl |
A visited strategy which uses a
BitSet. |
| DirectedAcyclicGraph.VisitedHashSetImpl |
A visited strategy using a
HashSet. |
| DirectedGraphUnion<V,E> | Deprecated
In favor of
AsGraphUnion. |
| DirectedMaskSubgraph<V,E> | Deprecated
In favor of
MaskSubgraph. |
| DirectedMultigraph<V,E> |
A directed multigraph.
|
| DirectedPseudograph<V,E> |
A directed pseudograph.
|
| DirectedSubgraph<V,E> | Deprecated
In favor of
AsSubgraph. |
| DirectedWeightedMultigraph<V,E> |
A directed weighted multigraph.
|
| DirectedWeightedPseudograph<V,E> |
A directed weighted pseudograph.
|
| DirectedWeightedSubgraph<V,E> | Deprecated
In favor of
AsSubgraph. |
| EdgeReversedGraph<V,E> |
Provides an edge-reversed view g' of a directed graph g.
|
| GraphDelegator<V,E> |
A graph backed by the the graph specified at the constructor, which delegates all its methods to
the backing graph.
|
| GraphUnion<V,E,G extends Graph<V,E>> | Deprecated
In favor of
AsGraphUnion. |
| GraphWalk<V,E> |
A walk in a graph is an alternating sequence of vertices and edges, starting and ending at a
vertex, in which each edge is adjacent in the sequence to its two endpoints.
|
| ListenableDirectedGraph<V,E> | Deprecated
In favor of
DefaultListenableGraph. |
| ListenableDirectedWeightedGraph<V,E> | Deprecated
In favor of
DefaultListenableGraph. |
| ListenableUndirectedGraph<V,E> | Deprecated
In favor of
DefaultListenableGraph. |
| ListenableUndirectedWeightedGraph<V,E> | Deprecated
In favor of
DefaultListenableGraph. |
| MaskSubgraph<V,E> |
An unmodifiable subgraph induced by a vertex/edge masking function.
|
| MixedGraphUnion<V,E> | Deprecated
In favor of
AsGraphUnion. |
| Multigraph<V,E> |
A multigraph.
|
| ParanoidGraph<V,E> |
ParanoidGraph provides a way to verify that objects added to a graph obey the standard
equals/hashCode contract.
|
| Pseudograph<V,E> |
A pseudograph.
|
| SimpleDirectedGraph<V,E> |
A simple directed graph.
|
| SimpleDirectedWeightedGraph<V,E> |
A simple directed weighted graph.
|
| SimpleGraph<V,E> |
A simple graph.
|
| SimpleWeightedGraph<V,E> |
A simple weighted graph.
|
| Subgraph<V,E,G extends Graph<V,E>> | Deprecated
In favor of
AsSubgraph. |
| UndirectedGraphUnion<V,E> | Deprecated
In favor of
AsGraphUnion. |
| UndirectedMaskSubgraph<V,E> | Deprecated
In favor of
MaskSubgraph. |
| UndirectedSubgraph<V,E> | Deprecated
In favor of
AsSubgraph. |
| UndirectedWeightedSubgraph<V,E> | Deprecated
In favor of
AsSubgraph. |
| UnmodifiableDirectedGraph<V,E> | Deprecated
In favor of
AsUnmodifiableGraph. |
| UnmodifiableGraph<V,E> | Deprecated
In favor of
AsUnmodifiableGraph. |
| UnmodifiableUndirectedGraph<V,E> | Deprecated
In favor of
AsUnmodifiableGraph. |
| WeightedMultigraph<V,E> |
A weighted multigraph.
|
| WeightedPseudograph<V,E> |
A weighted pseudograph.
|
Copyright © 2017. All rights reserved.