All Classes

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.
AbstractGraphIterator<V,E>	An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.
ArrayUnenforcedSet<E>	Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness property in the data structure itself.
AsUndirectedGraph<V,E>	An undirected view of the backing directed graph specified in the constructor.
AsUnweightedDirectedGraph<V,E>	An unweighted view of the backing weighted graph specified in the constructor.
AsUnweightedGraph<V,E>	An unweighted view of the backing weighted graph specified in the constructor.
AsWeightedGraph<V,E>	A weighted view of the backing graph specified in the constructor.
BellmanFordShortestPath<V,E>	Bellman-Ford algorithm: weights could be negative, paths could be constrained by a maximum number of edges.
BiconnectivityInspector<V,E>	Inspects a graph for the biconnectivity property.
BlockCutpointGraph<V,E>	Definition of a block of a graph in MathWorld. Definition and lemma taken from the article Structure-Based Resilience Metrics for Service-Oriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph.
BreadthFirstIterator<V,E>	A breadth-first iterator for a directed and an undirected graph.
BronKerboschCliqueFinder<V,E>	This class implements Bron-Kerbosch clique detection algorithm as it is described in [Samudrala R.,Moult J.:A Graph-theoretic Algorithm for comparative Modeling of Protein Structure; J.Mol.
ChromaticNumber	Allows the chromatic number of a graph to be calculated.
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.
ClosestFirstIterator<V,E>	A closest-first iterator for a directed or undirected graph.
CompleteBipartiteGraphGenerator<V,E>	Generates a complete bipartite graph of any size.
CompleteGraphGenerator<V,E>	Generates a complete graph of any size.
ConnectedComponentTraversalEvent	A traversal event with respect to a connected component.
ConnectivityInspector<V,E>	Allows obtaining various connectivity aspects of a graph.
CrossComponentIterator<V,E,D>	Provides a cross-connected-component traversal functionality for iterator subclasses.
CrossComponentIterator.VisitColor	Standard vertex visit state enumeration.
CycleDetector<V,E>	Performs cycle detection on a graph.
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.
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 WeightedGraph.
DepthFirstIterator<V,E>	A depth-first iterator for a directed and an undirected graph.
DijkstraShortestPath<V,E>	An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator.
DirectedGraph<V,E>	A graph whose all edges are directed.
DirectedGraphUnion<V,E>
DirectedMaskSubgraph<V,E>	A directed graph that is a MaskSubgraph on another graph.
DirectedMultigraph<V,E>	A directed multigraph.
DirectedNeighborIndex<V,E>	Maintains a cache of each vertex's neighbors.
DirectedPseudograph<V,E>	A directed pseudograph.
DirectedSubgraph<V,E>	A directed graph that is a subgraph on other graph.
DirectedWeightedMultigraph<V,E>	A directed weighted multigraph.
DirectedWeightedSubgraph<V,E>	A directed weighted graph that is a subgraph on other graph.
DOTExporter<V,E>	Exports a graph into a DOT file.
EdgeFactory<V,E>	An edge factory used by graphs for creating new edges.
EdgeNameProvider<E>	Assigns a display name for each of the graph edes.
EdgeReversedGraph<V,E>	Provides an edge-reversed view g' of a directed graph g.
EdgeSetFactory<V,E>	A factory for edge sets.
EdgeTraversalEvent<V,E>	A traversal event for a graph edge.
EdmondsKarpMaximumFlow<V,E>	A flow network is a directed graph where each edge has a capacity and each edge receives a flow.
EmptyGraphGenerator<V,E>	Generates an empty graph of any size.
EulerianCircuit	This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian circuit).
FibonacciHeap<T>	This class implements a Fibonacci heap data structure.
FibonacciHeapNode<T>	Implements a node of the Fibonacci heap.
FloydWarshallShortestPaths<V,E>	The Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in O(n^3) time.
GmlExporter<V,E>	Exports a graph into a GML file (Graph Modelling Language).
Graph<V,E>	The root interface in the graph hierarchy.
GraphChangeEvent	An event which indicates that a graph has changed.
GraphDelegator<V,E>	A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph.
GraphEdgeChangeEvent<V,E>	An event which indicates that a graph edge has changed, or is about to change.
GraphGenerator<V,E,T>	GraphGenerator defines an interface for generating new graph structures.
GraphHelper	Deprecated. Use Graphs instead.
GraphIterator<V,E>	A graph iterator.
GraphListener<V,E>	A listener that is notified when the graph changes.
GraphMapping<V,E>	GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or edge in either direction, from graph1 to graph2, or from graph2 to graph1.
GraphMLExporter<V,E>	Exports a graph into a GraphML file.
GraphPath<V,E>	A GraphPath represents a path in a Graph.
GraphPathImpl<V,E>	GraphPathImpl is a default implementation of GraphPath.
Graphs	A collection of utilities to assist with graph manipulation.
GraphUnion<V,E,G extends Graph<V,E>>	Read-only union of two graphs: G1 and G2.
GraphVertexChangeEvent<V>	An event which indicates that a graph vertex has changed, or is about to change.
HamiltonianCycle	This class will deal with finding the optimal or approximately optimal minimum tour (hamiltonian cycle) or commonly known as the Traveling Salesman Problem.
HyperCubeGraphGenerator<V,E>	Generates a hyper cube graph of any size.
IntegerEdgeNameProvider<E>	Assigns a unique integer to represent each edge.
IntegerNameProvider<V>	Assigns a unique integer to represent each vertex.
KShortestPaths<V,E>	The algorithm determines the k shortest simple paths in increasing order of weight.
LinearGraphGenerator<V,E>	Generates a linear graph of any size.
ListenableDirectedGraph<V,E>	A directed graph which is also ListenableGraph.
ListenableDirectedWeightedGraph<V,E>	A directed weighted graph which is also ListenableGraph.
ListenableGraph<V,E>	A graph that supports listeners on structural change events.
ListenableUndirectedGraph<V,E>	An undirected graph which is also ListenableGraph.
ListenableUndirectedWeightedGraph<V,E>	An undirected weighted graph which is also ListenableGraph.
MaskFunctor<V,E>	A functor interface for masking out vertices and edges of a graph.
MaskSubgraph<V,E>	An unmodifiable subgraph induced by a vertex/edge masking function.
MathUtil	Math Utilities.
MatrixExporter<V,E>	Exports a graph to a plain text matrix format, which can be processed by matrix manipulation software, such as MTJ or MATLAB.
ModifiableInteger	The ModifiableInteger class wraps a value of the primitive type int in an object, similarly to Integer.
Multigraph<V,E>	A multigraph.
NeighborIndex<V,E>	Maintains a cache of each vertex's neighbors.
ParanoidGraph<V,E>	ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.
PrefetchIterator<E>	Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time.
PrefetchIterator.NextElementFunctor<EE>
Pseudograph<V,E>	A pseudograph.
RandomGraphGenerator<V,E>	This Generator creates a random-topology graph of a specified number of vertexes and edges.
RandomGraphGenerator.EdgeTopologyFactory<VV,EE>	This class is used to generate the edge topology for a graph.
RingGraphGenerator<V,E>	Generates a ring graph of any size.
ScaleFreeGraphGenerator<V,E>	Generates directed or undirected scale-free network of any size.
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.
StarGraphGenerator<V,E>	Generates a star graph of any size.
StringEdgeNameProvider<E>	Generates edge names by invoking Object.toString() on them.
StringNameProvider<V>	Generates vertex names by invoking Object.toString() on them.
StrongConnectivityInspector<V,E>	Complements the ConnectivityInspector class with the capability to compute the strongly connected components of a directed graph.
Subgraph<V,E,G extends Graph<V,E>>	A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.
TopologicalOrderIterator<V,E>	Implements topological order traversal for a directed acyclic graph.
TransitiveClosure	Constructs the transitive closure of the input graph.
TraversalListener<V,E>	A listener on graph iterator or on a graph traverser.
TraversalListenerAdapter<V,E>	An empty do-nothing implementation of the TraversalListener interface used for subclasses.
TypeUtil<T>	TypeUtil isolates type-unsafety so that code that which uses it for legitimate reasons can stay warning-free.
UndirectedGraph<V,E>	A graph whose all edges are undirected.
UndirectedGraphUnion<V,E>
UndirectedMaskSubgraph<V,E>	An undirected graph that is a MaskSubgraph on another graph.
UndirectedSubgraph<V,E>	An undirected graph that is a subgraph on other graph.
UndirectedWeightedSubgraph<V,E>	An undirected weighted graph that is a subgraph on other graph.
UnmodifiableDirectedGraph<V,E>	A directed graph that cannot be modified.
UnmodifiableGraph<V,E>	An unmodifiable view of the backing graph specified in the constructor.
UnmodifiableUndirectedGraph<V,E>	An undirected graph that cannot be modified.
VertexCovers	Algorithms to find a vertex cover for a graph.
VertexDegreeComparator<V,E>	Compares two vertices based on their degree.
VertexFactory<V>	A vertex factory used by graph algorithms for creating new vertices.
VertexNameProvider<V>	Assigns a display name for each of the graph vertices.
VertexSetListener<V>	A listener that is notified when the graph's vertex set changes.
VertexTraversalEvent<V>	A traversal event for a graph vertex.
VisioExporter<V,E>	Exports a graph to a csv format that can be imported into MS Visio.
WeightCombiner	Binary operator for edge weights.
WeightedGraph<V,E>	An interface for a graph whose edges have non-uniform weights.
WeightedMultigraph<V,E>	A weighted multigraph.
WeightedPseudograph<V,E>	A weighted pseudograph.
WheelGraphGenerator<V,E>	Generates a wheel graph of any size.