A B C D E F G H I J K L M N O P R S T U V W _

## A

AbstractBaseGraph<V,E> - Class in org.jgrapht.graph
  The most general implementation of the `Graph` interface.
AbstractBaseGraph(EdgeFactory<V, E>, boolean, boolean) - Constructor for class org.jgrapht.graph.AbstractBaseGraph
  Construct a new graph.
AbstractBaseGraph.DirectedEdgeContainer<VV,EE> - Class in org.jgrapht.graph
  A container for vertex edges.
AbstractBaseGraph.DirectedSpecifics - Class in org.jgrapht.graph
  .
AbstractBaseGraph.DirectedSpecifics() - Constructor for class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
AbstractBaseGraph.DirectedSpecifics(Map<V, AbstractBaseGraph.DirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
AbstractBaseGraph.UndirectedSpecifics - Class in org.jgrapht.graph
  .
AbstractBaseGraph.UndirectedSpecifics() - Constructor for class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
AbstractBaseGraph.UndirectedSpecifics(Map<V, AbstractBaseGraph.UndirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
AbstractGraph<V,E> - Class in org.jgrapht.graph
  A skeletal implementation of the `Graph` interface, to minimize the effort required to implement graph interfaces.
AbstractGraph() - Constructor for class org.jgrapht.graph.AbstractGraph
  Construct a new empty graph object.
AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>> - Class in org.jgrapht.graph.builder
  Base class for builders of `Graph`
AbstractGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.AbstractGraphBuilder
  Creates a builder based on `baseGraph`.
AbstractGraphIterator<V,E> - Class in org.jgrapht.traverse
  An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.
AbstractGraphIterator() - Constructor for class org.jgrapht.traverse.AbstractGraphIterator
active - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
addAllEdges(Graph<? super V, ? super E>, Graph<V, E>, Collection<? extends E>) - Static method in class org.jgrapht.Graphs
  Adds a subset of the edges of the specified source graph to the specified destination graph.
addAllVertices(Graph<? super V, ? super E>, Collection<? extends V>) - Static method in class org.jgrapht.Graphs
  Adds all of the specified vertices to the destination graph.
addDagEdge(V, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  Adds the given edge and updates the internal topological order for consistency IFF there is not already an edge (fromVertex, toVertex) in the graph the edge does not induce a cycle in the graph
addDagEdge(V, V, E) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  Adds the given edge and updates the internal topological order for consistency IFF the given edge is not already a member of the graph there is not already an edge (fromVertex, toVertex) in the graph the edge does not induce a cycle in the graph
addEdge(V, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  identical to `DirectedAcyclicGraph.addDagEdge(Object, Object)`, except an unchecked `IllegalArgumentException` is thrown if a cycle would have been induced by this edge
addEdge(V, V, E) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  identical to `DirectedAcyclicGraph.addDagEdge(Object, Object, Object)`, except an unchecked `IllegalArgumentException` is thrown if a cycle would have been induced by this edge
addEdge(V, V) - Method in class org.jgrapht.experimental.GraphSquare
addEdge(V, V, E) - Method in class org.jgrapht.experimental.GraphSquare
addEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.AbstractBaseGraph
addEdge(V, V) - Method in interface org.jgrapht.Graph
  Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
addEdge(V, V, E) - Method in interface org.jgrapht.Graph
  Adds the specified edge to this graph, going from the source vertex to the target vertex.
addEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.AsUndirectedGraph
addEdge(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Adds an edge to the graph being built.
addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase
  Adds an weighted edge to the graph being built.
addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase
  Adds an weighted edge to the graph being built.
addEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.DefaultListenableGraph
addEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.EdgeReversedGraph
addEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
addEdge(V, V, E) - Method in class org.jgrapht.graph.GraphDelegator
addEdge(V, V) - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
addEdge(V, V, E) - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
addEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.MaskSubgraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.ParanoidGraph
addEdge(V, V) - Method in class org.jgrapht.graph.Subgraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.Subgraph
addEdge(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
addEdge(V, V, E) - Method in class org.jgrapht.graph.UnmodifiableGraph
addEdge(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
  Creates a new edge and adds it to the specified graph similarly to the `Graph.addEdge(Object, Object)` method.
addEdgeChain(V, V, V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Adds a chain of edges to the graph being built.
addEdges(Graph, List, List, int) - Static method in class org.jgrapht.experimental.RandomGraphHelper
addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
addEdgeWithVertices(Graph<V, E>, V, V) - Static method in class org.jgrapht.Graphs
  Adds the specified source and target vertices to the graph, if not already included, and creates a new edge and adds it to the specified graph similarly to the `Graph.addEdge(Object, Object)` method.
addEdgeWithVertices(Graph<V, E>, Graph<V, E>, E) - Static method in class org.jgrapht.Graphs
  Adds the specified edge to the graph, including its vertices if not already included.
addEdgeWithVertices(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
  Adds the specified source and target vertices to the graph, if not already included, and creates a new weighted edge and adds it to the specified graph similarly to the `Graph.addEdge(Object, Object)` method.
addElement(T) - Method in class org.jgrapht.alg.util.UnionFind
  Adds a new element to the data structure in its own set.
addGraph(Graph<? extends V, ? extends E>) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Adds all the vertices and all the edges of the `sourceGraph` to the graph being built.
addGraph(Graph<? super V, ? super E>, Graph<V, E>) - Static method in class org.jgrapht.Graphs
  Adds all the vertices and all the edges of the specified source graph to the specified destination graph.
addGraphListener(GraphListener<V, E>) - Method in class org.jgrapht.graph.DefaultListenableGraph
addGraphListener(GraphListener<V, E>) - Method in interface org.jgrapht.ListenableGraph
  Adds the specified graph listener to this graph, if not already present.
addGraphReversed(DirectedGraph<? super V, ? super E>, DirectedGraph<V, E>) - Static method in class org.jgrapht.Graphs
  Adds all the vertices and all the edges of the specified source digraph to the specified destination digraph, reversing all of the edges.
addIncomingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
  .
addOutgoingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
  .
addTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Adds the specified traversal listener to this iterator.
addTraversalListener(TraversalListener<V, E>) - Method in interface org.jgrapht.traverse.GraphIterator
  Adds the specified traversal listener to this iterator.
addVertex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  adds the vertex if it wasn't already in the graph, and puts it at the top of the internal topological vertex ordering
addVertex(V, boolean) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  adds the vertex if it wasn't already in the graph, and puts it either at the top or the bottom of the topological ordering, depending on the value of addToTop.
addVertex(V) - Method in class org.jgrapht.experimental.GraphSquare
addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
addVertex(V) - Method in interface org.jgrapht.Graph
  Adds the specified vertex to this graph if not already present.
addVertex(V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Adds `vertex` to the graph being built.
addVertex(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
addVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
addVertex(V) - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
addVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
addVertex(V) - Method in class org.jgrapht.graph.ParanoidGraph
addVertex(V) - Method in class org.jgrapht.graph.Subgraph
  Adds the specified vertex to this subgraph.
addVertex(V) - Method in class org.jgrapht.graph.UnmodifiableGraph
addVertexSetListener(VertexSetListener<V>) - Method in class org.jgrapht.graph.DefaultListenableGraph
addVertexSetListener(VertexSetListener<V>) - Method in interface org.jgrapht.ListenableGraph
  Adds the specified vertex set listener to this graph, if not already present.
addVertices(Graph, VertexFactory, int) - Static method in class org.jgrapht.experimental.RandomGraphHelper
  .
addVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Adds each vertex of `vertices` to the graph being built.
admissibleHeuristic - Variable in class org.jgrapht.alg.AStarShortestPath
AllDirectedPaths<V,E> - Class in org.jgrapht.alg
  A Dijkstra-like algorithm to find all paths between two sets of nodes in a directed graph, with options to search only simple paths and to limit the path length.
AllDirectedPaths(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.AllDirectedPaths
AlwaysEqualComparator<T> - Class in org.jgrapht.alg.util
  A default implementation for a check on equality (that always holds)
AlwaysEqualComparator() - Constructor for class org.jgrapht.alg.util.AlwaysEqualComparator
ApproximationAlgorithm<ResultType,V> - Interface in org.jgrapht.experimental.alg
ArrayUnenforcedSet<E> - Class in org.jgrapht.util
  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.
ArrayUnenforcedSet() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
ArrayUnenforcedSet(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
assertVertexExist(V) - Method in class org.jgrapht.graph.AbstractGraph
  Ensures that the specified vertex exists in this graph, or else throws exception.
AStarAdmissibleHeuristic<V> - Interface in org.jgrapht.alg.interfaces
  Interface for an admissible heuristic used in A* search.
AStarShortestPath<V,E> - Class in org.jgrapht.alg
  An implementation of A* shortest path algorithm.
AStarShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.AStarShortestPath
AsUndirectedGraph<V,E> - Class in org.jgrapht.graph
  An undirected view of the backing directed graph specified in the constructor.
AsUndirectedGraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.AsUndirectedGraph
  Constructor for AsUndirectedGraph.
AsUnweightedDirectedGraph<V,E> - Class in org.jgrapht.graph
  An unweighted view of the backing weighted graph specified in the constructor.
AsUnweightedDirectedGraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.AsUnweightedDirectedGraph
  Constructor for AsUnweightedGraph.
AsUnweightedGraph<V,E> - Class in org.jgrapht.graph
  An unweighted view of the backing weighted graph specified in the constructor.
AsUnweightedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUnweightedGraph
  Constructor for AsUnweightedGraph.
AsWeightedDirectedGraph<V,E> - Class in org.jgrapht.graph
  A weighted view of the backing graph specified in the constructor.
AsWeightedDirectedGraph(DirectedGraph<V, E>, Map<E, Double>) - Constructor for class org.jgrapht.graph.AsWeightedDirectedGraph
  Constructor for AsWeightedGraph.
AsWeightedGraph<V,E> - Class in org.jgrapht.graph
  A weighted view of the backing graph specified in the constructor.
AsWeightedGraph(Graph<V, E>, Map<E, Double>) - Constructor for class org.jgrapht.graph.AsWeightedGraph
  Constructor for AsWeightedGraph.

## B

BEFORE_EDGE_ADDED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
  Before edge added event.
BEFORE_EDGE_REMOVED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
  Before edge removed event.
BEFORE_VERTEX_ADDED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
  Before vertex added event.
BEFORE_VERTEX_REMOVED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
  Before vertex removed event.
BellmanFordShortestPath<V,E> - Class in org.jgrapht.alg
  Bellman-Ford algorithm: weights could be negative, paths could be constrained by a maximum number of edges.
BellmanFordShortestPath(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.BellmanFordShortestPath
  Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V, E>, V, int) - Constructor for class org.jgrapht.alg.BellmanFordShortestPath
  Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V, E>, V, int, double) - Constructor for class org.jgrapht.alg.BellmanFordShortestPath
  Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BEST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
bestCut - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut
bestCutWeight - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut
BiconnectivityInspector<V,E> - Class in org.jgrapht.alg
  Inspects a graph for the biconnectivity property.
BiconnectivityInspector(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.BiconnectivityInspector
  Running time = O(m) where m is the number of edges.
BlockCutpointGraph<V,E> - Class in org.jgrapht.alg
  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.
BlockCutpointGraph(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.BlockCutpointGraph
  Running time = O(m) where m is the number of edges.
BreadthFirstIterator<V,E> - Class in org.jgrapht.traverse
  A breadth-first iterator for a directed and an undirected graph.
BreadthFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.BreadthFirstIterator
  Creates a new breadth-first iterator for the specified graph.
BreadthFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.BreadthFirstIterator
  Creates a new breadth-first iterator for the specified graph.
BronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg
  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.
BronKerboschCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.BronKerboschCliqueFinder
  Creates a new clique finder.
BrownBacktrackColoring<V,E> - Class in org.jgrapht.experimental.alg.color
BrownBacktrackColoring(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
build() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Build the graph.
buildEdge(V, V, String, Map<String, String>) - Method in interface org.jgrapht.ext.EdgeProvider
  Construct an edge
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedMultigraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedMultigraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedPseudograph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedPseudograph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.Multigraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.Multigraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.Pseudograph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.Pseudograph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleGraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleGraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedMultigraph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.WeightedMultigraph
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedPseudograph
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.WeightedPseudograph
buildMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
  Gets costs-matrix as input and returns assignment of tasks (designated by the columns of cost-matrix) to the workers (designated by the rows of the cost-matrix) so that to MINIMIZE total tasks-tackling costs
buildMaximumFlow(V, V) - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
buildMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
  Sets current source to `source`, current sink to `sink`, then calculates maximum flow from `source` to `sink`.
buildMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMaximumFlow
buildMaximumFlow(V, V) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm
  Builds maximum flow for the supplied network flow, for the supplied ${source} and ${sink}
buildUnmodifiable() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Build an unmodifiable version graph.
buildUnmodifiable() - Method in class org.jgrapht.graph.builder.DirectedGraphBuilderBase
buildUnmodifiable() - Method in class org.jgrapht.graph.builder.UndirectedGraphBuilderBase
buildVertex(String, Map<String, String>) - Method in interface org.jgrapht.ext.VertexProvider
  Create a vertex

## C

calculate(V, V, V) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor
  Calculate the LCM between `a` and `b` treating `start` as the root we want to search from.
calculate(V, List<TarjanLowestCommonAncestor.LcaRequestResponse<V>>) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor
  Calculate the LCMs between a set of pairs (`a` and `b`) treating `start` as the root we want to search from, and setting the LCA of each pair in its LCA field
calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Sets current source to `source`, current sink to `sink`, then calculates maximum flow from `source` to `sink`.
cameFrom - Variable in class org.jgrapht.alg.AStarShortestPath
cascadingCut(FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
  Performs a cascading cut operation.
CENTER_VERTEX - Static variable in class org.jgrapht.generate.StarGraphGenerator
ChromaticNumber - Class in org.jgrapht.alg
  Allows the chromatic number of a graph to be calculated.
ChromaticNumber() - Constructor for class org.jgrapht.alg.ChromaticNumber
ClassBasedEdgeFactory<V,E> - Class in org.jgrapht.graph
  An `EdgeFactory` for producing edges by using a class as a factory.
ClassBasedEdgeFactory(Class<? extends E>) - Constructor for class org.jgrapht.graph.ClassBasedEdgeFactory
ClassBasedVertexFactory<V> - Class in org.jgrapht.graph
  A `VertexFactory` for producing vertices by using a class as a factory.
ClassBasedVertexFactory(Class<? extends V>) - Constructor for class org.jgrapht.graph.ClassBasedVertexFactory
clear() - Method in class org.jgrapht.ext.IntegerEdgeNameProvider
  Clears all cached identifiers, and resets the unique identifier counter.
clear() - Method in class org.jgrapht.ext.IntegerNameProvider
  Clears all cached identifiers, and resets the unique identifier counter.
clear() - Method in class org.jgrapht.util.FibonacciHeap
  Removes all elements from this heap.
clearVisited(int) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited
  Clear the visited state of the given topological index
clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
CliqueMinimalSeparatorDecomposition<V,E> - Class in org.jgrapht.alg
  Clique Minimal Separator Decomposition using MCS-M+ and Atoms algorithm as described in Berry et al.
CliqueMinimalSeparatorDecomposition(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Setup a clique minimal separator decomposition on undirected graph `g`.
clone() - Method in class org.jgrapht.graph.AbstractBaseGraph
  Returns a shallow copy of this graph instance.
clone() - Method in class org.jgrapht.graph.DefaultListenableGraph
closedList - Variable in class org.jgrapht.alg.AStarShortestPath
closeSimpleDirectedGraph(SimpleDirectedGraph<V, E>) - Method in class org.jgrapht.alg.TransitiveClosure
  Computes the transitive closure of the given graph.
ClosestFirstIterator<V,E> - Class in org.jgrapht.traverse
  A closest-first iterator for a directed or undirected graph.
ClosestFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
  Creates a new closest-first iterator for the specified graph.
ClosestFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
  Creates a new closest-first iterator for the specified graph.
ClosestFirstIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
  Creates a new radius-bounded closest-first iterator for the specified graph.
combine(double, double) - Method in interface org.jgrapht.util.WeightCombiner
  Combines two weights.
compare(T, T) - Method in class org.jgrapht.alg.util.AlwaysEqualComparator
compare(V, V) - Method in class org.jgrapht.alg.util.VertexDegreeComparator
  Compare the degrees of `v1` and `v2`, taking into account whether ascending or descending order is used.
compareFlowTo(double, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
compareTo(StoerWagnerMinimumCut<V, E>.VertexAndWeight) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
  compareTo that sorts in reverse order because we need extract-max and queue provides extract-min.
compareTo(ModifiableInteger) - Method in class org.jgrapht.util.ModifiableInteger
  Compares two `ModifiableInteger` objects numerically.
CompleteBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a complete bipartite graph of any size.
CompleteBipartiteGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.CompleteBipartiteGraphGenerator
  Creates a new CompleteBipartiteGraphGenerator object.
CompleteGraphDemo - Class in org.jgrapht.demo
CompleteGraphDemo() - Constructor for class org.jgrapht.demo.CompleteGraphDemo
CompleteGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a complete graph of any size.
CompleteGraphGenerator(int) - Constructor for class org.jgrapht.generate.CompleteGraphGenerator
  Construct a new CompleteGraphGenerator.
ComponentAttributeProvider<T> - Interface in org.jgrapht.ext
  Provides display attributes for vertices and/or edges in a graph.
composeFlow() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
computeMinCut(V, V) - Method in class org.jgrapht.alg.MinSourceSinkCut
  Compute a minimum s-t cut
CONNECTED_COMPONENT_FINISHED - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
  Connected component traversal finished event.
CONNECTED_COMPONENT_STARTED - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
  Connected component traversal started event.
connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
  Called to inform listeners that the traversal of the current connected component has finished.
connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
  Called to inform listeners that a traversal of a new connected component has started.
connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
ConnectedComponentTraversalEvent - Class in org.jgrapht.event
  A traversal event with respect to a connected component.
ConnectedComponentTraversalEvent(Object, int) - Constructor for class org.jgrapht.event.ConnectedComponentTraversalEvent
  Creates a new ConnectedComponentTraversalEvent.
connectedSetOf(V) - Method in class org.jgrapht.alg.ConnectivityInspector
  Returns a set of all vertices that are in the maximally connected component together with the specified vertex.
connectedSets() - Method in class org.jgrapht.alg.ConnectivityInspector
  Returns a list of `Set` s, where each set contains all vertices that are in the same maximally connected component.
ConnectivityInspector<V,E> - Class in org.jgrapht.alg
  Allows obtaining various connectivity aspects of a graph.
ConnectivityInspector(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.ConnectivityInspector
  Creates a connectivity inspector for the specified undirected graph.
ConnectivityInspector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.ConnectivityInspector
  Creates a connectivity inspector for the specified directed graph.
consolidate() - Method in class org.jgrapht.util.FibonacciHeap
containsEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
containsEdge(V, V) - Method in class org.jgrapht.graph.AbstractGraph
containsEdge(V, V) - Method in interface org.jgrapht.Graph
  Returns `true` if and only if this graph contains an edge going from the source vertex to the target vertex.
containsEdge(E) - Method in interface org.jgrapht.Graph
  Returns `true` if this graph contains the specified edge.
containsEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
containsEdge(E) - Method in class org.jgrapht.graph.GraphUnion
containsEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
containsEdge(E) - Method in class org.jgrapht.graph.Subgraph
containsVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
containsVertex(V) - Method in interface org.jgrapht.Graph
  Returns `true` if this graph contains the specified vertex.
containsVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
containsVertex(V) - Method in class org.jgrapht.graph.GraphUnion
containsVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
containsVertex(V) - Method in class org.jgrapht.graph.Subgraph
CORNER_VERTEX - Static variable in class org.jgrapht.generate.GridGraphGenerator
  Role for the vertices at the corners.
countSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Count the number of simple cycles.
create() - Method in interface org.jgrapht.alg.util.Extension.ExtensionFactory
createDefaultEdgeAttributes(Graph<V, E>) - Static method in class org.jgrapht.ext.JGraphModelAdapter
  Creates and returns a map of attributes to be used as defaults for edge attributes, depending on the specified graph.
createDefaultVertexAttributes() - Static method in class org.jgrapht.ext.JGraphModelAdapter
  Creates and returns a map of attributes to be used as defaults for vertex attributes.
createDirectedSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph
createEdge(V, V) - Method in interface org.jgrapht.EdgeFactory
  Creates a new edge whose endpoints are the specified source and target vertices.
createEdge(V, V) - Method in class org.jgrapht.graph.ClassBasedEdgeFactory
createEdgeCell(EE) - Method in interface org.jgrapht.ext.JGraphModelAdapter.CellFactory
  Creates an edge cell that contains its respective JGraphT edge.
createEdgeCell(EE) - Method in class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory
createEdges(Graph<VV, EE>, Map<Integer, VV>, int, Random) - Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
createEdges(Graph<VV, EE>, Map<Integer, VV>, int, Random) - Method in interface org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory
  Two different calls to the createEdges() with the same parameters must result in the generation of the same.
createEdgeSet(V) - Method in interface org.jgrapht.graph.EdgeSetFactory
  Create a new edge set for a particular vertex.
createInstance() - Method in class org.jgrapht.alg.util.Extension
createUndirectedSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph
createVertex() - Method in class org.jgrapht.graph.ClassBasedVertexFactory
createVertex() - Method in interface org.jgrapht.VertexFactory
  Creates a new vertex.
createVertexCell(VV) - Method in interface org.jgrapht.ext.JGraphModelAdapter.CellFactory
  Creates a vertex cell that contains its respective JGraphT vertex.
createVertexCell(VV) - Method in class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory
CrossComponentIterator<V,E,D> - Class in org.jgrapht.traverse
  Provides a cross-connected-component traversal functionality for iterator subclasses.
CrossComponentIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
  Creates a new iterator for the specified graph.
CrossComponentIterator.VisitColor - Enum in org.jgrapht.traverse
  Standard vertex visit state enumeration.
cut(FibonacciHeapNode<T>, FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
  The reverse of the link operation: removes x from the child list of y.
CycleDetector<V,E> - Class in org.jgrapht.alg
  Performs cycle detection on a graph.
CycleDetector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.CycleDetector
  Creates a cycle detector for the specified graph.

## D

decreaseKey(FibonacciHeapNode<T>, double) - Method in class org.jgrapht.util.FibonacciHeap
  Decreases the key value for a heap node, given the new value to take on.
decrement() - Method in class org.jgrapht.util.ModifiableInteger
  Subtracts one from the value of this modifiable integer.
DEFAULT_EDGE_WEIGHT - Static variable in interface org.jgrapht.WeightedGraph
  The default weight for an edge.
DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Default tolerance.
DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
  Default tolerance.
DefaultDirectedGraph<V,E> - Class in org.jgrapht.graph
  A directed graph.
DefaultDirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultDirectedGraph
  Creates a new directed graph.
DefaultDirectedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DefaultDirectedGraph
  Creates a new directed graph with the specified edge factory.
DefaultDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
  A directed weighted graph.
DefaultDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph
  Creates a new directed weighted graph.
DefaultDirectedWeightedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph
  Creates a new directed weighted graph with the specified edge factory.
DefaultEdge - Class in org.jgrapht.graph
  A default implementation for edges in a `Graph`.
DefaultEdge() - Constructor for class org.jgrapht.graph.DefaultEdge
DefaultGraphMapping<V,E> - Class in org.jgrapht.graph
  Implementation of the GraphMapping interface.
DefaultGraphMapping(Map<V, V>, Map<V, V>, Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.graph.DefaultGraphMapping
  The maps themselves are used.
DefaultListenableGraph<V,E> - Class in org.jgrapht.graph
  A graph backed by the the graph specified at the constructor, which can be listened by `GraphListener` s and by `VertexSetListener` s.
DefaultListenableGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.DefaultListenableGraph
  Creates a new listenable graph.
DefaultListenableGraph(Graph<V, E>, boolean) - Constructor for class org.jgrapht.graph.DefaultListenableGraph
  Creates a new listenable graph.
DefaultWeightedEdge - Class in org.jgrapht.graph
  A default implementation for edges in a `WeightedGraph`.
DefaultWeightedEdge() - Constructor for class org.jgrapht.graph.DefaultWeightedEdge
degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
degreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
degreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
degreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
degreeOf(V) - Method in class org.jgrapht.graph.UndirectedGraphUnion
degreeOf(V) - Method in class org.jgrapht.graph.UndirectedSubgraph
degreeOf(V) - Method in interface org.jgrapht.UndirectedGraph
  Returns the degree of the specified vertex.
delete(FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
  Deletes a node from the heap given the reference to the node.
DepthFirstIterator<V,E> - Class in org.jgrapht.traverse
  A depth-first iterator for a directed and an undirected graph.
DepthFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
  Creates a new depth-first iterator for the specified graph.
DepthFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
  Creates a new depth-first iterator for the specified graph.
detectCycles() - Method in class org.jgrapht.alg.CycleDetector
  Performs yes/no cycle detection on the entire graph.
detectCyclesContainingVertex(V) - Method in class org.jgrapht.alg.CycleDetector
  Performs yes/no cycle detection on an individual vertex.
DijkstraShortestPath<V,E> - Class in org.jgrapht.alg
  An implementation of Dijkstra's shortest path algorithm using `ClosestFirstIterator`.
DijkstraShortestPath(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.DijkstraShortestPath
  Creates and executes a new DijkstraShortestPath algorithm instance.
DijkstraShortestPath(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.DijkstraShortestPath
  Creates and executes a new DijkstraShortestPath algorithm instance.
DirectedAcyclicGraph<V,E> - Class in org.jgrapht.experimental.dag
  DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast topological order iteration.
DirectedAcyclicGraph(Class<? extends E>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph
DirectedAcyclicGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph
DirectedAcyclicGraph.CycleFoundException - Exception in org.jgrapht.experimental.dag
  Exception used in dfsF when a cycle is found
DirectedAcyclicGraph.CycleFoundException() - Constructor for exception org.jgrapht.experimental.dag.DirectedAcyclicGraph.CycleFoundException
DirectedAcyclicGraph.Region - Class in org.jgrapht.experimental.dag
  Region is an *inclusive* range of indices.
DirectedAcyclicGraph.Region(int, int) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
DirectedAcyclicGraph.TopoOrderMapping<V> - Interface in org.jgrapht.experimental.dag
  For performance tuning, an interface for storing the topological ordering
DirectedAcyclicGraph.TopoOrderMappingFactory<V> - Interface in org.jgrapht.experimental.dag
DirectedAcyclicGraph.TopoVertexMap - Class in org.jgrapht.experimental.dag
  For performance and flexibility uses an ArrayList for topological index to vertex mapping, and a HashMap for vertex to topological index mapping.
DirectedAcyclicGraph.TopoVertexMap() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
DirectedAcyclicGraph.Visited - Interface in org.jgrapht.experimental.dag
  this interface allows specification of a strategy for marking vertices as visited (based on their topological index, so the vertex type isn't part of the interface).
DirectedAcyclicGraph.VisitedArrayImpl - Class in org.jgrapht.experimental.dag
  This implementation, somewhat to my surprise, is slower than the ArrayList version, probably due to its reallocation of the underlying array for every topology reorder that is required.
DirectedAcyclicGraph.VisitedArrayImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
  Constructs empty factory instance
DirectedAcyclicGraph.VisitedArrayImpl(DirectedAcyclicGraph.Region) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
DirectedAcyclicGraph.VisitedArrayListImpl - Class in org.jgrapht.experimental.dag
  This implementation seems to offer the best performance in most cases.
DirectedAcyclicGraph.VisitedArrayListImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
DirectedAcyclicGraph.VisitedBitSetImpl - Class in org.jgrapht.experimental.dag
  This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage.
DirectedAcyclicGraph.VisitedBitSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
DirectedAcyclicGraph.VisitedFactory - Interface in org.jgrapht.experimental.dag
  interface for a factory that vends Visited implementations
DirectedAcyclicGraph.VisitedHashSetImpl - Class in org.jgrapht.experimental.dag
  This implementation doesn't seem to perform as well, though I can imagine circumstances where it should shine (lots and lots of vertices).
DirectedAcyclicGraph.VisitedHashSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
DirectedGraph<V,E> - Interface in org.jgrapht
  A graph whose all edges are directed.
DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>> - Class in org.jgrapht.graph.builder
  A builder class for `Graph`.
DirectedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.DirectedGraphBuilder
  Creates a builder based on `baseGraph`.
DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>> - Class in org.jgrapht.graph.builder
  Base class for `DirectedGraphBuilder` for extending.
DirectedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.DirectedGraphBuilderBase
  Creates a builder based on `baseGraph`.
DirectedGraphUnion<V,E> - Class in org.jgrapht.graph
DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.DirectedGraphUnion
DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.DirectedGraphUnion
DirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph
  A directed graph that is a `MaskSubgraph` on another graph.
DirectedMaskSubgraph(DirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.DirectedMaskSubgraph
DirectedMultigraph<V,E> - Class in org.jgrapht.graph
  A directed multigraph.
DirectedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedMultigraph
  Creates a new directed multigraph.
DirectedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedMultigraph
  Creates a new directed multigraph with the specified edge factory.
DirectedNeighborIndex<V,E> - Class in org.jgrapht.alg
  Maintains a cache of each vertex's neighbors.
DirectedNeighborIndex(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.DirectedNeighborIndex
  Creates a neighbor index for the specified directed graph.
DirectedPseudograph<V,E> - Class in org.jgrapht.graph
  A directed pseudograph.
DirectedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph
DirectedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph
DirectedSimpleCycles<V,E> - Interface in org.jgrapht.alg.cycle
  A common interface for classes implementing algorithms for enumeration of the simple cycles of a directed graph.
DirectedSubgraph<V,E> - Class in org.jgrapht.graph
  A directed graph that is a subgraph on other graph.
DirectedSubgraph(DirectedGraph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.DirectedSubgraph
  Creates a new directed subgraph.
DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>> - Class in org.jgrapht.graph.builder
  A builder class for directed weighted graphs}.
DirectedWeightedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.DirectedWeightedGraphBuilder
  Creates a builder based on `baseGraph`.
DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>> - Class in org.jgrapht.graph.builder
  Base class for `DirectedWeightedGraphBuilder` for extending.
DirectedWeightedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase
  Creates a builder based on `baseGraph`.
DirectedWeightedMultigraph<V,E> - Class in org.jgrapht.graph
  A directed weighted multigraph.
DirectedWeightedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
  Creates a new directed weighted multigraph.
DirectedWeightedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
  Creates a new directed weighted multigraph with the specified edge factory.
DirectedWeightedPseudograph<V,E> - Class in org.jgrapht.graph
  A directed weighted pseudograph.
DirectedWeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
  Creates a new directed weighted pseudograph.
DirectedWeightedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
  Creates a new directed weighted pseudograph with the specified edge factory.
DirectedWeightedSubgraph<V,E> - Class in org.jgrapht.graph
  A directed weighted graph that is a subgraph on other graph.
DirectedWeightedSubgraph(WeightedGraph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph
  Creates a new weighted directed subgraph.
DOTExporter<V,E> - Class in org.jgrapht.ext
  Exports a graph into a DOT file.
DOTExporter() - Constructor for class org.jgrapht.ext.DOTExporter
  Constructs a new DOTExporter object with an integer name provider for the vertex IDs and null providers for the vertex and edge labels.
DOTExporter(VertexNameProvider<V>, VertexNameProvider<V>, EdgeNameProvider<E>) - Constructor for class org.jgrapht.ext.DOTExporter
  Constructs a new DOTExporter object with the given ID and label providers.
DOTExporter(VertexNameProvider<V>, VertexNameProvider<V>, EdgeNameProvider<E>, ComponentAttributeProvider<V>, ComponentAttributeProvider<E>) - Constructor for class org.jgrapht.ext.DOTExporter
  Constructs a new DOTExporter object with the given ID, label, and attribute providers.
DOTImporter<V,E> - Class in org.jgrapht.ext
  Imports a graph from a DOT file.
DOTImporter(VertexProvider<V>, EdgeProvider<V, E>) - Constructor for class org.jgrapht.ext.DOTImporter
  Constructs a new DOTImporter with the given providers
DOTImporter(VertexProvider<V>, EdgeProvider<V, E>, VertexUpdater<V>) - Constructor for class org.jgrapht.ext.DOTImporter
  Constructs a new DOTImporter with the given providers
doubleValue() - Method in class org.jgrapht.util.ModifiableInteger

## E

edge - Variable in class org.jgrapht.event.EdgeTraversalEvent
  The traversed edge.
edge - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
  The edge that this event is related to.
EDGE_ADDED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
  Edge added event.
EDGE_REMOVED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
  Edge removed event.
edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.ConnectivityInspector
edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.DirectedNeighborIndex
edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.NeighborIndex
edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
  Notifies that an edge has been added to the graph.
edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.ext.JGraphXAdapter
edgeClass - Variable in class org.jgrapht.generate.WeightedGraphGenerator
edgeClass(Class<? extends E>) - Method in class org.jgrapht.generate.WeightedGraphGenerator
edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
edgeExtended(E) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
EdgeFactory<V,E> - Interface in org.jgrapht
  An edge factory used by graphs for creating new edges.
edgeFactory - Variable in class org.jgrapht.generate.WeightedGraphGenerator
edgeFactory(EdgeFactory<V, E>) - Method in class org.jgrapht.generate.WeightedGraphGenerator
EdgeNameProvider<E> - Interface in org.jgrapht.ext
  Assigns a display name for each of the graph edes.
EdgeProvider<V,E> - Interface in org.jgrapht.ext
  Defines a provider of edges of type E
edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.ConnectivityInspector
edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.DirectedNeighborIndex
edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.NeighborIndex
edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
  Notifies that an edge has been removed from the graph.
edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.ext.JGraphXAdapter
EdgeReversedGraph<V,E> - Class in org.jgrapht.graph
  Provides an edge-reversed view g' of a directed graph g.
EdgeReversedGraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.EdgeReversedGraph
  Creates a new EdgeReversedGraph.
edgeSet() - Method in class org.jgrapht.graph.AbstractBaseGraph
edgeSet() - Method in interface org.jgrapht.Graph
  Returns a set of the edges contained in this graph.
edgeSet() - Method in class org.jgrapht.graph.GraphDelegator
edgeSet() - Method in class org.jgrapht.graph.GraphUnion
edgeSet() - Method in class org.jgrapht.graph.MaskSubgraph
edgeSet() - Method in class org.jgrapht.graph.Subgraph
EdgeSetFactory<V,E> - Interface in org.jgrapht.graph
  A factory for edge sets.
edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
edgesOf(V) - Method in interface org.jgrapht.Graph
  Returns a set of all edges touching the specified vertex.
edgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
edgesOf(V) - Method in class org.jgrapht.graph.GraphUnion
edgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
edgesOf(V) - Method in class org.jgrapht.graph.Subgraph
edgeSource - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
  The source vertex of the edge that this event is related to.
edgeTarget - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
  The target vertex of the edge that this event is related to.
EdgeTraversalEvent<V,E> - Class in org.jgrapht.event
  A traversal event for a graph edge.
EdgeTraversalEvent(Object, E) - Constructor for class org.jgrapht.event.EdgeTraversalEvent
  Creates a new EdgeTraversalEvent.
edgeTraversed(EdgeTraversalEvent<V, E>) - Method in interface org.jgrapht.event.TraversalListener
  Called to inform the listener that the specified edge have been visited during the graph traversal.
edgeTraversed(EdgeTraversalEvent<V, E>) - Method in class org.jgrapht.event.TraversalListenerAdapter
EdmondsBlossomShrinking<V,E> - Class in org.jgrapht.alg
  An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs.
EdmondsBlossomShrinking() - Constructor for class org.jgrapht.alg.EdmondsBlossomShrinking
  Deprecated.
EdmondsBlossomShrinking(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.EdmondsBlossomShrinking
EdmondsKarpMaximumFlow<V,E> - Class in org.jgrapht.alg
  Deprecated.
  Use `EdmondsKarpMaximumFlow` instead
EdmondsKarpMaximumFlow(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Constructs `MaximumFlow` instance to work with a copy of `network`.
EdmondsKarpMaximumFlow(DirectedGraph<V, E>, double) - Constructor for class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Constructs `MaximumFlow` instance to work with a copy of `network`.
EdmondsKarpMaximumFlow<V,E> - Class in org.jgrapht.alg.flow
  A flow network is a directed graph where each edge has a capacity and each edge receives a flow.
EdmondsKarpMaximumFlow(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
  Constructs `MaximumFlow` instance to work with a copy of `network`.
EdmondsKarpMaximumFlow(DirectedGraph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
  Constructs `MaximumFlow` instance to work with a copy of `network`.
EmptyGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates an empty graph of any size.
EmptyGraphGenerator(int) - Constructor for class org.jgrapht.generate.EmptyGraphGenerator
  Construct a new EmptyGraphGenerator.
encounterVertex(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
encounterVertex(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
encounterVertex(V, E) - Method in class org.jgrapht.traverse.CrossComponentIterator
  Update data structures the first time we see a vertex.
encounterVertex(V, E) - Method in class org.jgrapht.traverse.DepthFirstIterator
encounterVertex(V, E) - Method in class org.jgrapht.traverse.TopologicalOrderIterator
encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
  Override superclass.
encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.CrossComponentIterator
  Called whenever we re-encounter a vertex.
encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.DepthFirstIterator
encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.TopologicalOrderIterator
END_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
  Role for the last vertex generated.
equals(Object) - Method in class org.jgrapht.alg.util.Pair
equals(Object) - Method in class org.jgrapht.graph.AbstractGraph
  Indicates whether some other object is "equal to" this graph.
equals(Object) - Method in class org.jgrapht.util.ArrayUnenforcedSet
equals(Object) - Method in class org.jgrapht.util.ModifiableInteger
  Compares this object to the specified object.
equals(Object) - Method in class org.jgrapht.util.VertexPair
EulerianCircuit - Class in org.jgrapht.alg
  This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian circuit).
EulerianCircuit() - Constructor for class org.jgrapht.alg.EulerianCircuit
ExactAlgorithm<ResultType,V> - Interface in org.jgrapht.experimental.alg
export(Writer, Graph<V, E>) - Method in class org.jgrapht.ext.DOTExporter
  Exports a graph into a plain text file in DOT format.
export(Writer, UndirectedGraph<V, E>) - Method in class org.jgrapht.ext.GmlExporter
  Exports an undirected graph into a plain text file in GML format.
export(Writer, DirectedGraph<V, E>) - Method in class org.jgrapht.ext.GmlExporter
  Exports a directed graph into a plain text file in GML format.
export(Writer, Graph<V, E>) - Method in class org.jgrapht.ext.GraphMLExporter
  Exports a graph into a plain text file in GraphML format.
export(OutputStream, Graph<V, E>) - Method in class org.jgrapht.ext.VisioExporter
  Exports the specified graph into a Visio csv file format.
exportAdjacencyMatrix(Writer, UndirectedGraph<V, E>) - Method in class org.jgrapht.ext.MatrixExporter
  Exports the specified graph into a plain text file format containing a sparse representation of the graph's adjacency matrix.
exportAdjacencyMatrix(Writer, DirectedGraph<V, E>) - Method in class org.jgrapht.ext.MatrixExporter
  Exports the specified graph into a plain text file format containing a sparse representation of the graph's adjacency matrix.
exportLaplacianMatrix(Writer, UndirectedGraph<V, E>) - Method in class org.jgrapht.ext.MatrixExporter
  Exports the specified graph into a plain text file format containing a sparse representation of the graph's Laplacian matrix.
exportNormalizedLaplacianMatrix(Writer, UndirectedGraph<V, E>) - Method in class org.jgrapht.ext.MatrixExporter
  Exports the specified graph into a plain text file format containing a sparse representation of the graph's normalized Laplacian matrix.
extend(int) - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
  Performs DFS to seek after matching-augmenting path starting at the initial-vertex
extendedEdge(E) - Method in class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
extendedVertex(V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
Extension<T,E> - Class in org.jgrapht.alg.util
  Abstract extension manager allowing to extend given class-types with supplied extension's class-type saving source class object references
Extension(Extension.ExtensionFactory<E>) - Constructor for class org.jgrapht.alg.util.Extension
Extension.BaseExtension - Class in org.jgrapht.alg.util
Extension.BaseExtension() - Constructor for class org.jgrapht.alg.util.Extension.BaseExtension
Extension.ExtensionFactory<E> - Interface in org.jgrapht.alg.util
  Factory capable of producing given extension objects of the given class-type
Extension.ExtensionManagerInstantiationException - Exception in org.jgrapht.alg.util
Extension.ExtensionManagerInstantiationException(Exception) - Constructor for exception org.jgrapht.alg.util.Extension.ExtensionManagerInstantiationException

## F

factorial(int) - Static method in class org.jgrapht.util.MathUtil
FibonacciHeap<T> - Class in org.jgrapht.util
  This class implements a Fibonacci heap data structure.
FibonacciHeap() - Constructor for class org.jgrapht.util.FibonacciHeap
  Constructs a FibonacciHeap object that contains no elements.
FibonacciHeapNode<T> - Class in org.jgrapht.util
  Implements a node of the Fibonacci heap.
FibonacciHeapNode(T) - Constructor for class org.jgrapht.util.FibonacciHeapNode
  Default constructor.
find(T) - Method in class org.jgrapht.alg.util.UnionFind
  Returns the representative element of the set that element is in.
find2ApproximationCover(Graph<V, E>) - Static method in class org.jgrapht.alg.VertexCovers
  Finds a 2-approximation for a minimal vertex cover of the specified graph.
findCycleBase() - Method in class org.jgrapht.alg.cycle.PatonCycleBase
  Finds a cycle base of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findCycleBase() - Method in interface org.jgrapht.alg.cycle.UndirectedCycleBase
  Finds a cycle base of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findCycles() - Method in class org.jgrapht.alg.CycleDetector
  Finds the vertex set for the subgraph of all cycles.
findCyclesContainingVertex(V) - Method in class org.jgrapht.alg.CycleDetector
  Finds the vertex set for the subgraph of all cycles which contain a particular vertex.
findGreedyChromaticNumber(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.ChromaticNumber
  Finds the number of colors required for a greedy coloring of the graph.
findGreedyColoredGroups(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.ChromaticNumber
  Finds a greedy coloring of the graph.
findGreedyCover(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.VertexCovers
  Finds a greedy approximation for a minimal vertex cover of a specified graph.
findLca(V, V) - Method in class org.jgrapht.alg.NaiveLcaFinder
  Return the first found LCA of a and b
findLcas(V, V) - Method in class org.jgrapht.alg.NaiveLcaFinder
  Return all the LCA of a and b.
findMatch(UndirectedGraph<V, E>) - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
  Deprecated.
findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.BellmanFordShortestPath
  Convenience method to find the shortest path via a single static method call.
findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.DijkstraShortestPath
  Convenience method to find the shortest path via a single static method call.
findSimpleCycles() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
  Finds the simple cycles of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Finds the simple cycles of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findSimpleCycles() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
  Finds the simple cycles of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findSimpleCycles() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
  Finds the simple cycles of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findSimpleCycles() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
  Finds the simple cycles of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
findSimpleCycles() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
  Finds the simple cycles of the graph.
  Note that the full algorithm is executed on every call since the graph may have changed between calls.
finish - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
finishVertex(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
  Called when a vertex has been finished (meaning is dependent on traversal represented by subclass).
fireConnectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Informs all listeners that the traversal of the current connected component finished.
fireConnectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Informs all listeners that a traversal of a new connected component has started.
fireEdgeAdded(E, V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
  Notify listeners that the specified edge was added.
fireEdgeRemoved(E, V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
  Notify listeners that the specified edge was removed.
fireEdgeTraversed(EdgeTraversalEvent<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Informs all listeners that a the specified edge was visited.
fireVertexAdded(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
  Notify listeners that the specified vertex was added.
fireVertexFinished(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Informs all listeners that a the specified vertex was finished.
fireVertexRemoved(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
  Notify listeners that the specified vertex was removed.
fireVertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Informs all listeners that a the specified vertex was visited.
first - Variable in class org.jgrapht.alg.util.Pair
first(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
FIRST - Static variable in interface org.jgrapht.util.WeightCombiner
  First weight.
floatValue() - Method in class org.jgrapht.util.ModifiableInteger
FloydWarshallShortestPaths<V,E> - Class in org.jgrapht.alg
  The Floyd-Warshall algorithm finds all shortest paths (all n^2 of them) in O(n^3) time.
FloydWarshallShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.FloydWarshallShortestPaths

## G

GabowStrongConnectivityInspector<V,E> - Class in org.jgrapht.alg
  Allows obtaining the strongly connected components of a directed graph.
GabowStrongConnectivityInspector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.GabowStrongConnectivityInspector
  The constructor of GabowStrongConnectivityInspector class.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.experimental.GraphReader
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, Object[]>) - Method in class org.jgrapht.experimental.PartiteRandomGraphGenerator
  TODO hb 30-nov-05: document me
generateGraph(Graph, VertexFactory, Map) - Method in class org.jgrapht.experimental.UniformRandomGraphGenerator
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
  Construct a complete bipartite graph
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteGraphGenerator
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.EmptyGraphGenerator
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, T>) - Method in interface org.jgrapht.generate.GraphGenerator
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.GridGraphGenerator
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.HyperCubeGraphGenerator
  This will generate the hypercube graph
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.LinearGraphGenerator
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.RandomGraphGenerator
  (non-Javadoc)
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.RingGraphGenerator
  Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.ScaleFreeGraphGenerator
  Generates scale-free network with `size` passed to the constructor.
generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.StarGraphGenerator
  Generates a star graph with the designated order from the constructor
generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, T>) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, T>) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.WheelGraphGenerator
  Generate a graph structure.
get(T) - Method in class org.jgrapht.alg.util.Extension
getA() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
getAllEdges(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
getAllEdges(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
getAllEdges(V, V) - Method in interface org.jgrapht.Graph
  Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
getAllEdges(V, V) - Method in class org.jgrapht.graph.GraphDelegator
getAllEdges(V, V) - Method in class org.jgrapht.graph.GraphUnion
getAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
getAllEdges(V, V) - Method in class org.jgrapht.graph.Subgraph
getAllMaximalCliques() - Method in class org.jgrapht.alg.BronKerboschCliqueFinder
  Finds all maximal cliques of the graph.
getAllPaths(V, V, boolean, Integer) - Method in class org.jgrapht.alg.AllDirectedPaths
  Calculate (and return) all paths from the source vertex to the target vertex.
getAllPaths(Set<V>, Set<V>, boolean, Integer) - Method in class org.jgrapht.alg.AllDirectedPaths
  Calculate (and return) all paths from the source vertices to the target vertices.
getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V, E>) - Static method in class org.jgrapht.alg.HamiltonianCycle
  This method will return an approximate minimal traveling salesman tour (hamiltonian cycle).
getAtoms() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the atoms generated by the decomposition.
getB() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
getBase() - Method in class org.jgrapht.graph.Subgraph
getBiconnectedVertexComponents() - Method in class org.jgrapht.alg.BiconnectivityInspector
  Returns the biconnected vertex-components of the graph.
getBiconnectedVertexComponents(V) - Method in class org.jgrapht.alg.BiconnectivityInspector
  Returns the biconnected vertex-components containing the vertex.
getBiggestMaximalCliques() - Method in class org.jgrapht.alg.BronKerboschCliqueFinder
  Finds the biggest maximal cliques of the graph.
getBlock(V) - Method in class org.jgrapht.alg.BlockCutpointGraph
  Returns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected component) containing the vertex.
getCellFactory() - Method in class org.jgrapht.ext.JGraphModelAdapter
  Returns the cell factory used to create the JGraph cells.
getCellToEdgeMap() - Method in class org.jgrapht.ext.JGraphXAdapter
  Returns Hashmap which maps the visualization mxICells onto their edges.
getCellToVertexMap() - Method in class org.jgrapht.ext.JGraphXAdapter
  Returns Hashmap which maps the visualization mxICells onto their vertices.
getComponentAttributes(T) - Method in interface org.jgrapht.ext.ComponentAttributeProvider
  Returns a set of attribute key/value pairs for a vertex or edge.
getCost(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath
getCostEstimate(V, V) - Method in interface org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic
  An admissible "heuristic estimate" of the distance from x, the sourceVertex, to the goal (usually denoted h(x)).
getCurrentSink() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Returns current sink vertex, or `null` if there was no `calculateMaximumFlow` calls.
getCurrentSink() - Method in class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
  Returns current sink vertex, or `null` if there was no `calculateMaximumFlow` calls.
getCurrentSink() - Method in class org.jgrapht.alg.MinSourceSinkCut
  Returns the sink of the last call
getCurrentSource() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Returns current source vertex, or `null` if there was no `calculateMaximumFlow` calls.
getCurrentSource() - Method in class org.jgrapht.alg.flow.EdmondsKarpMaximumFlow
  Returns current source vertex, or `null` if there was no `calculateMaximumFlow` calls.
getCurrentSource() - Method in class org.jgrapht.alg.MinSourceSinkCut
  Returns the source of the last call
getCutEdges() - Method in class org.jgrapht.alg.MinSourceSinkCut
  Let S be the set containing the source, and T be the set containing the sink, i.e.
getCutpoints() - Method in class org.jgrapht.alg.BiconnectivityInspector
  Returns the cutpoints of the graph.
getCutpoints() - Method in class org.jgrapht.alg.BlockCutpointGraph
  Returns the cutpoints of the initial graph.
getCutWeight() - Method in class org.jgrapht.alg.MinSourceSinkCut
  Get the cut weight.
getData() - Method in class org.jgrapht.util.FibonacciHeapNode
  Obtain the data for this node.
getDefaultEdgeAttributes() - Method in class org.jgrapht.ext.JGraphModelAdapter
  Returns the default edge attributes used for creating new JGraph edges.
getDefaultVertexAttributes() - Method in class org.jgrapht.ext.JGraphModelAdapter
  Returns the default vertex attributes used for creating new JGraph vertices.
getDiameter() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
getEdge() - Method in class org.jgrapht.event.EdgeTraversalEvent
  Returns the traversed edge.
getEdge() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
  Returns the edge that this event is related to.
getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
getEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
getEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
getEdge(V, V) - Method in interface org.jgrapht.Graph
  Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
getEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
getEdge(V, V) - Method in class org.jgrapht.graph.GraphUnion
getEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
getEdge(V, V) - Method in class org.jgrapht.graph.Subgraph
getEdgeCell(E) - Method in class org.jgrapht.ext.JGraphModelAdapter
  Returns the JGraph edge cell that corresponds to the specified JGraphT edge.
getEdgeCorrespondence(E, boolean) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
getEdgeCorrespondence(E, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
getEdgeCorrespondence(E, boolean) - Method in interface org.jgrapht.GraphMapping
  Gets the mapped value where the key is `edge`
getEdgeFactory() - Method in class org.jgrapht.graph.AbstractBaseGraph
getEdgeFactory() - Method in interface org.jgrapht.Graph
  Returns the edge factory using which this graph creates new edges.
getEdgeFactory() - Method in class org.jgrapht.graph.GraphDelegator
getEdgeFactory() - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
getEdgeFactory() - Method in class org.jgrapht.graph.MaskSubgraph
getEdgeFactory() - Method in class org.jgrapht.graph.Subgraph
getEdgeList() - Method in class org.jgrapht.graph.GraphPathImpl
getEdgeList() - Method in class org.jgrapht.graph.SimpleGraphPath
getEdgeList() - Method in interface org.jgrapht.GraphPath
  Returns the edges making up the path.
getEdgeName(E) - Method in interface org.jgrapht.ext.EdgeNameProvider
  Returns a unique name for an edge.
getEdgeName(E) - Method in class org.jgrapht.ext.IntegerEdgeNameProvider
  Returns the String representation of an edge.
getEdgeName(E) - Method in class org.jgrapht.ext.StringEdgeNameProvider
  Returns the String representation an edge.
getEdgeSet() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
  Deprecated.
getEdgeSource() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
  Returns the source vertex that this event is related to.
getEdgeSource(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
getEdgeSource(E) - Method in class org.jgrapht.graph.EdgeReversedGraph
getEdgeSource(E) - Method in interface org.jgrapht.Graph
  Returns the source vertex of an edge.
getEdgeSource(E) - Method in class org.jgrapht.graph.GraphDelegator
getEdgeSource(E) - Method in class org.jgrapht.graph.GraphUnion
getEdgeSource(E) - Method in class org.jgrapht.graph.MaskSubgraph
getEdgeSource(E) - Method in class org.jgrapht.graph.Subgraph
getEdgeTarget() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
  Returns the target vertex that this event is related to.
getEdgeTarget(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
getEdgeTarget(E) - Method in class org.jgrapht.graph.EdgeReversedGraph
getEdgeTarget(E) - Method in interface org.jgrapht.Graph
  Returns the target vertex of an edge.
getEdgeTarget(E) - Method in class org.jgrapht.graph.GraphDelegator
getEdgeTarget(E) - Method in class org.jgrapht.graph.GraphUnion
getEdgeTarget(E) - Method in class org.jgrapht.graph.MaskSubgraph
getEdgeTarget(E) - Method in class org.jgrapht.graph.Subgraph
getEdgeToCellMap() - Method in class org.jgrapht.ext.JGraphXAdapter
  Returns Hashmap which maps the edges onto their visualization mxICells.
getEdgeWeight(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
getEdgeWeight(E) - Method in class org.jgrapht.graph.AsUnweightedGraph
getEdgeWeight(E) - Method in class org.jgrapht.graph.AsWeightedGraph
getEdgeWeight(E) - Method in interface org.jgrapht.Graph
  Returns the weight assigned to a given edge.
getEdgeWeight(E) - Method in class org.jgrapht.graph.GraphDelegator
getEdgeWeight(E) - Method in class org.jgrapht.graph.GraphUnion
getEdgeWeight(E) - Method in class org.jgrapht.graph.MaskSubgraph
getEdgeWeight(E) - Method in class org.jgrapht.graph.Subgraph
getEndVertex() - Method in class org.jgrapht.graph.GraphPathImpl
getEndVertex() - Method in class org.jgrapht.graph.SimpleGraphPath
getEndVertex() - Method in interface org.jgrapht.GraphPath
  Returns the end vertex in the path.
getEulerianCircuitVertices(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.EulerianCircuit
  This method will return a list of vertices which represents the Eulerian circuit of the graph.
getFillEdges() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the fill edges generated by the triangulation.
getFirst() - Method in class org.jgrapht.util.VertexPair
getFlow() - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlow
  Returns mapping from edge to flow value through this particular edge
getFlow() - Method in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
getFullComponentCount() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get a map to know for each separator how many components it produces.
getG1() - Method in class org.jgrapht.graph.GraphUnion
getG2() - Method in class org.jgrapht.graph.GraphUnion
getGenerators() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the generators of the separators of the triangulated graph, i.e.
getGraph() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the original graph.
getGraph() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
  Returns the graph on which the simple cycle search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Returns the graph on which the simple cycle search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
  Returns the graph on which the simple cycle search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.cycle.PatonCycleBase
  Returns the graph on which the cycle base search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
  Returns the graph on which the simple cycle search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
  Returns the graph on which the simple cycle search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
  Returns the graph on which the simple cycle search algorithm is executed by this object.
getGraph() - Method in interface org.jgrapht.alg.cycle.UndirectedCycleBase
  Returns the graph on which the cycle base search algorithm is executed by this object.
getGraph() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
getGraph() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector
  Returns the graph inspected
getGraph() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
  Returns the graph inspected by the StrongConnectivityAlgorithm.
getGraph() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
  Returns the graph inspected by the StrongConnectivityAlgorithm.
getGraph() - Method in class org.jgrapht.alg.StrongConnectivityInspector
  Deprecated.
  Returns the graph inspected by the StrongConnectivityAlgorithm.
getGraph() - Method in class org.jgrapht.graph.GraphPathImpl
getGraph() - Method in class org.jgrapht.graph.SimpleGraphPath
getGraph() - Method in interface org.jgrapht.GraphPath
  Returns the graph over which this path is defined.
getGraph() - Method in class org.jgrapht.traverse.CrossComponentIterator
getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
getInstance(DirectedAcyclicGraph.Region) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedFactory
getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
getKey() - Method in class org.jgrapht.util.FibonacciHeapNode
  Obtain the key for this node.
getLca() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
getLowerBound(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm
getLowerBound(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
getMappings() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector
getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
getMatching() - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
getMatching() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
getMatching() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm
  Returns set of edges making up the matching
getMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
getMatching() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
getMatchingWeight() - Method in interface org.jgrapht.alg.interfaces.WeightedMatchingAlgorithm
  Returns weight of a matching found
getMatchingWeight() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
getMatchingWeight() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
getMaxEdgesForVertexNum(Graph<VV, EE>) - Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
  Return max edges for that graph.
getMaximumFlow() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Returns maximum flow, that was calculated during last `calculateMaximumFlow` call, or `null`, if there was no `calculateMaximumFlow` calls.
getMaximumFlowValue() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
  Deprecated.
  Returns maximum flow value, that was calculated during last `calculateMaximumFlow` call, or `null`, if there was no `calculateMaximumFlow` calls.
getMeo() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the minimal elimination ordering produced by the triangulation.
getMinimalTriangulation() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the minimal triangulation of the graph.
getMinimumSpanningTreeEdgeSet() - Method in interface org.jgrapht.alg.interfaces.MinimumSpanningTree
  Returns edges set constituting the minimum spanning tree/forest
getMinimumSpanningTreeEdgeSet() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
getMinimumSpanningTreeEdgeSet() - Method in class org.jgrapht.alg.PrimMinimumSpanningTree
getMinimumSpanningTreeTotalWeight() - Method in interface org.jgrapht.alg.interfaces.MinimumSpanningTree
  Returns total weight of the minimum spanning tree/forest.
getMinimumSpanningTreeTotalWeight() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
getMinimumSpanningTreeTotalWeight() - Method in class org.jgrapht.alg.PrimMinimumSpanningTree
getNumberOfExpandedNodes() - Method in class org.jgrapht.alg.AStarShortestPath
  Returns how many nodes have been expanded in the A* search procedure in its last invocation.
getOppositeVertex(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
  Gets the vertex opposite another vertex across an edge.
getOther(V) - Method in class org.jgrapht.util.VertexPair
getParentMap() - Method in class org.jgrapht.alg.util.UnionFind
getPath() - Method in class org.jgrapht.alg.DijkstraShortestPath
  Return the path found.
getPathEdgeList(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath
getPathEdgeList() - Method in class org.jgrapht.alg.DijkstraShortestPath
  Return the edges making up the path found.
getPathLength() - Method in class org.jgrapht.alg.DijkstraShortestPath
  Return the weighted length of the path found.
getPaths(V) - Method in class org.jgrapht.alg.KShortestPaths
  Returns the k shortest simple paths in increasing order of weight.
getPathVertexList(GraphPath<V, E>) - Static method in class org.jgrapht.Graphs
  Gets the list of vertices visited by a path.
getPrintLabels() - Method in class org.jgrapht.ext.GmlExporter
  Get whether to export the vertex and edge labels.
getRandomSeed() - Method in class org.jgrapht.generate.RandomGraphGenerator
getRankMap() - Method in class org.jgrapht.alg.util.UnionFind
getResult(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
getResult(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ExactAlgorithm
getSecond() - Method in class org.jgrapht.util.VertexPair
getSeenData(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
  Access the data stored for a seen vertex.
getSeparators() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Get the clique minimal separators.
getShortestPath(V, V, AStarAdmissibleHeuristic<V>) - Method in class org.jgrapht.alg.AStarShortestPath
  Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.
getShortestPath(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
  Get the shortest path between two vertices.
getShortestPathAsVertexList(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
getShortestPathLength(V) - Method in class org.jgrapht.traverse.ClosestFirstIterator
  Get the weighted length of the shortest path known to the given vertex.
getShortestPaths(V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
  Get shortest paths from a vertex to all other vertices in the graph.
getShortestPaths() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
  Get all shortest paths in the graph.
getShortestPathsCount() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
getSinkPartition() - Method in class org.jgrapht.alg.MinSourceSinkCut
  Returns the min cut partition containing the sink
getSize() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
getSource() - Method in class org.jgrapht.graph.DefaultEdge
  Retrieves the source of this edge.
getSourcePartition() - Method in class org.jgrapht.alg.MinSourceSinkCut
getSpanningTreeCost() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
  Deprecated.
getSpanningTreeEdge(V) - Method in class org.jgrapht.traverse.ClosestFirstIterator
  Get the spanning tree edge reaching a vertex which has been seen already in this traversal.
getStack() - Method in class org.jgrapht.traverse.DepthFirstIterator
  Retrieves the LIFO stack of vertices which have been encountered but not yet visited (WHITE).
getStartVertex() - Method in class org.jgrapht.graph.GraphPathImpl
getStartVertex() - Method in class org.jgrapht.graph.SimpleGraphPath
getStartVertex() - Method in interface org.jgrapht.GraphPath
  Returns the start vertex in the path.
getTarget() - Method in class org.jgrapht.graph.DefaultEdge
  Retrieves the target of this edge.
getTopologicalIndex(V) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
  get the topological index of the given vertex.
getTopologicalIndex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
getTopoOrderMapping() - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMappingFactory
getTopoOrderMapping() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
getType() - Method in class org.jgrapht.event.ConnectedComponentTraversalEvent
  Returns the event type.
getType() - Method in class org.jgrapht.event.GraphChangeEvent
  Returns the event type.
getUnmodifiableIncomingEdges() - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
  A lazy build of unmodifiable incoming edge set.
getUnmodifiableOutgoingEdges() - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
  A lazy build of unmodifiable outgoing edge set.
getUpperBound(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm
getUpperBound(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
getValue() - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlow
  Returns value of the maximum-flow for the given network
getValue() - Method in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
getValue() - Method in class org.jgrapht.util.ModifiableInteger
  Returns the value of this object, similarly to `ModifiableInteger.intValue()`.
getVertex() - Method in class org.jgrapht.event.GraphVertexChangeEvent
  Returns the vertex that this event is related to.
getVertex() - Method in class org.jgrapht.event.VertexTraversalEvent
  Returns the traversed vertex.
getVertex(Integer) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
  get the vertex at the given topological index.
getVertex(Integer) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
getVertexCell(Object) - Method in class org.jgrapht.ext.JGraphModelAdapter
  Returns the JGraph vertex cell that corresponds to the specified JGraphT vertex.
getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
getVertexCorrespondence(V, boolean) - Method in interface org.jgrapht.GraphMapping
  Gets the mapped value where the key is `vertex`
getVertexList() - Method in class org.jgrapht.graph.SimpleGraphPath
getVertexName(V) - Method in class org.jgrapht.ext.IntegerNameProvider
  Returns the String representation of the unique integer representing a vertex.
getVertexName(V) - Method in class org.jgrapht.ext.StringNameProvider
  Returns the String representation of the unique integer representing a vertex.
getVertexName(V) - Method in interface org.jgrapht.ext.VertexNameProvider
  Returns a unique name for a vertex.
getVertexPort(Object) - Method in class org.jgrapht.ext.JGraphModelAdapter
  Returns the JGraph port cell that corresponds to the specified JGraphT vertex.
getVertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
getVertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
getVertexToCellMap() - Method in class org.jgrapht.ext.JGraphXAdapter
  Returns Hashmap which maps the vertices onto their visualization mxICells.
getVisited(int) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited
  has the given topological index been visited?
getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
getWeight() - Method in class org.jgrapht.graph.DefaultWeightedEdge
  Retrieves the weight of this edge.
getWeight() - Method in class org.jgrapht.graph.GraphPathImpl
getWeight() - Method in class org.jgrapht.graph.SimpleGraphPath
getWeight() - Method in interface org.jgrapht.GraphPath
  Returns the weight assigned to the path.
GmlExporter<V,E> - Class in org.jgrapht.ext
  Exports a graph into a GML file (Graph Modelling Language).
GmlExporter() - Constructor for class org.jgrapht.ext.GmlExporter
  Creates a new GmlExporter object with integer name providers for the vertex and edge IDs and null providers for the vertex and edge labels.
GmlExporter(VertexNameProvider<V>, VertexNameProvider<V>, EdgeNameProvider<E>, EdgeNameProvider<E>) - Constructor for class org.jgrapht.ext.GmlExporter
  Constructs a new GmlExporter object with the given ID and label providers.
graph - Variable in class org.jgrapht.alg.BellmanFordShortestPath
  Graph on which shortest paths are searched.
Graph<V,E> - Interface in org.jgrapht
  The root interface in the graph hierarchy.
graph - Variable in class org.jgrapht.graph.builder.AbstractGraphBuilder
graph1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
graph2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
GraphChangeEvent - Class in org.jgrapht.event
  An event which indicates that a graph has changed.
GraphChangeEvent(Object, int) - Constructor for class org.jgrapht.event.GraphChangeEvent
  Creates a new graph change event.
GraphDelegator<V,E> - Class in org.jgrapht.graph
  A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph.
GraphDelegator(Graph<V, E>) - Constructor for class org.jgrapht.graph.GraphDelegator
  Constructor for GraphDelegator.
GraphEdgeChangeEvent<V,E> - Class in org.jgrapht.event
  An event which indicates that a graph edge has changed, or is about to change.
GraphEdgeChangeEvent(Object, int, E) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent
  Deprecated.
  Use new constructor which takes vertex parameters.
GraphEdgeChangeEvent(Object, int, E, V, V) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent
  Constructor for GraphEdgeChangeEvent.
GraphGenerator<V,E,T> - Interface in org.jgrapht.generate
  GraphGenerator defines an interface for generating new graph structures.
GraphHelper - Class in org.jgrapht
  Deprecated.
  Use `Graphs` instead.
GraphHelper() - Constructor for class org.jgrapht.GraphHelper
  Deprecated.
GraphIterator<V,E> - Interface in org.jgrapht.traverse
  A graph iterator.
GraphListener<V,E> - Interface in org.jgrapht.event
  A listener that is notified when the graph changes.
GraphMapping<V,E> - Interface in org.jgrapht
  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> - Class in org.jgrapht.ext
  Exports a graph into a GraphML file.
GraphMLExporter() - Constructor for class org.jgrapht.ext.GraphMLExporter
  Constructs a new GraphMLExporter object with integer name providers for the vertex and edge IDs and null providers for the vertex and edge labels.
GraphMLExporter(VertexNameProvider<V>, VertexNameProvider<V>, EdgeNameProvider<E>, EdgeNameProvider<E>) - Constructor for class org.jgrapht.ext.GraphMLExporter
  Constructs a new GraphMLExporter object with the given ID and label providers.
GraphPath<V,E> - Interface in org.jgrapht
  A GraphPath represents a path in a `Graph`.
GraphPathImpl<V,E> - Class in org.jgrapht.graph
  GraphPathImpl is a default implementation of `GraphPath`.
GraphPathImpl(Graph<V, E>, V, V, List<E>, double) - Constructor for class org.jgrapht.graph.GraphPathImpl
GraphReader<V,E> - Class in org.jgrapht.experimental
GraphReader(Reader) - Constructor for class org.jgrapht.experimental.GraphReader
  Construct a new GraphReader.
GraphReader(Reader, double) - Constructor for class org.jgrapht.experimental.GraphReader
  Construct a new GraphReader.
Graphs - Class in org.jgrapht
  A collection of utilities to assist with graph manipulation.
Graphs() - Constructor for class org.jgrapht.Graphs
GraphSquare<V,E> - Class in org.jgrapht.experimental
  DOCUMENT ME!
GraphSquare(Graph<V, E>, boolean) - Constructor for class org.jgrapht.experimental.GraphSquare
  Constructor for GraphSquare.
GraphTests<V,E> - Class in org.jgrapht.experimental
GraphUnion<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph
  Read-only union of two graphs: G1 and G2.
GraphUnion(G, G, WeightCombiner) - Constructor for class org.jgrapht.graph.GraphUnion
GraphUnion(G, G) - Constructor for class org.jgrapht.graph.GraphUnion
GraphVertexChangeEvent<V> - Class in org.jgrapht.event
  An event which indicates that a graph vertex has changed, or is about to change.
GraphVertexChangeEvent(Object, int, V) - Constructor for class org.jgrapht.event.GraphVertexChangeEvent
  Creates a new GraphVertexChangeEvent object.
GreedyColoring<V,E> - Class in org.jgrapht.experimental.alg.color
GreedyColoring(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.color.GreedyColoring
GreedyColoring(Graph<V, E>, int) - Constructor for class org.jgrapht.experimental.alg.color.GreedyColoring
GridGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a bidirectional grid graph of any size.
GridGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GridGraphGenerator
  Creates a new GridGraphGenerator object with rows x cols dimension.
gScoreMap - Variable in class org.jgrapht.alg.AStarShortestPath

## H

HamiltonianCycle - Class in org.jgrapht.alg
  This class will deal with finding the optimal or approximately optimal minimum tour (hamiltonian cycle) or commonly known as the Traveling Salesman Problem.
HamiltonianCycle() - Constructor for class org.jgrapht.alg.HamiltonianCycle
hasEdgeCorrespondence(E) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
  Checks if a edge e from the first graph has a corresponding edge in the second graph
hashCode() - Method in class org.jgrapht.alg.util.Pair
hashCode() - Method in class org.jgrapht.graph.AbstractGraph
  Returns a hash code value for this graph.
hashCode() - Method in class org.jgrapht.util.ArrayUnenforcedSet
hashCode() - Method in class org.jgrapht.util.ModifiableInteger
  Returns a hash code for this `ModifiableInteger`.
hashCode() - Method in class org.jgrapht.util.VertexPair
hasMoreElements() - Method in class org.jgrapht.util.PrefetchIterator
  If (isGetNextLastResultUpToDate==true) returns true else 1.
hasNext() - Method in class org.jgrapht.traverse.CrossComponentIterator
hasNext() - Method in class org.jgrapht.util.PrefetchIterator
hasVertex(V) - Method in class org.jgrapht.util.VertexPair
  Assess if this pair contains the vertex.
hasVertexCorrespondence(V) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
  Checks if a vertex v from the first graph has a corresponding vertex in the second graph
HawickJamesSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
  Find all simple cycles of a directed graph using the algorithm described by Hawick and James.
HawickJamesSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Create a simple cycle finder with an unspecified graph.
HawickJamesSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Create a simple cycle finder for the specified graph.
HelloJGraphT - Class in org.jgrapht.demo
  A simple introduction to using JGraphT.
HopcroftKarpBipartiteMatching<V,E> - Class in org.jgrapht.alg
  This class is an implementation of the Hopcroft-Karp algorithm which finds a maximum matching in an undirected simple bipartite graph.
HopcroftKarpBipartiteMatching(UndirectedGraph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.HopcroftKarpBipartiteMatching
HUB_VERTEX - Static variable in class org.jgrapht.generate.WheelGraphGenerator
  Role for the hub vertex.
HyperCubeGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a hyper cube graph of any size.
HyperCubeGraphGenerator(int) - Constructor for class org.jgrapht.generate.HyperCubeGraphGenerator
  Creates a new HyperCubeGraphGenerator object.

## I

ImportException - Exception in org.jgrapht.ext
  Used to show problems with importing a graph.
ImportException(String) - Constructor for exception org.jgrapht.ext.ImportException
ImportException(String, Throwable) - Constructor for exception org.jgrapht.ext.ImportException
incomingEdgesOf(V) - Method in interface org.jgrapht.DirectedGraph
  Returns a set of all edges incoming into the specified vertex.
incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
incomingEdgesOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
incomingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedGraphUnion
incomingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph
incomingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
incomingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
incomingEdgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
incomingEdgesOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
increment() - Method in class org.jgrapht.util.ModifiableInteger
  Adds one to the value of this modifiable integer.
inDegreeOf(V) - Method in interface org.jgrapht.DirectedGraph
  Returns the "in degree" of the specified vertex.
inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
inDegreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
inDegreeOf(V) - Method in class org.jgrapht.graph.DirectedGraphUnion
inDegreeOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph
inDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
inDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
inDegreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
inDegreeOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
init() - Method in class org.jgrapht.demo.JGraphAdapterDemo
init() - Method in class org.jgrapht.demo.JGraphXAdapterDemo
initialize(PushRelabelMaximumFlow<V, E>.VertexExtension, PushRelabelMaximumFlow<V, E>.VertexExtension, Queue<PushRelabelMaximumFlow<V, E>.VertexExtension>) - Method in class org.jgrapht.alg.flow.PushRelabelMaximumFlow
insert(FibonacciHeapNode<T>, double) - Method in class org.jgrapht.util.FibonacciHeap
  Inserts a new data element into the heap.
INSTANCE - Static variable in class org.jgrapht.alg.TransitiveClosure
  Singleton instance.
INSTANCE - Static variable in class org.jgrapht.alg.TransitiveReduction
  Singleton instance.
IntArrayGraphAlgorithm<V,E> - Class in org.jgrapht.experimental.alg
IntArrayGraphAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.IntArrayGraphAlgorithm
IntegerEdgeNameProvider<E> - Class in org.jgrapht.ext
  Assigns a unique integer to represent each edge.
IntegerEdgeNameProvider() - Constructor for class org.jgrapht.ext.IntegerEdgeNameProvider
IntegerNameProvider<V> - Class in org.jgrapht.ext
  Assigns a unique integer to represent each vertex.
IntegerNameProvider() - Constructor for class org.jgrapht.ext.IntegerNameProvider
intValue() - Method in class org.jgrapht.util.ModifiableInteger
isAllowingLoops() - Method in class org.jgrapht.graph.AbstractBaseGraph
  Returns `true` if and only if self-loops are allowed in this graph.
isAllowingMultipleEdges() - Method in class org.jgrapht.graph.AbstractBaseGraph
  Returns `true` if and only if multiple edges are allowed in this graph.
isBiconnected() - Method in class org.jgrapht.alg.BiconnectivityInspector
  Returns `true` if the graph is biconnected (no cutpoint), `false` otherwise.
isBipartite(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
isChordal() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
  Check if the graph is chordal.
isComplete(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
isConnected(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.BreadthFirstIterator
isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.ClosestFirstIterator
isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.CrossComponentIterator
  Returns `true` if there are no more uniterated vertices in the currently iterated connected component; `false` otherwise.
isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.DepthFirstIterator
isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
isCrossComponentTraversal() - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Test whether this iterator is set to traverse the graph across connected components.
isCrossComponentTraversal() - Method in interface org.jgrapht.traverse.GraphIterator
  Test whether this iterator is set to traverse the grpah across connected components.
isCutpoint(V) - Method in class org.jgrapht.alg.BlockCutpointGraph
  Returns `true` if the vertex is a cutpoint, `false` otherwise.
isEdgeMasked(E) - Method in interface org.jgrapht.graph.MaskFunctor
  Returns `true` if the edge is masked, `false` otherwise.
isEmpty(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
isEmpty() - Method in class org.jgrapht.util.FibonacciHeap
  Tests if the Fibonacci heap is empty or not.
isEnumerationStartedEmpty() - Method in class org.jgrapht.util.PrefetchIterator
  Tests whether the enumeration started as an empty one.
isEqualMapping(GraphMapping<V, E>) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
  Checks for equality.
isEulerian(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.EulerianCircuit
  This method will check whether the graph passed in is Eulerian or not.
isExact() - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm
isExact() - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
isGraphConnected() - Method in class org.jgrapht.alg.ConnectivityInspector
  Test if the inspected graph is connected.
isIn(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
isNumberOfEdgesValid(Graph<VV, EE>, int) - Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
  checks if the numOfEdges is smaller than the Max edges according to the following table:
isNumberOfEdgesValid(Graph<VV, EE>, int) - Method in interface org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory
  Checks if the graph can contain the givven numberOfEdges according to the graph type restrictions.
IsomorphicGraphMapping<V,E> - Class in org.jgrapht.alg.isomorphism
  This class represents a GraphMapping between two (subgraph)isomorphic graphs.
IsomorphicGraphMapping(GraphOrdering<V, E>, GraphOrdering<V, E>, int[], int[]) - Constructor for class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
isomorphismExists() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector
isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
IsomorphismInspector<V,E> - Interface in org.jgrapht.alg.isomorphism
  This is a general interface for graph and subgraph isomorphism.
isReuseEvents() - Method in class org.jgrapht.graph.DefaultListenableGraph
  Tests whether the `reuseEvents` flag is set.
isReuseEvents() - Method in class org.jgrapht.traverse.AbstractGraphIterator
isReuseEvents() - Method in interface org.jgrapht.traverse.GraphIterator
  Tests whether the `reuseEvents` flag is set.
isSeenVertex(Object) - Method in class org.jgrapht.traverse.CrossComponentIterator
  Determines whether a vertex has been seen yet by this traversal.
isStronglyConnected() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector
  Returns true if the graph instance is strongly connected.
isStronglyConnected() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
  Returns true if the graph of this `StrongConnectivityAlgorithm` instance is strongly connected.
isStronglyConnected() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
  Returns true if the graph of this `StronglyConnectivityInspector` instance is strongly connected.
isStronglyConnected() - Method in class org.jgrapht.alg.StrongConnectivityInspector
  Deprecated.
  Returns true if the graph of this `StronglyConnectivityInspector` instance is strongly connected.
isTree(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
isVertexMasked(V) - Method in interface org.jgrapht.graph.MaskFunctor
  Returns `true` if the vertex is masked, `false` otherwise.
iterator() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
  iterator will traverse the vertices in topological order, meaning that for a directed graph G = (V,E), if there exists a path from vertex va to vertex vb then va is guaranteed to come before vertex vb in the iteration order.

## J

JGraphAdapterDemo - Class in org.jgrapht.demo
  A demo applet that shows how to use JGraph to visualize JGraphT graphs.
JGraphAdapterDemo() - Constructor for class org.jgrapht.demo.JGraphAdapterDemo
JGraphModelAdapter<V,E> - Class in org.jgrapht.ext
  An adapter that reflects a JGraphT graph as a JGraph graph.
JGraphModelAdapter(Graph<V, E>) - Constructor for class org.jgrapht.ext.JGraphModelAdapter
  Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter(Graph<V, E>, AttributeMap, AttributeMap) - Constructor for class org.jgrapht.ext.JGraphModelAdapter
  Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter(Graph<V, E>, AttributeMap, AttributeMap, JGraphModelAdapter.CellFactory<V, E>) - Constructor for class org.jgrapht.ext.JGraphModelAdapter
  Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter.CellFactory<VV,EE> - Interface in org.jgrapht.ext
  Creates the JGraph cells that reflect the respective JGraphT elements.
JGraphModelAdapter.DefaultCellFactory<VV,EE> - Class in org.jgrapht.ext
  A simple default cell factory.
JGraphModelAdapter.DefaultCellFactory() - Constructor for class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory
JGraphXAdapter<V,E> - Class in org.jgrapht.ext
  Adapter to draw a JGraphT graph with the JGraphX drawing library.
JGraphXAdapter(ListenableGraph<V, E>) - Constructor for class org.jgrapht.ext.JGraphXAdapter
  Constructs and draws a new ListenableGraph.
JGraphXAdapter(Graph<V, E>) - Constructor for class org.jgrapht.ext.JGraphXAdapter
  Constructs and draws a new mxGraph from a jGraphT graph.
JGraphXAdapterDemo - Class in org.jgrapht.demo
  A demo applet that shows how to use JGraphX to visualize JGraphT graphs.
JGraphXAdapterDemo() - Constructor for class org.jgrapht.demo.JGraphXAdapterDemo
JohnsonSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
  Find all simple cycles of a directed graph using the Johnson's algorithm.
JohnsonSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.JohnsonSimpleCycles
  Create a simple cycle finder with an unspecified graph.
JohnsonSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.JohnsonSimpleCycles
  Create a simple cycle finder for the specified graph.

## K

KosarajuStrongConnectivityInspector<V,E> - Class in org.jgrapht.alg
  Complements the `ConnectivityInspector` class with the capability to compute the strongly connected components of a directed graph.
KosarajuStrongConnectivityInspector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.KosarajuStrongConnectivityInspector
  The constructor of the StrongConnectivityAlgorithm class.
KruskalMinimumSpanningTree<V,E> - Class in org.jgrapht.alg
  An implementation of Kruskal's minimum spanning tree algorithm.
KruskalMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.KruskalMinimumSpanningTree
  Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
KShortestPaths<V,E> - Class in org.jgrapht.alg
  The algorithm determines the k shortest simple paths in increasing order of weight.
KShortestPaths(Graph<V, E>, V, int) - Constructor for class org.jgrapht.alg.KShortestPaths
  Creates an object to compute ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V, E>, V, int, int) - Constructor for class org.jgrapht.alg.KShortestPaths
  Creates an object to calculate ranking shortest paths between the start vertex and others vertices.
KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> - Class in org.jgrapht.alg
  Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres) solving assignment problem also known as hungarian algorithm (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
KuhnMunkresMinimalWeightBipartitePerfectMatching(WeightedGraph<V, E>, List<? extends V>, List<? extends V>) - Constructor for class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E> - Class in org.jgrapht.alg
  ...
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation(WeightedGraph<V, E>, List<? extends V>, List<? extends V>) - Constructor for class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender - Class in org.jgrapht.alg
  Aggregates utilities to extend matching

## L

LARGEST_SATURATION_FIRST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
LinearGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a linear graph of any size.
LinearGraphGenerator(int) - Constructor for class org.jgrapht.generate.LinearGraphGenerator
  Construct a new LinearGraphGenerator.
link(FibonacciHeapNode<T>, FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
  Make node y a child of node x.
ListenableDirectedGraph<V,E> - Class in org.jgrapht.graph
  A directed graph which is also `ListenableGraph`.
ListenableDirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.ListenableDirectedGraph
  Creates a new listenable directed graph.
ListenableDirectedGraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.ListenableDirectedGraph
  Creates a new listenable directed graph.
ListenableDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
  A directed weighted graph which is also `ListenableGraph`.
ListenableDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.ListenableDirectedWeightedGraph
  Creates a new listenable directed weighted graph.
ListenableDirectedWeightedGraph(WeightedGraph<V, E>) - Constructor for class org.jgrapht.graph.ListenableDirectedWeightedGraph
  Creates a new listenable directed weighted graph.
ListenableGraph<V,E> - Interface in org.jgrapht
  A graph that supports listeners on structural change events.
ListenableUndirectedGraph<V,E> - Class in org.jgrapht.graph
  An undirected graph which is also `ListenableGraph`.
ListenableUndirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.ListenableUndirectedGraph
  Creates a new listenable undirected simple graph.
ListenableUndirectedGraph(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.ListenableUndirectedGraph
  Creates a new listenable undirected graph.
ListenableUndirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
  An undirected weighted graph which is also `ListenableGraph`.
ListenableUndirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.ListenableUndirectedWeightedGraph
  Creates a new listenable undirected weighted graph.
ListenableUndirectedWeightedGraph(WeightedGraph<V, E>) - Constructor for class org.jgrapht.graph.ListenableUndirectedWeightedGraph
  Creates a new listenable undirected weighted graph.
longValue() - Method in class org.jgrapht.util.ModifiableInteger

## M

main(String[]) - Static method in class org.jgrapht.demo.CompleteGraphDemo
main(String[]) - Static method in class org.jgrapht.demo.HelloJGraphT
  The starting point for the demo.
main(String[]) - Static method in class org.jgrapht.demo.JGraphAdapterDemo
  An alternative starting point for this demo, to also allow running this applet as an application.
main(String[]) - Static method in class org.jgrapht.demo.JGraphXAdapterDemo
  An alternative starting point for this demo, to also allow running this applet as an application.
main(String[]) - Static method in class org.jgrapht.demo.PerformanceDemo
  The starting point for the demo.
MaskFunctor<V,E> - Interface in org.jgrapht.graph
  A functor interface for masking out vertices and edges of a graph.
MaskSubgraph<V,E> - Class in org.jgrapht.graph
  An unmodifiable subgraph induced by a vertex/edge masking function.
MaskSubgraph(Graph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.MaskSubgraph
  Creates a new induced subgraph.
MatchingAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
  Allows to derive matching from given graph
MathUtil - Class in org.jgrapht.util
  Math Utilities.
MathUtil() - Constructor for class org.jgrapht.util.MathUtil
MatrixExporter<V,E> - Class in org.jgrapht.ext
  Exports a graph to a plain text matrix format, which can be processed by matrix manipulation software, such as MTJ or MATLAB.
MatrixExporter() - Constructor for class org.jgrapht.ext.MatrixExporter
  Creates a new MatrixExporter object.
MAX - Static variable in interface org.jgrapht.util.WeightCombiner
  Maximum weight.
MaximumFlowAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
  Allows to derive maximum-flow from the supplied flow network
MaximumFlowAlgorithm.MaximumFlow<V,E> - Interface in org.jgrapht.alg.interfaces
MaximumFlowAlgorithm.MaximumFlowImpl<V,E> - Class in org.jgrapht.alg.interfaces
MaximumFlowAlgorithm.MaximumFlowImpl(Double, Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
MaximumFlowAlgorithmBase<V,E> - Class in org.jgrapht.alg.flow
  Base class backing algorithms allowing to derive maximum-flow from the supplied flow network
MaximumFlowAlgorithmBase() - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
MaximumWeightBipartiteMatching<V,E> - Class in org.jgrapht.alg
  This class finds a maximum weight matching of a simple undirected weighted bipartite graph.
MaximumWeightBipartiteMatching(WeightedGraph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.MaximumWeightBipartiteMatching
  Creates a new MaximumWeightBipartiteMatching algorithm instance.
mergeVertices(Set<V>, Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
  Merges vertex t into vertex s, summing the weights as required.
min() - Method in class org.jgrapht.util.FibonacciHeap
  Returns the smallest element in the heap.
MIN - Static variable in interface org.jgrapht.util.WeightCombiner
  Minimum weight.
minCut() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
  Return a set of vertices on one side of the cut
minCutWeight() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
  Return the weight of the minimum cut
minimumCutPhase(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
  Implements the MinimumCutPhase function of Stoer and Wagner
MinimumSpanningTree<V,E> - Interface in org.jgrapht.alg.interfaces
  Allows to derive minimum spanning tree from given undirected connected graph.
MinSourceSinkCut<V,E> - Class in org.jgrapht.alg
  Given a directed, weighted graph G(V,E).
MinSourceSinkCut(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.MinSourceSinkCut
MinSourceSinkCut(DirectedGraph<V, E>, double) - Constructor for class org.jgrapht.alg.MinSourceSinkCut
MixedGraphUnion<V,E> - Class in org.jgrapht.graph
MixedGraphUnion(UndirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.MixedGraphUnion
MixedGraphUnion(UndirectedGraph<V, E>, DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.MixedGraphUnion
ModifiableInteger - Class in org.jgrapht.util
  The `ModifiableInteger` class wraps a value of the primitive type `int` in an object, similarly to `Integer`.
ModifiableInteger() - Constructor for class org.jgrapht.util.ModifiableInteger
  Deprecated.
  not really deprecated, just marked so to avoid mistaken use.
ModifiableInteger(int) - Constructor for class org.jgrapht.util.ModifiableInteger
  Constructs a newly allocated `ModifiableInteger` object that represents the specified `int` value.
MULT - Static variable in interface org.jgrapht.util.WeightCombiner
  Multiplication of weights.
Multigraph<V,E> - Class in org.jgrapht.graph
  A multigraph.
Multigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.Multigraph
  Creates a new multigraph.
Multigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.Multigraph
  Creates a new multigraph with the specified edge factory.

## N

NaiveLcaFinder<V,E> - Class in org.jgrapht.alg
NaiveLcaFinder(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.NaiveLcaFinder
  Find the Lowest Common Ancestor of a directed graph.
NATURAL_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
NeighborIndex<V,E> - Class in org.jgrapht.alg
  Maintains a cache of each vertex's neighbors.
NeighborIndex(Graph<V, E>) - Constructor for class org.jgrapht.alg.NeighborIndex
  Creates a neighbor index for the specified undirected graph.
neighborListOf(V) - Method in class org.jgrapht.alg.NeighborIndex
  Returns a list of vertices which are adjacent to a specified vertex.
neighborListOf(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
  Returns a list of vertices that are the neighbors of a specified vertex.
neighborsOf(V) - Method in class org.jgrapht.alg.NeighborIndex
  Returns the set of vertices which are adjacent to a specified vertex.
next() - Method in class org.jgrapht.traverse.CrossComponentIterator
next() - Method in class org.jgrapht.util.PrefetchIterator
nextElement() - Method in class org.jgrapht.util.PrefetchIterator
  1.
nextElement() - Method in interface org.jgrapht.util.PrefetchIterator.NextElementFunctor
  You must implement that NoSuchElementException is thrown on nextElement() if it is out of bound.
nListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
numberOfExpandedNodes - Variable in class org.jgrapht.alg.AStarShortestPath
numOfEdges - Variable in class org.jgrapht.generate.RandomGraphGenerator
numOfVertexes - Variable in class org.jgrapht.generate.RandomGraphGenerator

## O

of(A, B) - Static method in class org.jgrapht.alg.util.Pair
  Creates new pair of elements pulling of the necessity to provide corresponding types of the elements supplied
openList - Variable in class org.jgrapht.alg.AStarShortestPath
ordering1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
ordering2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
org.jgrapht - package org.jgrapht
  The front-end API's interfaces and classes, including `Graph`, `DirectedGraph` and `UndirectedGraph`.
org.jgrapht.alg - package org.jgrapht.alg
  Algorithms provided with JGraphT.
org.jgrapht.alg.cycle - package org.jgrapht.alg.cycle
  Algorithms for enumeration of simple cycles in graphs.
org.jgrapht.alg.flow - package org.jgrapht.alg.flow
org.jgrapht.alg.interfaces - package org.jgrapht.alg.interfaces
org.jgrapht.alg.isomorphism - package org.jgrapht.alg.isomorphism
org.jgrapht.alg.util - package org.jgrapht.alg.util
  Utilities used by JGraphT algorithms.
org.jgrapht.demo - package org.jgrapht.demo
  Demo programs that help to get started with JGraphT.
org.jgrapht.event - package org.jgrapht.event
  Event classes and listener interfaces, used to provide a change notification mechanism on graph modification events.
org.jgrapht.experimental - package org.jgrapht.experimental
  A package that contains experimental work or work-in-progress that is not yet ready to be included in a release.
org.jgrapht.experimental.alg - package org.jgrapht.experimental.alg
org.jgrapht.experimental.alg.color - package org.jgrapht.experimental.alg.color
org.jgrapht.experimental.dag - package org.jgrapht.experimental.dag
org.jgrapht.ext - package org.jgrapht.ext
  Extensions and integration means to other products.
org.jgrapht.generate - package org.jgrapht.generate
  Generators for graphs of various topologies.
org.jgrapht.graph - package org.jgrapht.graph
  Implementations of various graphs.
org.jgrapht.graph.builder - package org.jgrapht.graph.builder
  Various builder for graphs.
org.jgrapht.traverse - package org.jgrapht.traverse
  Graph traversal means.
org.jgrapht.util - package org.jgrapht.util
  Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
outDegreeOf(V) - Method in interface org.jgrapht.DirectedGraph
  Returns the "out degree" of the specified vertex.
outDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
outDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
outDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
outDegreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
outDegreeOf(V) - Method in class org.jgrapht.graph.DirectedGraphUnion
outDegreeOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph
outDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
outDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
outDegreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
outDegreeOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
outgoingEdgesOf(V) - Method in interface org.jgrapht.DirectedGraph
  Returns a set of all edges outgoing from the specified vertex.
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedGraphUnion
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion

## P

Pair<A,B> - Class in org.jgrapht.alg.util
  Generic pair.
  Although the instances of this class are immutable, it is impossible to ensure that the references passed to the constructor will not be modified by the caller.
Pair(A, B) - Constructor for class org.jgrapht.alg.util.Pair
ParanoidGraph<V,E> - Class in org.jgrapht.graph
  ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.
ParanoidGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.ParanoidGraph
PartiteRandomGraphGenerator<V,E> - Class in org.jgrapht.experimental
  PartiteRandomGraphGenerator generates a partite uniform random graph of any size.
PartiteRandomGraphGenerator(int, int, int) - Constructor for class org.jgrapht.experimental.PartiteRandomGraphGenerator
  Construct a new PartiteRandomGraphGenerator for a bipartite graph.
PartiteRandomGraphGenerator(int[], int) - Constructor for class org.jgrapht.experimental.PartiteRandomGraphGenerator
  Construct a new PartiteRandomGraphGenerator for a k-partite graph.
pathExists(V, V) - Method in class org.jgrapht.alg.ConnectivityInspector
  Tests if there is a path from the specified source vertex to the specified target vertices.
PatonCycleBase<V,E> - Class in org.jgrapht.alg.cycle
  Find a cycle base of an undirected graph using the Paton's algorithm.
PatonCycleBase() - Constructor for class org.jgrapht.alg.cycle.PatonCycleBase
  Create a cycle base finder with an unspecified graph.
PatonCycleBase(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.PatonCycleBase
  Create a cycle base finder for the specified graph.
PerformanceDemo - Class in org.jgrapht.demo
  A simple demo to test memory and CPU consumption on a graph with 3 million elements.
PerformanceDemo() - Constructor for class org.jgrapht.demo.PerformanceDemo
predecessorListOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
  Returns the set of vertices which are the predecessors of a specified vertex.
predecessorListOf(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs
  Returns a list of vertices that are the direct predecessors of a specified vertex.
predecessorsOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
  Returns the set of vertices which are the predecessors of a specified vertex.
PrefetchIterator<E> - Class in org.jgrapht.util
  Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time.
PrefetchIterator(PrefetchIterator.NextElementFunctor<E>) - Constructor for class org.jgrapht.util.PrefetchIterator
PrefetchIterator.NextElementFunctor<EE> - Interface in org.jgrapht.util
PrimMinimumSpanningTree<V,E> - Class in org.jgrapht.alg
  An implementation of Prim's algorithm that finds a minimum spanning tree/forest subject to connectivity of the supplied weighted undirected graph.
PrimMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.PrimMinimumSpanningTree
PRINT_EDGE_LABELS - Static variable in class org.jgrapht.ext.GmlExporter
  Option to export only the edge labels.
PRINT_EDGE_VERTEX_LABELS - Static variable in class org.jgrapht.ext.GmlExporter
  Option to export both edge and vertex labels.
PRINT_NO_LABELS - Static variable in class org.jgrapht.ext.GmlExporter
  Option to export no vertex or edge labels.
PRINT_VERTEX_LABELS - Static variable in class org.jgrapht.ext.GmlExporter
  Option to export only the vertex labels.
printSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Print to the standard output all simple cycles without building a list to keep them, thus avoiding high memory consumption when investigating large and much connected graphs.
provideNextVertex() - Method in class org.jgrapht.traverse.BreadthFirstIterator
provideNextVertex() - Method in class org.jgrapht.traverse.ClosestFirstIterator
provideNextVertex() - Method in class org.jgrapht.traverse.CrossComponentIterator
  Returns the vertex to be returned in the following call to the iterator `next` method.
provideNextVertex() - Method in class org.jgrapht.traverse.DepthFirstIterator
provideNextVertex() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
Pseudograph<V,E> - Class in org.jgrapht.graph
  A pseudograph.
Pseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.Pseudograph
  Creates a new pseudograph.
Pseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.Pseudograph
  Creates a new pseudograph with the specified edge factory.
pushFlowThrough(MaximumFlowAlgorithmBase<V, E>.EdgeExtensionBase, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
pushFlowThrough(PushRelabelMaximumFlow<V, E>.EdgeExtension, double) - Method in class org.jgrapht.alg.flow.PushRelabelMaximumFlow
PushRelabelMaximumFlow<V,E> - Class in org.jgrapht.alg.flow
  Push-relabel maximum flow algorithm designed by Andrew V.
PushRelabelMaximumFlow(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.flow.PushRelabelMaximumFlow
PushRelabelMaximumFlow.EdgeExtension - Class in org.jgrapht.alg.flow
PushRelabelMaximumFlow.EdgeExtension() - Constructor for class org.jgrapht.alg.flow.PushRelabelMaximumFlow.EdgeExtension
PushRelabelMaximumFlow.VertexExtension - Class in org.jgrapht.alg.flow
PushRelabelMaximumFlow.VertexExtension() - Constructor for class org.jgrapht.alg.flow.PushRelabelMaximumFlow.VertexExtension
putSeenData(V, D) - Method in class org.jgrapht.traverse.CrossComponentIterator
  Stores iterator-dependent data for a vertex that has been seen.
putVertex(Integer, V) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
  add a vertex at the given topological index.
putVertex(Integer, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap

## R

RandomGraphGenerator<V,E> - Class in org.jgrapht.generate
  This Generator creates a random-topology graph of a specified number of vertexes and edges.
RandomGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.RandomGraphGenerator
RandomGraphGenerator(int, int, long) - Constructor for class org.jgrapht.generate.RandomGraphGenerator
RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE> - Class in org.jgrapht.generate
  Default implementation of the EdgeTopologyFactory interface.
RandomGraphGenerator.DefaultEdgeTopologyFactory() - Constructor for class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
RandomGraphGenerator.EdgeTopologyFactory<VV,EE> - Interface in org.jgrapht.generate
  This class is used to generate the edge topology for a graph.
RandomGraphHelper - Class in org.jgrapht.experimental
  UniformRandomGraphGenerator generates a uniform random graph of any size.
randomizer - Variable in class org.jgrapht.generate.RandomGraphGenerator
range(int, int) - Static method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
read(String, AbstractBaseGraph<V, E>) - Method in class org.jgrapht.ext.DOTImporter
  Read a dot formatted string and populate the provided graph.
reduce(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.TransitiveReduction
  This method will remove all transitive edges from the graph passed as input parameter.
remove() - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Unsupported.
remove() - Method in interface org.jgrapht.traverse.GraphIterator
  Unsupported.
remove() - Method in class org.jgrapht.util.PrefetchIterator
  Always throws UnsupportedOperationException.
removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.experimental.GraphSquare
removeAllEdges(V, V) - Method in class org.jgrapht.experimental.GraphSquare
removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.AbstractGraph
removeAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractGraph
removeAllEdges(E[]) - Method in class org.jgrapht.graph.AbstractGraph
  Removes all the edges in this graph that are also contained in the specified edge array.
removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.MaskSubgraph
removeAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
removeAllEdges(Collection<? extends E>) - Method in interface org.jgrapht.Graph
  Removes all the edges in this graph that are also contained in the specified edge collection.
removeAllEdges(V, V) - Method in interface org.jgrapht.Graph
  Removes all the edges going from the specified source vertex to the specified target vertex, and returns a set of all removed edges.
removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeAllEdges(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
removeAllVertices() - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
  remove all vertices from the topological ordering
removeAllVertices() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.experimental.GraphSquare
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.AbstractGraph
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.MaskSubgraph
removeAllVertices(Collection<? extends V>) - Method in interface org.jgrapht.Graph
  Removes all the vertices in this graph that are also contained in the specified vertex collection.
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeEdge(E) - Method in class org.jgrapht.experimental.GraphSquare
removeEdge(V, V) - Method in class org.jgrapht.experimental.GraphSquare
removeEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
removeEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
removeEdge(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Removes an edge going from source vertex to target vertex from the graph being built, if such vertices and such edge exist in the graph.
removeEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
removeEdge(E) - Method in class org.jgrapht.graph.DefaultListenableGraph
removeEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
removeEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
removeEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
removeEdge(V, V) - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
removeEdge(E) - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
removeEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
removeEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
removeEdge(V, V) - Method in interface org.jgrapht.Graph
  Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
removeEdge(E) - Method in interface org.jgrapht.Graph
  Removes the specified edge from the graph.
removeEdge(E) - Method in class org.jgrapht.graph.Subgraph
removeEdge(V, V) - Method in class org.jgrapht.graph.Subgraph
removeEdge(E) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeEdge(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
removeGraphListener(GraphListener<V, E>) - Method in class org.jgrapht.graph.DefaultListenableGraph
removeGraphListener(GraphListener<V, E>) - Method in interface org.jgrapht.ListenableGraph
  Removes the specified graph listener from this graph, if present.
removeIncomingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
  .
removeMin() - Method in class org.jgrapht.util.FibonacciHeap
  Removes the smallest element from the heap.
removeOutgoingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
  .
removeTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Removes the specified traversal listener from this iterator.
removeTraversalListener(TraversalListener<V, E>) - Method in interface org.jgrapht.traverse.GraphIterator
  Removes the specified traversal listener from this iterator.
removeVertex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
removeVertex(V) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
  remove the given vertex from the topological ordering
removeVertex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
removeVertex(V) - Method in class org.jgrapht.experimental.GraphSquare
removeVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
removeVertex(V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Removes `vertex` from the graph being built, if such vertex exist in graph.
removeVertex(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
removeVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
removeVertex(V) - Method in class org.jgrapht.graph.GraphUnion
  Throws `UnsupportedOperationException`, because `GraphUnion` is read-only.
removeVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
removeVertex(V) - Method in interface org.jgrapht.Graph
  Removes the specified vertex from this graph including all its touching edges if present.
removeVertex(V) - Method in class org.jgrapht.graph.Subgraph
removeVertex(V) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeVertexSetListener(VertexSetListener<V>) - Method in class org.jgrapht.graph.DefaultListenableGraph
removeVertexSetListener(VertexSetListener<V>) - Method in interface org.jgrapht.ListenableGraph
  Removes the specified vertex set listener from this graph, if present.
removeVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
  Removes each vertex of `vertices` from the graph being built, if such vertices exist in graph.
replaceVertex(Object, Object) - Static method in class org.jgrapht.demo.CompleteGraphDemo
RingGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a ring graph of any size.
RingGraphGenerator(int) - Constructor for class org.jgrapht.generate.RingGraphGenerator
  Construct a new RingGraphGenerator.

## S

ScaleFreeGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates directed or undirected scale-free network of any size.
ScaleFreeGraphGenerator(int) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
  Constructs a new `ScaleFreeGraphGenerator`.
ScaleFreeGraphGenerator(int, long) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
  Constructs a new `ScaleFreeGraphGenerator` using fixed `seed` for the random generator.
second - Variable in class org.jgrapht.alg.util.Pair
second(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
SECOND - Static variable in interface org.jgrapht.util.WeightCombiner
  Second weight.
self() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
self() - Method in class org.jgrapht.graph.builder.DirectedGraphBuilder
self() - Method in class org.jgrapht.graph.builder.DirectedWeightedGraphBuilder
self() - Method in class org.jgrapht.graph.builder.UndirectedGraphBuilder
self() - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilder
SENTINEL - Static variable in class org.jgrapht.traverse.DepthFirstIterator
  Sentinel object.
setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.AbstractGraphIterator
  Sets the cross component traversal flag - indicates whether to traverse the graph across connected components.
setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.ClosestFirstIterator
setDefaultEdgeAttributes(AttributeMap) - Method in class org.jgrapht.ext.JGraphModelAdapter
  Sets the default edge attributes used for creating new JGraph edges.
setDefaultVertexAttributes(AttributeMap) - Method in class org.jgrapht.ext.JGraphModelAdapter
  Sets the default vertex attributes used for creating new JGraph vertices.
setEdgeSetFactory(EdgeSetFactory<V, E>) - Method in class org.jgrapht.graph.AbstractBaseGraph
  Set the `EdgeSetFactory` to use for this graph.
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AbstractBaseGraph
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsWeightedGraph
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.GraphDelegator
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.Subgraph
setEdgeWeight(E, double) - Method in interface org.jgrapht.WeightedGraph
  Assigns a weight to an edge.
setGraph(DirectedGraph<V, E>) - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
  Sets the graph on which the simple cycle search algorithm is executed by this object.
setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
  Sets the graph on which the simple cycle search algorithm is executed by this object.
setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
  Sets the graph on which the simple cycle search algorithm is executed by this object.
setGraph(UndirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.PatonCycleBase
  Sets the graph on which the cycle base search algorithm is executed by this object.
setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
  Sets the graph on which the simple cycle search algorithm is executed by this object.
setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
  Sets the graph on which the simple cycle search algorithm is executed by this object.
setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
  Sets the graph on which the simple cycle search algorithm is executed by this object.
setGraph(UndirectedGraph<V, E>) - Method in interface org.jgrapht.alg.cycle.UndirectedCycleBase
  Sets the graph on which the cycle base search algorithm is executed by this object.
setPrintLabels(Integer) - Method in class org.jgrapht.ext.GmlExporter
  Set whether to export the vertex and edge labels.
setReuseEvents(boolean) - Method in class org.jgrapht.graph.DefaultListenableGraph
  If the `reuseEvents` flag is set to `true` this class will reuse previously fired events and will not create a new object for each event.
setReuseEvents(boolean) - Method in class org.jgrapht.traverse.AbstractGraphIterator
setReuseEvents(boolean) - Method in interface org.jgrapht.traverse.GraphIterator
  Sets a value the `reuseEvents` flag.
setValue(int) - Method in class org.jgrapht.util.ModifiableInteger
  Sets a new value for this modifiable integer.
setVisited(int) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited
  mark the given topological index as visited
setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
shortestDistance(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
  Get the length of a shortest path.
SimpleDirectedGraph<V,E> - Class in org.jgrapht.graph
  A simple directed graph.
SimpleDirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleDirectedGraph
  Creates a new simple directed graph.
SimpleDirectedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleDirectedGraph
  Creates a new simple directed graph with the specified edge factory.
SimpleDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
  A simple directed weighted graph.
SimpleDirectedWeightedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
  Creates a new simple directed weighted graph with the specified edge factory.
SimpleDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
  Creates a new simple directed weighted graph.
SimpleGraph<V,E> - Class in org.jgrapht.graph
  A simple graph.
SimpleGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleGraph
  Creates a new simple graph with the specified edge factory.
SimpleGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleGraph
  Creates a new simple graph.
SimpleGraphPath<V,E> - Class in org.jgrapht.graph
  A vertex-based representation of a simple path.
SimpleGraphPath(SimpleGraph<V, E>, List<V>, double) - Constructor for class org.jgrapht.graph.SimpleGraphPath
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate
SimpleWeightedBipartiteGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
SimpleWeightedGraph<V,E> - Class in org.jgrapht.graph
  A simple weighted graph.
SimpleWeightedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
  Creates a new simple weighted graph with the specified edge factory.
SimpleWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
  Creates a new simple weighted graph.
SimpleWeightedGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate
SimpleWeightedGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
size() - Method in class org.jgrapht.util.FibonacciHeap
  Returns the size of the heap which is measured in the number of elements contained in the heap.
SMALLEST_DEGREE_LAST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
StarGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a star graph of any size.
StarGraphGenerator(int) - Constructor for class org.jgrapht.generate.StarGraphGenerator
  Creates a new StarGraphGenerator object.
start - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
START_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
  Role for the first vertex generated.
startVertex - Variable in class org.jgrapht.alg.BellmanFordShortestPath
  Start vertex.
StoerWagnerMinimumCut<V,E> - Class in org.jgrapht.alg
  Implements the Stoer and Wagner minimum cut algorithm.
StoerWagnerMinimumCut(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut
  Will compute the minimum cut in graph.
StoerWagnerMinimumCut.VertexAndWeight - Class in org.jgrapht.alg
  Class for weighted vertices
StoerWagnerMinimumCut.VertexAndWeight(Set<V>, double, boolean) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
StringEdgeNameProvider<E> - Class in org.jgrapht.ext
  Generates edge names by invoking `Object.toString()` on them.
StringEdgeNameProvider() - Constructor for class org.jgrapht.ext.StringEdgeNameProvider
StringNameProvider<V> - Class in org.jgrapht.ext
  Generates vertex names by invoking `Object.toString()` on them.
StringNameProvider() - Constructor for class org.jgrapht.ext.StringNameProvider
StrongConnectivityAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
  An interface to the StrongConnectivityInspector algorithm classes.
StrongConnectivityInspector<V,E> - Class in org.jgrapht.alg
  Deprecated.
  Use `KosarajuStrongConnectivityInspector` instead.
StrongConnectivityInspector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.StrongConnectivityInspector
  Deprecated.
  The constructor of the StrongConnectivityAlgorithm class.
stronglyConnectedSets() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector
  Computes a `List` of `Set`s, where each set contains vertices which together form a strongly connected component within the given graph.
stronglyConnectedSets() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
  Computes a `List` of `Set`s, where each set contains vertices which together form a strongly connected component within the given graph.
stronglyConnectedSets() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
  Computes a `List` of `Set`s, where each set contains vertices which together form a strongly connected component within the given graph.
stronglyConnectedSets() - Method in class org.jgrapht.alg.StrongConnectivityInspector
  Deprecated.
  Computes a `List` of `Set`s, where each set contains vertices which together form a strongly connected component within the given graph.
stronglyConnectedSubgraphs() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector
  Computes a list of `DirectedSubgraph`s of the given graph.
stronglyConnectedSubgraphs() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
  Computes a list of `DirectedSubgraph`s of the given graph.
stronglyConnectedSubgraphs() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
  Computes a list of `DirectedSubgraph`s of the given graph.
stronglyConnectedSubgraphs() - Method in class org.jgrapht.alg.StrongConnectivityInspector
  Deprecated.
  Computes a list of `DirectedSubgraph`s of the given graph.
Subgraph<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph
  A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.
Subgraph(G, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.Subgraph
  Creates a new Subgraph.
Subgraph(G, Set<V>) - Constructor for class org.jgrapht.graph.Subgraph
  Creates a new induced Subgraph.
successorListOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
  Returns the set of vertices which are the successors of a specified vertex.
successorListOf(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs
  Returns a list of vertices that are the direct successors of a specified vertex.
successorsOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
  Returns the set of vertices which are the successors of a specified vertex.
SUM - Static variable in interface org.jgrapht.util.WeightCombiner
  Sum of weights.
SzwarcfiterLauerSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
  Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's algorithm.
SzwarcfiterLauerSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
  Create a simple cycle finder with an unspecified graph.
SzwarcfiterLauerSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
  Create a simple cycle finder for the specified graph.

## T

TarjanLowestCommonAncestor<V,E> - Class in org.jgrapht.alg
  Used to calculate Tarjan's Lowest Common Ancestors Algorithm
TarjanLowestCommonAncestor(Graph<V, E>) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor
  Create an instance with a reference to the graph that we will find LCAs for
TarjanLowestCommonAncestor.LcaRequestResponse<V> - Class in org.jgrapht.alg
TarjanLowestCommonAncestor.LcaRequestResponse(V, V) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
TarjanSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
  Find all simple cycles of a directed graph using the Tarjan's algorithm.
TarjanSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.TarjanSimpleCycles
  Create a simple cycle finder with an unspecified graph.
TarjanSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.TarjanSimpleCycles
  Create a simple cycle finder for the specified graph.
testIncidence(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
  Tests whether an edge is incident to a vertex.
TiernanSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
  Find all simple cycles of a directed graph using the Tiernan's algorithm.
TiernanSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.TiernanSimpleCycles
  Create a simple cycle finder with an unspecified graph.
TiernanSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.TiernanSimpleCycles
  Create a simple cycle finder for the specified graph.
toInteger() - Method in class org.jgrapht.util.ModifiableInteger
  Returns an `Integer` object representing this `ModifiableInteger`'s value.
TopologicalOrderIterator<V,E> - Class in org.jgrapht.traverse
  Implements topological order traversal for a directed acyclic graph.
TopologicalOrderIterator(DirectedGraph<V, E>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
  Creates a new topological order iterator over the directed graph specified, with arbitrary tie-breaking in case of partial order.
TopologicalOrderIterator(DirectedGraph<V, E>, Queue<V>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
  Creates a new topological order iterator over the directed graph specified, with a user-supplied queue implementation to allow customized control over tie-breaking in case of partial order.
toString() - Method in class org.jgrapht.alg.flow.PushRelabelMaximumFlow.EdgeExtension
toString() - Method in class org.jgrapht.alg.flow.PushRelabelMaximumFlow.VertexExtension
toString() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
toString() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
toString() - Method in class org.jgrapht.graph.AbstractGraph
  Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
toString() - Method in class org.jgrapht.graph.AsUndirectedGraph
toString() - Method in class org.jgrapht.graph.DefaultEdge
toString() - Method in class org.jgrapht.graph.EdgeReversedGraph
toString() - Method in class org.jgrapht.graph.GraphDelegator
toString() - Method in class org.jgrapht.graph.GraphPathImpl
toString() - Method in class org.jgrapht.util.FibonacciHeap
  Creates a String representation of this Fibonacci heap.
toString() - Method in class org.jgrapht.util.FibonacciHeapNode
  Return the string representation of this object.
toString() - Method in class org.jgrapht.util.ModifiableInteger
  Returns a `String` object representing this `ModifiableInteger`'s value.
toString() - Method in class org.jgrapht.util.VertexPair
toStringFromSets(Collection<? extends V>, Collection<? extends E>, boolean) - Method in class org.jgrapht.graph.AbstractGraph
  Helper for subclass implementations of toString( ).
TransitiveClosure - Class in org.jgrapht.alg
  Constructs the transitive closure of the input graph.
TransitiveReduction - Class in org.jgrapht.alg
  An implementation of Harry Hsu's transitive reduction algorithm.
TraversalListener<V,E> - Interface in org.jgrapht.event
  A listener on graph iterator or on a graph traverser.
TraversalListenerAdapter<V,E> - Class in org.jgrapht.event
  An empty do-nothing implementation of the `TraversalListener` interface used for subclasses.
TraversalListenerAdapter() - Constructor for class org.jgrapht.event.TraversalListenerAdapter
type - Variable in class org.jgrapht.event.GraphChangeEvent
  The type of graph change this event indicates.
TypeUtil<T> - Class in org.jgrapht.util
  TypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay warning-free.
TypeUtil() - Constructor for class org.jgrapht.util.TypeUtil

## U

uncheckedCast(Object, TypeUtil<T>) - Static method in class org.jgrapht.util.TypeUtil
  Casts an object to a type.
UndirectedCycleBase<V,E> - Interface in org.jgrapht.alg.cycle
  A common interface for classes implementing algorithms for finding a cycle base of an undirected graph.
undirectedGraph(Graph<V, E>) - Static method in class org.jgrapht.Graphs
  Returns an undirected view of the specified graph.
UndirectedGraph<V,E> - Interface in org.jgrapht
  A graph whose all edges are undirected.
UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>> - Class in org.jgrapht.graph.builder
  A builder class for `Graph`.
UndirectedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.UndirectedGraphBuilder
  Creates a builder based on `baseGraph`.
UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>> - Class in org.jgrapht.graph.builder
  Base class for `UndirectedGraphBuilder` for extending.
UndirectedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.UndirectedGraphBuilderBase
  Creates a builder based on `baseGraph`.
UndirectedGraphUnion<V,E> - Class in org.jgrapht.graph
UndirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph
  An undirected graph that is a `MaskSubgraph` on another graph.
UndirectedMaskSubgraph(UndirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.UndirectedMaskSubgraph
UndirectedSubgraph<V,E> - Class in org.jgrapht.graph
  An undirected graph that is a subgraph on other graph.
UndirectedSubgraph(UndirectedGraph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph
  Creates a new undirected subgraph.
UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>> - Class in org.jgrapht.graph.builder
  A builder class for undirected weighted graphs.
UndirectedWeightedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilder
  Creates a builder based on `baseGraph`.
UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>> - Class in org.jgrapht.graph.builder
  Base class for `UndirectedWeightedGraphBuilder` for extending.
UndirectedWeightedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase
  Creates a builder based on `baseGraph`.
UndirectedWeightedSubgraph<V,E> - Class in org.jgrapht.graph
  An undirected weighted graph that is a subgraph on other graph.
UndirectedWeightedSubgraph(WeightedGraph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph
  Creates a new undirected weighted subgraph.
UniformRandomGraphGenerator - Class in org.jgrapht.experimental
  UniformRandomGraphGenerator generates a uniform random graph of any size.
UniformRandomGraphGenerator(int, int) - Constructor for class org.jgrapht.experimental.UniformRandomGraphGenerator
  Construct a new UniformRandomGraphGenerator.
union(T, T) - Method in class org.jgrapht.alg.util.UnionFind
  Merges the sets which contain element1 and element2.
union(FibonacciHeap<T>, FibonacciHeap<T>) - Static method in class org.jgrapht.util.FibonacciHeap
  Joins two Fibonacci heaps into a new one.
UnionFind<T> - Class in org.jgrapht.alg.util
  An implementation of Union Find data structure.
UnionFind(Set<T>) - Constructor for class org.jgrapht.alg.util.UnionFind
  Creates a UnionFind instance with all of the elements of elements in seperate sets.
UnmodifiableDirectedGraph<V,E> - Class in org.jgrapht.graph
  A directed graph that cannot be modified.
UnmodifiableDirectedGraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.UnmodifiableDirectedGraph
  Creates a new unmodifiable directed graph based on the specified backing graph.
UnmodifiableGraph<V,E> - Class in org.jgrapht.graph
  An unmodifiable view of the backing graph specified in the constructor.
UnmodifiableGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.UnmodifiableGraph
  Creates a new unmodifiable graph based on the specified backing graph.
UnmodifiableUndirectedGraph<V,E> - Class in org.jgrapht.graph
  An undirected graph that cannot be modified.
UnmodifiableUndirectedGraph(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.UnmodifiableUndirectedGraph
  Creates a new unmodifiable undirected graph based on the specified backing graph.
updateVertex(V, Map<String, String>) - Method in interface org.jgrapht.ext.VertexUpdater
  Update vertex with the extra attributes.

## V

value - Variable in class org.jgrapht.util.ModifiableInteger
  The int value represented by this `ModifiableInteger`.
valueOf(String) - Static method in enum org.jgrapht.traverse.CrossComponentIterator.VisitColor
  Returns the enum constant of this type with the specified name.
values() - Static method in enum org.jgrapht.traverse.CrossComponentIterator.VisitColor
  Returns an array containing the constants of this enum type, in the order they are declared.
vertex - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
vertex - Variable in class org.jgrapht.event.GraphVertexChangeEvent
  The vertex that this event is related to.
vertex - Variable in class org.jgrapht.event.VertexTraversalEvent
  The traversed vertex.
VERTEX_ADDED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
  Vertex added event.
VERTEX_REMOVED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
  Vertex removed event.
vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.ConnectivityInspector
vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.DirectedNeighborIndex
vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.NeighborIndex
vertexAdded(GraphVertexChangeEvent<V>) - Method in interface org.jgrapht.event.VertexSetListener
  Notifies that a vertex has been added to the graph.
vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.ext.JGraphXAdapter
vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
VertexCovers - Class in org.jgrapht.alg
  Algorithms to find a vertex cover for a graph.
VertexCovers() - Constructor for class org.jgrapht.alg.VertexCovers
VertexDegreeComparator<V,E> - Class in org.jgrapht.alg.util
  Compares two vertices based on their degree.
VertexDegreeComparator(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.util.VertexDegreeComparator
  Creates a comparator for comparing the degrees of vertices in the specified graph.
VertexDegreeComparator(UndirectedGraph<V, E>, boolean) - Constructor for class org.jgrapht.alg.util.VertexDegreeComparator
  Creates a comparator for comparing the degrees of vertices in the specified graph.
vertexExtended(V) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
VertexFactory<V> - Interface in org.jgrapht
  A vertex factory used by graph algorithms for creating new vertices.
vertexFinished(VertexTraversalEvent<V>) - Method in interface org.jgrapht.event.TraversalListener
  Called to inform the listener that the specified vertex have been finished during the graph traversal.
vertexFinished(VertexTraversalEvent<V>) - Method in class org.jgrapht.event.TraversalListenerAdapter
vertexMapDirected - Variable in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
VertexNameProvider<V> - Interface in org.jgrapht.ext
  Assigns a display name for each of the graph vertices.
VertexPair<V> - Class in org.jgrapht.util
  Representation of a pair of vertices; to be replaced by Pair<V,V> if Sun ever gets around to adding Pair to java.util.
VertexPair(V, V) - Constructor for class org.jgrapht.util.VertexPair
VertexProvider<V> - Interface in org.jgrapht.ext
  Creates a Vertex of type V
vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.ConnectivityInspector
vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.DirectedNeighborIndex
vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.NeighborIndex
vertexRemoved(GraphVertexChangeEvent<V>) - Method in interface org.jgrapht.event.VertexSetListener
  Notifies that a vertex has been removed from the graph.
vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.ext.JGraphXAdapter
vertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph
vertexSet() - Method in class org.jgrapht.graph.GraphDelegator
vertexSet() - Method in class org.jgrapht.graph.GraphUnion
vertexSet() - Method in class org.jgrapht.graph.MaskSubgraph
vertexSet() - Method in class org.jgrapht.graph.Subgraph
vertexSet() - Method in interface org.jgrapht.Graph
  Returns a set of the vertices contained in this graph.
VertexSetListener<V> - Interface in org.jgrapht.event
  A listener that is notified when the graph's vertex set changes.
vertexToHeapNodeMap - Variable in class org.jgrapht.alg.AStarShortestPath
VertexTraversalEvent<V> - Class in org.jgrapht.event
  A traversal event for a graph vertex.
VertexTraversalEvent(Object, V) - Constructor for class org.jgrapht.event.VertexTraversalEvent
  Creates a new VertexTraversalEvent.
vertexTraversed(VertexTraversalEvent<V>) - Method in interface org.jgrapht.event.TraversalListener
  Called to inform the listener that the specified vertex have been visited during the graph traversal.
vertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.event.TraversalListenerAdapter
VertexUpdater<V> - Interface in org.jgrapht.ext
  Type to handle updates to a vertex when an import gets more information about a vertex after it has been created.
vertexWeight(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
  Compute the sum of the weights entering a vertex
vertices - Variable in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
vertices(List<V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
VF2AbstractIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
  This implementation of the VF2 algorithm does not support graphs with multiple edges.
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
VF2GraphIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
  This is an implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
  This implementation of the VF2 algorithm does not support graphs with multiple edges.
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
VF2SubgraphIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
  This is an implementation of the VF2 algorithm using its feature of detecting subgraph isomorphism between two graphs as described in Cordella et al.
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
  This implementation of the VF2 algorithm does not support graphs with multiple edges.
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
VisioExporter<V,E> - Class in org.jgrapht.ext
  Exports a graph to a csv format that can be imported into MS Visio.
VisioExporter(VertexNameProvider<V>) - Constructor for class org.jgrapht.ext.VisioExporter
  Creates a new VisioExporter object with the specified naming policy.
VisioExporter() - Constructor for class org.jgrapht.ext.VisioExporter
  Creates a new VisioExporter object.

## W

weight - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
WeightCombiner - Interface in org.jgrapht.util
  Binary operator for edge weights.
WeightedGraph<V,E> - Interface in org.jgrapht
  An interface for a graph whose edges have non-uniform weights.
WeightedGraphGenerator<V,E> - Class in org.jgrapht.generate
WeightedGraphGenerator() - Constructor for class org.jgrapht.generate.WeightedGraphGenerator
WeightedGraphGeneratorAdapter<V,E,T> - Class in org.jgrapht.generate
  WeightedGraphGenerator defines an interface for generating graph structures having edges weighted with real values.
WeightedGraphGeneratorAdapter() - Constructor for class org.jgrapht.generate.WeightedGraphGeneratorAdapter
WeightedMatchingAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
  Allows to derive weighted matching from general graph
WeightedMultigraph<V,E> - Class in org.jgrapht.graph
  A weighted multigraph.
WeightedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.WeightedMultigraph
  Creates a new weighted multigraph with the specified edge factory.
WeightedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.WeightedMultigraph
  Creates a new weighted multigraph.
WeightedPseudograph<V,E> - Class in org.jgrapht.graph
  A weighted pseudograph.
WeightedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.WeightedPseudograph
  Creates a new weighted pseudograph with the specified edge factory.
WeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.WeightedPseudograph
  Creates a new weighted pseudograph.
weightMap - Variable in class org.jgrapht.graph.AsWeightedGraph
weights - Variable in class org.jgrapht.generate.WeightedGraphGenerator
weights(double[][]) - Method in class org.jgrapht.generate.WeightedGraphGenerator
weights - Variable in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
weights(double[][]) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
WheelGraphGenerator<V,E> - Class in org.jgrapht.generate
  Generates a wheel graph of any size.
WheelGraphGenerator(int) - Constructor for class org.jgrapht.generate.WheelGraphGenerator
  Creates a new WheelGraphGenerator object.
WheelGraphGenerator(int, boolean) - Constructor for class org.jgrapht.generate.WheelGraphGenerator
  Construct a new WheelGraphGenerator.

## _

_neighbors - Variable in class org.jgrapht.experimental.alg.IntArrayGraphAlgorithm
_vertexToPos - Variable in class org.jgrapht.experimental.alg.IntArrayGraphAlgorithm
_vertices - Variable in class org.jgrapht.experimental.alg.IntArrayGraphAlgorithm

A B C D E F G H I J K L M N O P R S T U V W _

Copyright © 2016. All rights reserved.