Index (JGraphT : a free Java graph library)

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 - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
abstractBaseGraph - Variable in class org.jgrapht.graph.specifics.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(List<Integer>, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover: Add multiple vertices in the vertex cover.
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: 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 class org.jgrapht.experimental.GraphSquare: 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.AbstractBaseGraph: 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 class org.jgrapht.graph.AbstractBaseGraph: Adds the specified edge to this graph, going from the source vertex to the target vertex.
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, E) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder: Adds the specified 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, E, double) - Method in class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase: Adds the specified 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, E, double) - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase: Adds the specified 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: 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 class org.jgrapht.graph.GraphDelegator: 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.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: 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 class org.jgrapht.graph.MaskSubgraph: Adds the specified edge to this graph, going from the source vertex to the target vertex.
addEdge(V, V, E) - Method in class org.jgrapht.graph.ParanoidGraph: Adds the specified edge to this graph, going from the source vertex to the target vertex.
addEdge(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer: Add a vertex edge
addEdge(V, V) - Method in class org.jgrapht.graph.Subgraph: Add an edge to the subgraph.
addEdge(V, V, E) - Method in class org.jgrapht.graph.Subgraph: 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.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.
addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Adds the specified edge to the edge containers of its source and target vertices.
addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics: Adds the specified edge to the edge containers of its source and target vertices.
addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics: Adds the specified edge to the edge containers of its source and target vertices.
addEdgeToTouchingVertices(E) - Method in interface org.jgrapht.graph.specifics.Specifics: Adds the specified edge to the edge containers of its source and target vertices.
addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Adds the specified edge to the edge containers of its source and target vertices.
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(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer: Add an incoming edge.
addIncomingEdges(DirectedGraph<V, E>, V, Iterable<V>) - Static method in class org.jgrapht.Graphs: Add edges from multiple source vertices to one target vertex.
addNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex: Add a neighbor.
addOutgoingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer: Add an outgoing edge.
addOutgoingEdges(DirectedGraph<V, E>, V, Iterable<V>) - Static method in class org.jgrapht.Graphs: Add edges from one source vertex to multiple target vertices.
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(int, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover: Add a vertex in the vertex cover.
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: Adds the specified vertex to this graph if not already present.
addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph: Adds the specified vertex to this graph if not already present.
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: Adds the specified vertex to this graph if not already present.
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: Adds the specified vertex to this graph if not already present.
addVertex(V) - Method in class org.jgrapht.graph.ParanoidGraph: Adds the specified vertex to this graph if not already present.
addVertex(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Adds a vertex.
addVertex(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Adds a vertex.
addVertex(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Adds a vertex.
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(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: Deprecated.
admissibleHeuristic - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
AllDirectedPaths<V,E> - Class in org.jgrapht.alg: Deprecated.
In favor of AllDirectedPaths.
AllDirectedPaths(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.AllDirectedPaths: Deprecated.

Create a new instance
AllDirectedPaths<V,E> - Class in org.jgrapht.alg.shortestpath: 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.shortestpath.AllDirectedPaths: Create a new instance
ALTAdmissibleHeuristic<V,E> - Class in org.jgrapht.alg.shortestpath: An admissible heuristic for the A* algorithm using a set of landmarks and the triangle inequality.
ALTAdmissibleHeuristic(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic: Constructs a new AStarAdmissibleHeuristic using a set of landmarks.
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: An interface for an approximation algorithm.
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: Constructs a new empty set
ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet: Constructs a set containing the elements of the specified collection.
ArrayUnenforcedSet(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet: Constructs an empty set with the specified initial capacity.
ArrayUnenforcedSetEdgeSetFactory<V,E> - Class in org.jgrapht.graph.specifics: An edge set factory which creates ArrayUnenforcedSet of size 1, suitable for small degree vertices.
ArrayUnenforcedSetEdgeSetFactory() - Constructor for class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
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: Deprecated.
in favor of AStarShortestPath
AStarShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.AStarShortestPath: Deprecated.

Create a new instance of the A* shortest path algorithm.
AStarShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath: A* shortest path.
AStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.AStarShortestPath: Create a new instance of the A* shortest path algorithm.
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

BarYehudaEvenTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover: Implementation of the 2-opt algorithm for a minimum weighted vertex cover by R.
BarYehudaEvenTwoApproxVCImpl() - Constructor for class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
base - Variable in class org.jgrapht.graph.MaskSubgraph
base - Variable in class org.jgrapht.graph.Subgraph
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: Deprecated.
in favor of BellmanFordShortestPath
BellmanFordShortestPath(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.BellmanFordShortestPath: Deprecated.

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: Deprecated.

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: Deprecated.

Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath: The Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Construct a new instance of the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Construct a new instance of the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V, E>, int, double) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Construct a new instance of 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.
BidirectionalDijkstraShortestPath<V,E> - Class in org.jgrapht.alg: Deprecated.
in favor of BidirectionalDijkstraShortestPath
BidirectionalDijkstraShortestPath(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath: Deprecated.

Creates the instance and executes the bidirectional Dijkstra shortest path algorithm.
BidirectionalDijkstraShortestPath(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath: Deprecated.

Creates the instance and executes the bidirectional Dijkstra shortest path algorithm.
BidirectionalDijkstraShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath: A bidirectional version of Dijkstra's algorithm.
BidirectionalDijkstraShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath: Constructs a new instance for a specified graph.
BidirectionalDijkstraShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath: Constructs a new instance for a specified graph.
BitSetCover(int, int) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover: Construct a new empty vertex cover as a BitSet.
BitSetCover(RecursiveExactVCImpl<V, E>.BitSetCover) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover: Copy constructor
bitSetCover - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
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.
BoruvkaMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning: Borůvka's algorithm for the computation of a minimum spanning tree.
BoruvkaMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree: Construct a new instance of the algorithm.
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: Brown graph coloring algorithm.
BrownBacktrackColoring(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.color.BrownBacktrackColoring: Construct a new Brown backtracking algorithm.
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: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedMultigraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedMultigraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedPseudograph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedPseudograph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.Multigraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.Multigraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.Pseudograph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.Pseudograph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleGraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleGraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedMultigraph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.WeightedMultigraph: Create a builder for this kind of graph.
builder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedPseudograph: Create a builder for this kind of graph.
builder(EdgeFactory<V, E>) - Static method in class org.jgrapht.graph.WeightedPseudograph: Create a builder for this kind of graph.
buildMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation: Deprecated.

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 interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm: Deprecated.
use MaximumFlowAlgorithm.getMaximumFlow(Object, Object) instead
buildUnmodifiable() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder: Build an unmodifiable version graph.
buildUnmodifiable() - Method in class org.jgrapht.graph.builder.DirectedGraphBuilderBase: Build an unmodifiable version graph.
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.flow.EdmondsKarpMFImpl: Sets current source to source, current sink to sink, then calculates maximum flow from source to sink.
calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Returns the Maximum flow between source and sink.
calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Returns the Maximum flow between source and sink.
calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl: Sets current source to source, current sink to sink, then calculates maximum flow from source to sink.
calculateMaximumFlow(V, V) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm: Sets current source to source, current sink to sink, then calculates maximum flow from source to sink.
calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
calculateMinCut() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Calculates the minimum cut in the graph, that is, the minimum cut over all s-t pairs.
calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
calculateMinCut(Set<V>, boolean) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Calculates the minimum odd cut.
calculateMinCut(V, V) - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm: Computes a minimum capacity s-t cut.
calculateSourcePartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Calculate the set of reachable vertices from s in the residual graph.
cameFrom - Variable in class org.jgrapht.alg.AStarShortestPath: Deprecated.
cameFrom - Variable in class org.jgrapht.alg.shortestpath.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
ClarksonTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover: Implementation of the 2-opt algorithm for a minimum weighted vertex cover by Clarkson, Kenneth L.
ClarksonTwoApproxVCImpl() - Constructor for class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
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: Create a new class based edge factory.
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: Create a new class based vertex factory.
clear() - Method in class org.jgrapht.ext.IntegerComponentNameProvider: Clears all cached identifiers, and resets the unique identifier counter.
clear() - Method in class org.jgrapht.ext.IntegerEdgeNameProvider: Deprecated.

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
closeDirectedAcyclicGraph(DirectedAcyclicGraph<V, E>) - Method in class org.jgrapht.alg.TransitiveClosure: Computes the transitive closure of a directed acyclic graph in O(n*m)
closedList - Variable in class org.jgrapht.alg.AStarShortestPath: Deprecated.
closedList - Variable in class org.jgrapht.alg.shortestpath.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.
comparator - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
comparator - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
compare(T, T) - Method in class org.jgrapht.alg.util.AlwaysEqualComparator
compare(Double, Double) - Method in class org.jgrapht.alg.util.ToleranceDoubleComparator: Compares two floating point values.
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.
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(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
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: Demonstrates how to create a complete graph and perform a depth first search on it.
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.
ComponentNameProvider<T> - Interface in org.jgrapht.ext: Provides a name for a component.
ComponentUpdater<T> - Interface in org.jgrapht.ext: Type to handle updates to a component when an import gets more information about it after it has been created.
composeFlow() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Create a map which specifies for each edge in the input map the amount of flow that flows through it
computeMatching() - Method in class org.jgrapht.alg.EdmondsBlossomShrinking: Deprecated.

Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching: Deprecated.

Compute a matching for a given graph.
computeMatching() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm: Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching: Deprecated.

Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.matching.EdmondsBlossomShrinking: Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.matching.GreedyWeightedMatching: Get a matching that is a 1/2-approximation of the maximum weighted matching.
computeMatching() - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching: Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching: Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching: Compute a matching for a given graph.
computeMatching() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching: Get a matching that is a 1/2-approximation of the maximum weighted matching.
computeMatching() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching: Deprecated.

Compute a matching for a given graph.
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: Consolidate trees
containsEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns true if this graph contains the specified edge.
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: Returns true if this graph contains the specified edge.
containsEdge(E) - Method in class org.jgrapht.graph.GraphUnion
containsEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph: Returns true if this graph contains the specified edge.
containsEdge(E) - Method in class org.jgrapht.graph.Subgraph: Returns true if this graph contains the specified edge.
containsVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns true if this graph contains the specified vertex.
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: Returns true if this graph contains the specified vertex.
containsVertex(V) - Method in class org.jgrapht.graph.GraphUnion
containsVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph: Returns true if this graph contains the specified vertex.
containsVertex(V) - Method in class org.jgrapht.graph.Subgraph: Returns true if this graph contains the specified vertex.
convertGraphToDotString(Graph<V, E>) - Static method in class org.jgrapht.ext.DOTUtils: Deprecated.
in favor of implementing the current functionality directly by the user
copy() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover: Copy a vertex cover.
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.
cover - Variable in class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
create() - Method in interface org.jgrapht.alg.util.extension.ExtensionFactory: Factory method which creates a new object which extends Extension
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: Deprecated.
specifics can be changed by overriding directly AbstractBaseGraph.createSpecifics().
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
createEdgeSet(V) - Method in interface org.jgrapht.graph.EdgeSetFactory: Create a new edge set for a particular vertex.
createEdgeSet(V) - Method in class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory: Create a new edge set for a particular vertex.
createExtension() - Method in class org.jgrapht.alg.util.extension.ExtensionManager: Creates and returns an extension object.
createSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph: Create the specifics for this graph.
createUndirectedSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph: Deprecated.
specifics can be changed by overriding directly AbstractBaseGraph.createSpecifics().
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.
CSVExporter<V,E> - Class in org.jgrapht.ext: Exports a graph into a CSV Format or any other Delimiter-separated value format.
CSVExporter() - Constructor for class org.jgrapht.ext.CSVExporter: Creates a new CSVExporter with CSVFormat.ADJACENCY_LIST format and integer name provider for the vertices.
CSVExporter(CSVFormat) - Constructor for class org.jgrapht.ext.CSVExporter: Creates a new CSVExporter with integer name providers for the vertices.
CSVExporter(CSVFormat, char) - Constructor for class org.jgrapht.ext.CSVExporter: Creates a new CSVExporter with integer name providers for the vertices.
CSVExporter(ComponentNameProvider<V>, CSVFormat, char) - Constructor for class org.jgrapht.ext.CSVExporter: Constructs a new CSVExporter with the given ID providers and format.
CSVFormat - Enum in org.jgrapht.ext: Supported CSV formats.
CSVFormat.Parameter - Enum in org.jgrapht.ext: Parameters that affect the behavior of CVS importers/exporters.
CSVImporter<V,E> - Class in org.jgrapht.ext: Imports a graph from a CSV Format or any other Delimiter-separated value format.
CSVImporter(VertexProvider<V>, EdgeProvider<V, E>) - Constructor for class org.jgrapht.ext.CSVImporter: Constructs a new importer using the CSVFormat.ADJACENCY_LIST format as default.
CSVImporter(VertexProvider<V>, EdgeProvider<V, E>, CSVFormat) - Constructor for class org.jgrapht.ext.CSVImporter: Constructs a new importer.
CSVImporter(VertexProvider<V>, EdgeProvider<V, E>, CSVFormat, char) - Constructor for class org.jgrapht.ext.CSVImporter: Constructs a new importer.
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.
cutEdges - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
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.
CycleFoundException() - Constructor for exception org.jgrapht.experimental.dag.DirectedAcyclicGraph.CycleFoundException

D

DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank: Damping factor default value.
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_DIMACS_FORMAT - Static variable in class org.jgrapht.ext.DIMACSExporter: The default format used by the exporter.
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.flow.MaximumFlowAlgorithmBase: Default tolerance.
DEFAULT_EPSILON - Static variable in interface org.jgrapht.alg.interfaces.MatchingAlgorithm: Default tolerance used by algorithms comparing floating point values.
DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.util.ToleranceDoubleComparator: Default tolerance used by the comparator.
DEFAULT_GRAPH_ID - Static variable in class org.jgrapht.ext.DOTExporter: Default graph id used by the exporter.
DEFAULT_GRAPH_ID_KEY - Static variable in class org.jgrapht.ext.DOTImporter: Default key used in the graph updater (if provided) for the graph ID.
DEFAULT_USE_HEURISTICS - Static variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching: Default value on whether to use extra heuristics to improve the result.
DefaultCellFactory() - Constructor for class org.jgrapht.ext.JGraphModelAdapter.DefaultCellFactory
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
degree - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex: degree of this vertex
degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns the degree of the specified vertex.
degreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
degreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator: Returns the degree of the specified vertex.
degreeOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Returns the degree of the specified vertex.
degreeOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Returns the degree of the specified vertex.
degreeOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Returns the degree of the specified vertex.
degreeOf(V) - Method in class org.jgrapht.graph.UndirectedGraphUnion
degreeOf(V) - Method in class org.jgrapht.graph.UndirectedMaskSubgraph: Returns the degree of the specified vertex.
degreeOf(V) - Method in class org.jgrapht.graph.UndirectedSubgraph: Returns the degree of the specified vertex.
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: Deprecated.
in favor of DijkstraShortestPath
DijkstraShortestPath(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.DijkstraShortestPath: Deprecated.

Creates and executes a new DijkstraShortestPath algorithm instance.
DijkstraShortestPath(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.DijkstraShortestPath: Deprecated.

Creates and executes a new DijkstraShortestPath algorithm instance.
DijkstraShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath: An implementation of Dijkstra's shortest path algorithm using a Fibonacci heap.
DijkstraShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath: Constructs a new instance of the algorithm for a given graph.
DijkstraShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath: Constructs a new instance of the algorithm for a given graph.
DIMACSExporter<V,E> - Class in org.jgrapht.ext: Exports a graph into DIMACS format.
DIMACSExporter() - Constructor for class org.jgrapht.ext.DIMACSExporter: Constructs a new exporter.
DIMACSExporter(ComponentNameProvider<V>) - Constructor for class org.jgrapht.ext.DIMACSExporter: Constructs a new exporter with a given vertex ID provider.
DIMACSExporter(ComponentNameProvider<V>, DIMACSFormat) - Constructor for class org.jgrapht.ext.DIMACSExporter: Constructs a new exporter with a given vertex ID provider.
DIMACSExporter.Parameter - Enum in org.jgrapht.ext: Parameters that affect the behavior of the exporter.
DIMACSFormat - Enum in org.jgrapht.ext: DIMACS challenge format.
DIMACSImporter<V,E> - Class in org.jgrapht.ext: Imports a graph specified in DIMACS format.
DIMACSImporter(VertexProvider<V>, EdgeProvider<V, E>, double) - Constructor for class org.jgrapht.ext.DIMACSImporter: Construct a new DIMACSImporter
DIMACSImporter(VertexProvider<V>, EdgeProvider<V, E>) - Constructor for class org.jgrapht.ext.DIMACSImporter: Construct a new DIMACSImporter
directed_graph - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
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: Construct a directed acyclic graph.
DirectedAcyclicGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph: Construct a directed acyclic graph.
DirectedAcyclicGraph.CycleFoundException - Exception in org.jgrapht.experimental.dag: Exception used in dfsF when a cycle is found
DirectedAcyclicGraph.Region - Class in org.jgrapht.experimental.dag: Region is an *inclusive* range of indices.
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: A factory for DirectedAcyclicGraph.TopoOrderMapping.
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.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.VisitedArrayListImpl - Class in org.jgrapht.experimental.dag: This implementation seems to offer the best performance in most cases.
DirectedAcyclicGraph.VisitedBitSetImpl - Class in org.jgrapht.experimental.dag: This implementation is close to the performance of VisitedArrayListImpl, with 1/8 the memory usage.
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).
DirectedEdgeContainer<V,E> - Class in org.jgrapht.graph.specifics: A container for vertex edges.
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: A union of directed graphs.
DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.DirectedGraphUnion: Construct a new directed graph union.
DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.DirectedGraphUnion: Construct a new directed graph union.
DirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph: A directed graph that is a MaskSubgraph of another graph.
DirectedMaskSubgraph(DirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.DirectedMaskSubgraph: Deprecated.
in favor of using lambdas
DirectedMaskSubgraph(DirectedGraph<V, E>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.DirectedMaskSubgraph: Create a new directed MaskSubgraph of another graph.
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: Creates a new directed pseudograph.
DirectedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph: Creates a new directed pseudograph with the specified edge factory.
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.
DirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics: Plain implementation of DirectedSpecifics.
DirectedSpecifics(AbstractBaseGraph<V, E>) - Constructor for class org.jgrapht.graph.specifics.DirectedSpecifics: Construct a new directed specifics.
DirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, DirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.specifics.DirectedSpecifics: Construct a new directed specifics.
DirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, DirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.DirectedSpecifics: Construct a new directed specifics.
DirectedSubgraph<V,E> - Class in org.jgrapht.graph: A directed graph that is a subgraph of another graph.
DirectedSubgraph(DirectedGraph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.DirectedSubgraph: Creates a new directed subgraph.
DirectedSubgraph(DirectedGraph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.DirectedSubgraph: Creates a new directed induced subgraph.
DirectedSubgraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.DirectedSubgraph: Creates a new directed induced subgraph with all vertices included.
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 of another graph.
DirectedWeightedSubgraph(WeightedGraph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph: Creates a new weighted directed subgraph.
DirectedWeightedSubgraph(WeightedGraph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph: Creates a new weighted directed induced subgraph.
DirectedWeightedSubgraph(WeightedGraph<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph: Creates a new weighted directed induced subgraph with all vertices included.
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(ComponentNameProvider<V>, ComponentNameProvider<V>, ComponentNameProvider<E>) - Constructor for class org.jgrapht.ext.DOTExporter: Constructs a new DOTExporter object with the given ID and label providers.
DOTExporter(ComponentNameProvider<V>, ComponentNameProvider<V>, ComponentNameProvider<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.
DOTExporter(ComponentNameProvider<V>, ComponentNameProvider<V>, ComponentNameProvider<E>, ComponentAttributeProvider<V>, ComponentAttributeProvider<E>, ComponentNameProvider<Graph<V, E>>) - Constructor for class org.jgrapht.ext.DOTExporter: Constructs a new DOTExporter object with the given ID, label, attribute, and graph id 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>, ComponentUpdater<V>) - Constructor for class org.jgrapht.ext.DOTImporter: Constructs a new DOTImporter with the given providers
DOTImporter(VertexProvider<V>, EdgeProvider<V, E>, ComponentUpdater<V>, ComponentUpdater<Graph<V, E>>) - Constructor for class org.jgrapht.ext.DOTImporter: Constructs a new DOTImporter with the given providers
DOTUtils - Class in org.jgrapht.ext: Class with DOT format related utilities.
DOTUtils() - Constructor for class org.jgrapht.ext.DOTUtils
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
EdgeBasedTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover: Finds a 2-approximation for a minimum vertex cover A vertex cover is a set of vertices that touches all the edges in the graph.
EdgeBasedTwoApproxVCImpl() - Constructor for class org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl
edgeClass - Variable in class org.jgrapht.generate.WeightedGraphGenerator
edgeClass(Class<? extends E>) - Method in class org.jgrapht.generate.WeightedGraphGenerator: Set the edge class of the generator
edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
edgeCount() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer: Get number of vertex edges
edgeExtensionManager - Variable 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: Set the edge factory of the generator
edgeList - Variable in class org.jgrapht.graph.GraphWalk
edgeMask - Variable in class org.jgrapht.graph.MaskSubgraph
EdgeNameProvider<E> - Interface in org.jgrapht.ext: Deprecated.
in favor of ComponentNameProvider
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.
edges - Variable in class org.jgrapht.graph.MaskSubgraph
edgeSet() - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns a set of the edges contained in this graph.
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: Returns a set of the edges contained in this graph.
edgeSet() - Method in class org.jgrapht.graph.GraphUnion
edgeSet() - Method in class org.jgrapht.graph.MaskSubgraph: Returns a set of the edges contained in this graph.
edgeSet - Variable in class org.jgrapht.graph.Subgraph
edgeSet() - Method in class org.jgrapht.graph.Subgraph: Returns a set of the edges contained in this graph.
EdgeSetFactory<V,E> - Interface in org.jgrapht.graph: A factory for edge sets.
edgeSetFactory - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
edgeSetFactory - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns a set of all edges touching the specified vertex.
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: Returns a set of all edges touching the specified vertex.
edgesOf(V) - Method in class org.jgrapht.graph.GraphUnion
edgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph: Returns a set of all edges touching the specified vertex.
edgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Returns a set of all edges touching the specified vertex.
edgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Returns a set of all edges touching the specified vertex.
edgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Returns a set of all edges touching the specified vertex.
edgesOf(V) - Method in class org.jgrapht.graph.Subgraph: Returns a set of all edges touching the specified vertex.
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<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<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<E>) - Method in class org.jgrapht.event.TraversalListenerAdapter
EdmondsBlossomShrinking<V,E> - Class in org.jgrapht.alg: Deprecated.
Use EdmondsBlossomShrinking instead.
EdmondsBlossomShrinking(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.EdmondsBlossomShrinking: Deprecated.

Construct an instance of the Edmonds blossom shrinking algorithm.
EdmondsBlossomShrinking<V,E> - Class in org.jgrapht.alg.matching: An implementation of Edmonds Blossom Shrinking algorithm for constructing maximum matchings on graphs.
EdmondsBlossomShrinking(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.EdmondsBlossomShrinking: Construct an instance of the Edmonds blossom shrinking algorithm.
EdmondsKarpMFImpl<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.
EdmondsKarpMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMFImpl: Constructs MaximumFlow instance to work with a copy of network.
EdmondsKarpMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMFImpl: Constructs MaximumFlow instance to work with a copy of network.
elementEquals(V, V) - Method in class org.jgrapht.util.VertexPair: Deprecated.

Compares two elements.
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.RandomWalkIterator: Update data structures every time we see a vertex.
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.
endVertex - Variable in class org.jgrapht.graph.GraphWalk
epsilon - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Tolerance when comparing floating point values.
equals(Object) - Method in class org.jgrapht.alg.util.Pair
equals(Object) - Method in class org.jgrapht.alg.util.UnorderedPair
equals(Object) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
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.UnorderedVertexPair: Deprecated.
equals(Object) - Method in class org.jgrapht.util.VertexPair: Deprecated.
EulerianCircuit - Class in org.jgrapht.alg: Deprecated.
use HierholzerEulerianCycle instead
EulerianCircuit() - Constructor for class org.jgrapht.alg.EulerianCircuit: Deprecated.
EulerianCycleAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: Computes an Eulerian cycle of an Eulerian graph.
ExactAlgorithm<ResultType,V> - Interface in org.jgrapht.experimental.alg: An interface for an exact algorithm.
ExportException - Exception in org.jgrapht.ext: An exception that the library throws in case of graph export errors.
ExportException() - Constructor for exception org.jgrapht.ext.ExportException: Constructs an ExportException with null as its error detail message.
ExportException(String) - Constructor for exception org.jgrapht.ext.ExportException: Constructs an ExportException with the specified detail message.
ExportException(String, Throwable) - Constructor for exception org.jgrapht.ext.ExportException: Constructs an ExportException with the specified detail message and cause.
ExportException(Throwable) - Constructor for exception org.jgrapht.ext.ExportException: Constructs an ExportException with the specified cause and a detail message of (cause==null ? null : cause.toString()) (which typically contains the class and detail message of cause).
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.CSVExporter: Exports a graph
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.DIMACSExporter: Export a graph
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.DOTExporter: Exports a graph into a plain text file in DOT format.
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.GmlExporter: Exports an graph into a plain text GML format.
exportGraph(Graph<V, E>, OutputStream) - Method in interface org.jgrapht.ext.GraphExporter: Export a graph
exportGraph(Graph<V, E>, Writer) - Method in interface org.jgrapht.ext.GraphExporter: Export a graph
exportGraph(Graph<V, E>, File) - Method in interface org.jgrapht.ext.GraphExporter: Export a graph
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.GraphMLExporter: Exports a graph in GraphML format.
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.MatrixExporter
exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.ext.VisioExporter: Exports the specified graph into a Visio CSV file format.
extend(int) - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender: Deprecated.

Performs DFS to seek after matching-augmenting path starting at the initial-vertex
Extension - Interface in org.jgrapht.alg.util.extension: Class which represents an abstract extension/encapsulation object.
ExtensionFactory<B extends Extension> - Interface in org.jgrapht.alg.util.extension: Factory class which creates extension/encapsulation objects
ExtensionManager<T,B extends Extension> - Class in org.jgrapht.alg.util.extension: Convenience class to manage extensions/encapsulations.
ExtensionManager(ExtensionFactory<B>) - Constructor for class org.jgrapht.alg.util.extension.ExtensionManager: Create a new extension manager.

F

factorial(int) - Static method in class org.jgrapht.util.MathUtil: Calculate the factorial of n.
FastLookupDirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics: Fast implementation of DirectedSpecifics.
FastLookupDirectedSpecifics(AbstractBaseGraph<V, E>) - Constructor for class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics: Construct a new fast lookup directed specifics.
FastLookupDirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, DirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics: Construct a new fast lookup directed specifics.
FastLookupDirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, DirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics: Construct a new fast lookup directed specifics.
FastLookupUndirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics: Fast implementation of UndirectedSpecifics.
FastLookupUndirectedSpecifics(AbstractBaseGraph<V, E>) - Constructor for class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics: Construct a new fast lookup undirected specifics.
FastLookupUndirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, UndirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics: Construct a new fast lookup undirected specifics.
FastLookupUndirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, UndirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics: Construct a new fast lookup undirected specifics.
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: Constructs a new node.
find(T) - Method in class org.jgrapht.alg.util.UnionFind: Returns the representative element of the set that element is in.
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.
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.
findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.BellmanFordShortestPath: Deprecated.

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.BidirectionalDijkstraShortestPath: Deprecated.

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: Deprecated.

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.shortestpath.BellmanFordShortestPath: Find a path between two vertices.
findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath: Find a path between two vertices.
findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath: Find a path between two vertices.
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<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: The first pair element
first(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator: Set the first partition of the generator.
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: Deprecated.
In favor of FloydWarshallShortestPaths.
FloydWarshallShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.

Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.
FloydWarshallShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath: The Floyd-Warshall algorithm.
FloydWarshallShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.

G

g - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: The graph
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.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, V>) - Method in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator: Generates a random bipartite graph.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.GnmRandomGraphGenerator: Generates a random graph based on the G(n, M) model
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator: Generates a random bipartite graph.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.GnpRandomGraphGenerator: Generates a random graph based on the G(n, p) model.
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.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: Generate a weighted graph structure.
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: Generate a weighted graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, T>) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter: Generate a graph structure.
generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.WheelGraphGenerator: Generate a graph structure.
getA() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse: Get the first vertex of the request
getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph: 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.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: 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.GraphUnion
getAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph: 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.specifics.DirectedSpecifics: 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.specifics.FastLookupDirectedSpecifics: 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.specifics.FastLookupUndirectedSpecifics: Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
getAllEdges(V, V) - Method in interface org.jgrapht.graph.specifics.Specifics: 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.specifics.UndirectedSpecifics: 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.Subgraph: Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
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: Deprecated.

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: Deprecated.

Calculate (and return) all paths from the source vertices to the target vertices.
getAllPaths(V, V, boolean, Integer) - Method in class org.jgrapht.alg.shortestpath.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.shortestpath.AllDirectedPaths: Calculate (and return) all paths from the source vertices to the target vertices.
getAncestors(DirectedAcyclicGraph<V, E>, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
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: Get the second vertex of the request
getBase() - Method in class org.jgrapht.graph.Subgraph: Get the base graph.
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: Deprecated.

Get the cost of the shortest path to a vertex.
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)).
getCostEstimate(V, V) - Method in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic: An admissible heuristic estimate from a source vertex to a target vertex.
getCurrentSink() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Returns current sink vertex, or null if there was no calculateMaximumFlow calls.
getCurrentSource() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Returns current source vertex, or null if there was no calculateMaximumFlow calls.
getCutCapacity() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
getCutCapacity() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
getCutCapacity() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm: Returns the capacity of the cut obtained after the last invocation of MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
getCutEdges() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
getCutEdges() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
getCutEdges() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Returns the set of edges which run from the source partition to the sink partition, in the s-t cut obtained after the last invocation of PadbergRaoOddMinimumCutset.calculateMinCut(Set, boolean)
getCutEdges() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm: Returns the set of edges which run from S to T, in the s-t cut obtained after the last invocation of MinimumSTCutAlgorithm.calculateMinCut(Object, Object) In case of a directed graph, only the edges with their tail in S and their head in T are returned.
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.
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.
getDegree() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex: Returns the degree of the vertex
getDelimiter() - Method in class org.jgrapht.ext.CSVExporter: Get the delimiter (comma, semicolon, pipe, etc).
getDelimiter() - Method in class org.jgrapht.ext.CSVImporter: Get the delimiter (comma, semicolon, pipe, etc).
getDescendants(DirectedAcyclicGraph<V, E>, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
getDiameter() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.
getDiameter() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Compute the diameter of the graph.
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: 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.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: 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.GraphUnion
getEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph: 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.specifics.DirectedSpecifics: 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.specifics.FastLookupDirectedSpecifics: 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.specifics.FastLookupUndirectedSpecifics: Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
getEdge(V, V) - Method in interface org.jgrapht.graph.specifics.Specifics: 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.specifics.UndirectedSpecifics: 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.Subgraph: Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
getEdgeAttributeProvider() - Method in class org.jgrapht.ext.GraphMLExporter: Get the edge attribute provider
getEdgeCell(E) - Method in class org.jgrapht.ext.JGraphModelAdapter: Returns the JGraph edge cell that corresponds to the specified JGraphT edge.
getEdgeContainer(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: A lazy build of edge container for specified vertex.
getEdgeContainer(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: A lazy build of edge container for specified vertex.
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
getEdgeDescriptor() - Method in enum org.jgrapht.ext.DIMACSFormat: Get the edge descriptor used in the format.
getEdgeFactory() - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns the edge factory using which this graph creates new edges.
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: Returns the edge factory using which this graph creates new edges.
getEdgeFactory() - Method in class org.jgrapht.graph.GraphUnion: Throws UnsupportedOperationException, because GraphUnion is read-only.
getEdgeFactory() - Method in class org.jgrapht.graph.MaskSubgraph: Returns the edge factory using which this graph creates new edges.
getEdgeFactory() - Method in class org.jgrapht.graph.Subgraph: Returns the edge factory using which this graph creates new edges.
getEdgeLabelAttributeName() - Method in class org.jgrapht.ext.GraphMLExporter: Get the attribute name for edge labels
getEdgeLabelProvider() - Method in class org.jgrapht.ext.GraphMLExporter: Get the edge label provider
getEdgeList() - Method in class org.jgrapht.graph.GraphWalk
getEdgeList() - Method in interface org.jgrapht.GraphPath: Returns the edges making up the path.
getEdgeName(E) - Method in interface org.jgrapht.ext.EdgeNameProvider: Deprecated.

Returns a unique name for an edge.
getEdgeName(E) - Method in class org.jgrapht.ext.IntegerEdgeNameProvider: Deprecated.

Returns the String representation of an edge.
getEdgeProvider() - Method in class org.jgrapht.ext.DIMACSImporter: Get the edge provider
getEdgeProvider() - Method in class org.jgrapht.ext.GmlImporter: Get the edge provider
getEdgeProvider() - Method in class org.jgrapht.ext.GraphMLImporter: Get the edge provider
getEdges() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching: Get the edges of the matching.
getEdges() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl: Get the edges of the matching.
getEdges() - Method in interface org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner: Set of edges of the graph spanner.
getEdges() - Method in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
getEdges() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree: Set of edges of the spanning tree.
getEdges() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
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: Returns the source vertex of an edge.
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: Returns the source vertex of an edge.
getEdgeSource(E) - Method in class org.jgrapht.graph.GraphUnion
getEdgeSource(E) - Method in class org.jgrapht.graph.MaskSubgraph: Returns the source vertex of an edge.
getEdgeSource(E) - Method in class org.jgrapht.graph.Subgraph: Returns the source vertex of an edge.
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: Returns the target vertex of an edge.
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: Returns the target vertex of an edge.
getEdgeTarget(E) - Method in class org.jgrapht.graph.GraphUnion
getEdgeTarget(E) - Method in class org.jgrapht.graph.MaskSubgraph: Returns the target vertex of an edge.
getEdgeTarget(E) - Method in class org.jgrapht.graph.Subgraph: Returns the target vertex of an edge.
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: Returns the weight assigned to a given edge.
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: Returns the weight assigned to a given edge.
getEdgeWeight(E) - Method in class org.jgrapht.graph.GraphUnion
getEdgeWeight(E) - Method in class org.jgrapht.graph.MaskSubgraph: Returns the weight assigned to a given edge.
getEdgeWeight(E) - Method in class org.jgrapht.graph.Subgraph: Returns the weight assigned to a given edge.
getEdgeWeightAttributeName() - Method in class org.jgrapht.ext.GraphMLExporter: Get the attribute name for edge weights
getEdgeWeightAttributeName() - Method in class org.jgrapht.ext.GraphMLImporter: Get the attribute name for edge weights
getEndVertex() - Method in class org.jgrapht.graph.GraphWalk
getEndVertex() - Method in interface org.jgrapht.GraphPath: Returns the end vertex in the path.
getEquivalentFlowTree() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Returns the Equivalent Flow Tree as an actual tree (graph).
getEulerianCircuitVertices(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.EulerianCircuit: Deprecated.

This method will return a list of vertices which represents the Eulerian circuit of the graph.
getEulerianCycle(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle: Compute an Eulerian cycle of a graph.
getEulerianCycle(Graph<V, E>) - Method in interface org.jgrapht.alg.interfaces.EulerianCycleAlgorithm: Compute an Eulerian cycle of a graph.
getExtension(T) - Method in class org.jgrapht.alg.util.extension.ExtensionManager: Creates a new singleton extension object for original t if no such object exists, returns the old one otherwise.
getFillEdges() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition: Get the fill edges generated by the triangulation.
getFirst() - Method in class org.jgrapht.alg.util.Pair: Get the first element of the pair
getFirst() - Method in class org.jgrapht.util.VertexPair: Deprecated.

Get the first vertex of the pair
getFirstHop(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.

Returns the first hop, i.e., the second node on the shortest path from a to b.
getFirstHop(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Returns the first hop, i.e., the second node on the shortest path from a to b.
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
getFlowDirection(E) - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Unsupported operation
getFlowDirection(E) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Unsupported operation
getFlowDirection(E) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Returns the direction of the flow on an edge (u,v).
getFlowDirection(E) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm: Returns the direction of the flow on an edge (u,v).
getFlowMap() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Unsupported operation
getFlowMap() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Unsupported operation
getFlowMap() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Returns maximum flow, that was calculated during last calculateMaximumFlow call, or null, if there was no calculateMaximumFlow calls.
getFlowMap() - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm: Returns maximum flow, that was calculated during last calculateMaximumFlow call, or null, if there was no calculateMaximumFlow calls.
getFormat() - Method in class org.jgrapht.ext.CSVExporter: Get the format of the exporter
getFormat() - Method in class org.jgrapht.ext.CSVImporter: Get the format that the importer is using.
getFormat() - Method in class org.jgrapht.ext.DIMACSExporter: Get the format of the exporter
getFormat() - Method in class org.jgrapht.ext.MatrixExporter: Get the format that the exporter is using.
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: Return G₁
getG2() - Method in class org.jgrapht.graph.GraphUnion: Return G₂
getGenerators() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition: Get the generators of the separators of the triangulated graph, i.e.
getGomoryHuTree() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Returns the Gomory-Hu Tree as an actual tree (graph).
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: Deprecated.
getGraph() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector: Returns the graph inspected
getGraph() - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths: Returns the graph over which this set of paths is defined.
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.shortestpath.ListSingleSourcePathsImpl: Returns the graph over which this set of paths is defined.
getGraph() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: Returns the graph over which this set of paths is defined.
getGraph() - Method in class org.jgrapht.graph.GraphWalk
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: Create a new instance of DirectedAcyclicGraph.Visited.
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.
getLastHop(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.

Returns the last hop, i.e., the second to last node on the shortest path from a to b.
getLastHop(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Returns the last hop, i.e., the second to last node on the shortest path from a to b.
getLca() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse: Get the least common ancestor
getLength() - Method in class org.jgrapht.graph.GraphWalk
getLength() - Method in interface org.jgrapht.GraphPath: Returns the length of the path, measured in the number of edges.
getLowerBound(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm: Get the result.
getLowerBound(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
getMappings() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector: Get an iterator over all existing (isomorphic) mappings between two graphs.
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: Deprecated.

Returns set of edges making up the matching
getMatching() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching: Deprecated.
getMatching() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm: Deprecated.
Use MatchingAlgorithm.computeMatching() instead.
getMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching: Deprecated.

Returns set of edges making up the matching
getMatching() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching: Deprecated.
getMatchingWeight() - Method in interface org.jgrapht.alg.interfaces.WeightedMatchingAlgorithm: Deprecated.
Use MatchingAlgorithm.computeMatching() instead.
getMatchingWeight() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching: Deprecated.

Returns weight of a matching found
getMatchingWeight() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching: Deprecated.
getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl: Sets current source to source, current sink to sink, then calculates maximum flow from source to sink.
getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Unsupported operation
getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Unsupported operation
getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
getMaximumFlow(V, V) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm: Sets current source to source, current sink to sink, then calculates maximum flow from source to sink.
getMaximumFlowValue() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Returns maximum flow value, that was calculated during last calculateMaximumFlow call.
getMaximumFlowValue() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Returns rhw maximum flow value, that was calculated during the last GusfieldGomoryHuCutTree.calculateMaximumFlow(Object, Object) call.
getMaximumFlowValue() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Returns maximum flow value, that was calculated during last calculateMaximumFlow call.
getMaximumFlowValue() - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm: Returns maximum flow value, that was calculated during last calculateMaximumFlow call.
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: Deprecated.

Returns edges set constituting the minimum spanning tree/forest
getMinimumSpanningTreeEdgeSet() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree: Deprecated.
getMinimumSpanningTreeEdgeSet() - Method in class org.jgrapht.alg.PrimMinimumSpanningTree: Deprecated.
getMinimumSpanningTreeTotalWeight() - Method in interface org.jgrapht.alg.interfaces.MinimumSpanningTree: Deprecated.

Returns total weight of the minimum spanning tree/forest.
getMinimumSpanningTreeTotalWeight() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree: Deprecated.
getMinimumSpanningTreeTotalWeight() - Method in class org.jgrapht.alg.PrimMinimumSpanningTree: Deprecated.
getName(T) - Method in interface org.jgrapht.ext.ComponentNameProvider: Returns a unique name.
getName(E) - Method in interface org.jgrapht.ext.EdgeNameProvider: Deprecated.

Returns a unique name for an edge.
getName(T) - Method in class org.jgrapht.ext.IntegerComponentNameProvider: Returns the string representation of a component.
getName(T) - Method in class org.jgrapht.ext.StringComponentNameProvider: Returns the string representation of a component.
getName(V) - Method in interface org.jgrapht.ext.VertexNameProvider: Deprecated.

Returns a unique name for a vertex.
getNumberOfExpandedNodes() - Method in class org.jgrapht.alg.AStarShortestPath: Deprecated.

Returns how many nodes have been expanded in the A* search procedure in its last invocation.
getNumberOfExpandedNodes() - Method in class org.jgrapht.alg.shortestpath.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: Deprecated.

Given on of the vertices of the pair, get the other.
getParentMap() - Method in class org.jgrapht.alg.util.UnionFind
getPath() - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath: Deprecated.

Return the path found.
getPath() - Method in class org.jgrapht.alg.DijkstraShortestPath: Deprecated.

Return the path found.
getPath(V, V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm: Get a shortest path from a source vertex to a sink vertex.
getPath(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths: Return the path from the source vertex to the sink vertex.
getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath: Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.
getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Get a shortest path from a source vertex to a sink vertex.
getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath: Get a shortest path from a source vertex to a sink vertex.
getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Get a shortest path from a source vertex to a sink vertex.
getPath(V) - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: Return the path from the source vertex to the sink vertex.
getPath(V) - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: Return the path from the source vertex to the sink vertex.
getPathEdgeList(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath: Deprecated.

Get the shortest path to a vertex.
getPathEdgeList() - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath: Deprecated.

Return the edges making up the path.
getPathEdgeList() - Method in class org.jgrapht.alg.DijkstraShortestPath: Deprecated.

Return the edges making up the path found.
getPathLength() - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath: Deprecated.

Return the weighted length of the path found.
getPathLength() - Method in class org.jgrapht.alg.DijkstraShortestPath: Deprecated.

Return the weighted length of the path found.
getPaths(V, V) - Method in interface org.jgrapht.alg.interfaces.KShortestPathAlgorithm: Get a list of shortest paths from a source vertex to a sink vertex.
getPaths(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm: Compute all shortest paths starting from a single source vertex.
getPaths(V) - Method in class org.jgrapht.alg.KShortestPaths: Deprecated.

Returns the k shortest simple paths in increasing order of weight.
getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Compute all shortest paths starting from a single source vertex.
getPaths(V) - Method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath: Compute all shortest paths starting from a single source vertex.
getPaths(V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Compute all shortest paths starting from a single source vertex.
getPaths(V, V) - Method in class org.jgrapht.alg.shortestpath.KShortestPaths: Returns the k shortest simple paths in increasing order of weight.
getPathWeight(V, V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm: Get the weight of the shortest path from a source vertex to a sink vertex.
getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Get the weight of the shortest path from a source vertex to a sink vertex.
getProblem() - Method in enum org.jgrapht.ext.DIMACSFormat: Get the name of the problem.
getRankMap() - Method in class org.jgrapht.alg.util.UnionFind
getRatio() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex: Returns the ratio between the vertex' weight and its degree
getResult(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring: Get the result.
getResult(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ExactAlgorithm: Get the result.
getScores() - Method in interface org.jgrapht.alg.interfaces.VertexScoringAlgorithm: Get a map with the scores of all vertices
getScores() - Method in class org.jgrapht.alg.scoring.PageRank: Get a map with the scores of all vertices
getSecond() - Method in class org.jgrapht.alg.util.Pair: Get the second element of the pair
getSecond() - Method in class org.jgrapht.util.VertexPair: Deprecated.

Get the second vertex of the pair
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: Deprecated.

Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.
getShortestPath(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.

Get the shortest path between two vertices.
getShortestPathAsVertexList(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.

Get the shortest path between two vertices as a list of vertices.
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: Deprecated.

Get shortest paths from a vertex to all other vertices in the graph.
getShortestPaths() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.

Get all shortest paths in the graph.
getShortestPathsCount() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths: Deprecated.
getShortestPathsCount() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths: Get the total number of shortest paths.
getSinkPartition() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
getSinkPartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
getSinkPartition() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Returns partition V-W of the cut obtained after the last invocation of PadbergRaoOddMinimumCutset.calculateMinCut(Set, boolean)
getSinkPartition() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm: Returns the sink partition T, t ∈ T, of the cut obtained after the last invocation of MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
getSize() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region: Get the size of the region.
getSource() - Method in class org.jgrapht.graph.DefaultEdge: Retrieves the source of this edge.
getSourcePartition() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
getSourcePartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
getSourcePartition() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Returns partition W of the cut obtained after the last invocation of PadbergRaoOddMinimumCutset.calculateMinCut(Set, boolean)
getSourcePartition() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm: Returns the source partition S, s ∈ S, of the cut obtained after the last invocation of MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
getSourceVertex() - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths: Returns the single source vertex.
getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: Returns the single source vertex.
getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: Returns the single source vertex.
getSpanner() - Method in interface org.jgrapht.alg.interfaces.SpannerAlgorithm: Computes a graph spanner.
getSpanner() - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
getSpannerEdgeSet() - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner: Deprecated.

Get the edge set of the spanner.
getSpanningTree() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm: Computes a spanning tree.
getSpanningTree() - Method in class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree: Computes a spanning tree.
getSpanningTree() - Method in class org.jgrapht.alg.spanning.KruskalMinimumSpanningTree: Computes a spanning tree.
getSpanningTree() - Method in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree: Computes a spanning tree.
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.GraphWalk
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: Create a new instance of a DirectedAcyclicGraph.TopoOrderMapping.
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.specifics.DirectedEdgeContainer: A lazy build of unmodifiable incoming edge set.
getUnmodifiableOutgoingEdges() - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer: A lazy build of unmodifiable outgoing edge set.
getUnmodifiableVertexEdges() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer: A lazy build of unmodifiable list of vertex edges
getUpperBound(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm: Get the result.
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
getVertexAttributeProvider() - Method in class org.jgrapht.ext.GraphMLExporter: Get the vertex attribute provider
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
getVertexCover(UndirectedGraph<V, E>) - Method in interface org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm: Computes a vertex cover; all vertices are considered to have equal weight.
getVertexCover(UndirectedGraph<V, E>) - Method in interface org.jgrapht.alg.interfaces.MinimumWeightedVertexCoverAlgorithm: Computes a vertex cover; all vertices are considered to have equal weight.
getVertexCover(UndirectedGraph<V, E>, Map<V, Double>) - Method in interface org.jgrapht.alg.interfaces.MinimumWeightedVertexCoverAlgorithm: Computes a vertex cover; the weight of each vertex is provided in the in the vertexWeightMap.
getVertexCover(UndirectedGraph<V, E>, Map<V, Double>) - Method in class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
getVertexCover(UndirectedGraph<V, E>, Map<V, Double>) - Method in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
getVertexCover(UndirectedGraph<V, E>) - Method in class org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl: Finds a 2-approximation for a minimal vertex cover of the specified graph.
getVertexCover(UndirectedGraph<V, E>, Map<V, Double>) - Method in class org.jgrapht.alg.vertexcover.GreedyVCImpl: Finds a greedy solution to the minimum weighted vertex cover problem.
getVertexCover(UndirectedGraph<V, E>) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
getVertexCover(UndirectedGraph<V, E>, Map<V, Double>) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
getVertexLabelAttributeName() - Method in class org.jgrapht.ext.GraphMLExporter: Get the attribute name for vertex labels
getVertexLabelProvider() - Method in class org.jgrapht.ext.GraphMLExporter: Get the vertex label provider
getVertexList() - Method in class org.jgrapht.graph.GraphWalk
getVertexList() - Method in interface org.jgrapht.GraphPath: Returns the path as a sequence of vertices.
getVertexName(V) - Method in class org.jgrapht.ext.StringNameProvider: Deprecated.

Returns the string representation of a vertex.
getVertexName(V) - Method in interface org.jgrapht.ext.VertexNameProvider: Deprecated.

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.
getVertexProvider() - Method in class org.jgrapht.ext.DIMACSImporter: Get the vertex provider
getVertexProvider() - Method in class org.jgrapht.ext.GmlImporter: Get the vertex provider
getVertexProvider() - Method in class org.jgrapht.ext.GraphMLImporter: Get the vertex provider
getVertexScore(V) - Method in interface org.jgrapht.alg.interfaces.VertexScoringAlgorithm: Get a vertex score
getVertexScore(V) - Method in class org.jgrapht.alg.scoring.PageRank: Get a vertex score
getVertexSet() - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Get the vertex set.
getVertexSet() - Method in interface org.jgrapht.graph.specifics.Specifics: Get the vertex set.
getVertexSet() - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Get the vertex set.
getVertexToCellMap() - Method in class org.jgrapht.ext.JGraphXAdapter: Returns Hashmap which maps the vertices onto their visualization mxICells.
getVertices() - Method in interface org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCover: Set of vertices constituting the vertex cover
getVertices() - Method in class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
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 interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching: Returns the weight of the matching.
getWeight() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl: Returns the weight of the matching.
getWeight() - Method in interface org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCover: Returns the weight of the vertex cover.
getWeight() - Method in class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
getWeight(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths: Return the weight of the path from the source vertex to the sink vertex.
getWeight() - Method in interface org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner: Returns the weight of the graph spanner.
getWeight() - Method in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
getWeight() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree: Returns the weight of the spanning tree.
getWeight() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
getWeight(V) - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: Return the weight of the path from the source vertex to the sink vertex.
getWeight(V) - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: Return the weight of the path from the source vertex to the sink vertex.
getWeight() - Method in class org.jgrapht.graph.DefaultWeightedEdge: Retrieves the weight of this edge.
getWeight() - Method in class org.jgrapht.graph.GraphWalk
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 Modeling 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(ComponentNameProvider<V>, ComponentNameProvider<V>, ComponentNameProvider<E>, ComponentNameProvider<E>) - Constructor for class org.jgrapht.ext.GmlExporter: Constructs a new GmlExporter object with the given ID and label providers.
GmlExporter.Parameter - Enum in org.jgrapht.ext: Parameters that affect the behavior of the exporter.
GmlImporter<V,E> - Class in org.jgrapht.ext: Imports a graph from a GML file (Graph Modeling Language).
GmlImporter(VertexProvider<V>, EdgeProvider<V, E>) - Constructor for class org.jgrapht.ext.GmlImporter: Constructs a new importer.
GnmRandomBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate: Create a random bipartite graph based on the G(n, M) Erdős–Rényi model.
GnmRandomBipartiteGraphGenerator(int, int, int) - Constructor for class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator: Create a new random bipartite graph generator.
GnmRandomBipartiteGraphGenerator(int, int, int, long) - Constructor for class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator: Create a new random bipartite graph generator.
GnmRandomBipartiteGraphGenerator(int, int, int, Random) - Constructor for class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator: Create a new random bipartite graph generator.
GnmRandomGraphGenerator<V,E> - Class in org.jgrapht.generate: Create a random graph based on the G(n, M) Erdős–Rényi model.
GnmRandomGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator: Create a new G(n, M) random graph generator.
GnmRandomGraphGenerator(int, int, long) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator: Create a new G(n, M) random graph generator.
GnmRandomGraphGenerator(int, int, long, boolean, boolean) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator: Create a new G(n, M) random graph generator
GnmRandomGraphGenerator(int, int, Random, boolean, boolean) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator: Create a new G(n, M) random graph generator
GnpRandomBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate: Create a random bipartite graph based on the G(n, p) Erdős–Rényi model.
GnpRandomBipartiteGraphGenerator(int, int, double) - Constructor for class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator: Create a new random bipartite graph generator.
GnpRandomBipartiteGraphGenerator(int, int, double, long) - Constructor for class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator: Create a new random bipartite graph generator.
GnpRandomBipartiteGraphGenerator(int, int, double, Random) - Constructor for class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator: Create a new random bipartite graph generator.
GnpRandomGraphGenerator<V,E> - Class in org.jgrapht.generate: Create a random graph based on the G(n, p) Erdős–Rényi model.
GnpRandomGraphGenerator(int, double) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator: Create a new G(n, p) random graph generator.
GnpRandomGraphGenerator(int, double, long) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator: Create a new G(n, p) random graph generator.
GnpRandomGraphGenerator(int, double, long, boolean) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator: Create a new G(n, p) random graph generator.
GnpRandomGraphGenerator(int, double, Random, boolean) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator: Create a new G(n, p) random graph generator.
graph - Variable in class org.jgrapht.alg.BellmanFordShortestPath: Deprecated.

Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: The graph
Graph<V,E> - Interface in org.jgrapht: The root interface in the graph hierarchy.
graph - Variable in class org.jgrapht.graph.builder.AbstractGraphBuilder
graph - Variable in class org.jgrapht.graph.GraphWalk
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, V, V) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent: Constructor for GraphEdgeChangeEvent.
GraphExporter<V,E> - Interface in org.jgrapht.ext: Interface for graph exporters
GraphGenerator<V,E,T> - Interface in org.jgrapht.generate: An interface for generating new graph structures.
GraphImporter<V,E> - Interface in org.jgrapht.ext: Interface for graph importers
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.
GraphMLDemo - Class in org.jgrapht.demo: This class demonstrates exporting and importing a graph with custom vertex and edge attributes in GraphML.
GraphMLDemo() - Constructor for class org.jgrapht.demo.GraphMLDemo
GraphMLExporter<V,E> - Class in org.jgrapht.ext: Exports a graph as GraphML.
GraphMLExporter() - Constructor for class org.jgrapht.ext.GraphMLExporter: Constructs a new GraphMLExporter with integer name providers for the vertex and edge identifiers.
GraphMLExporter(ComponentNameProvider<V>, ComponentNameProvider<V>, ComponentNameProvider<E>, ComponentNameProvider<E>) - Constructor for class org.jgrapht.ext.GraphMLExporter: Constructs a new GraphMLExporter.
GraphMLExporter(ComponentNameProvider<V>, ComponentNameProvider<V>, ComponentAttributeProvider<V>, ComponentNameProvider<E>, ComponentNameProvider<E>, ComponentAttributeProvider<E>) - Constructor for class org.jgrapht.ext.GraphMLExporter: Constructs a new GraphMLExporter.
GraphMLExporter.AttributeCategory - Enum in org.jgrapht.ext: Denotes the category of a GraphML-Attribute.
GraphMLExporter.AttributeType - Enum in org.jgrapht.ext: Denotes the type of a GraphML-Attribute.
GraphMLImporter<V,E> - Class in org.jgrapht.ext: Imports a graph from a GraphML data source.
GraphMLImporter(VertexProvider<V>, EdgeProvider<V, E>) - Constructor for class org.jgrapht.ext.GraphMLImporter: Constructs a new importer.
GraphPath<V,E> - Interface in org.jgrapht: A GraphPath represents a path in a Graph.
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: A unmodifiable graph which is the squared graph of another.
GraphSquare(Graph<V, E>, boolean) - Constructor for class org.jgrapht.experimental.GraphSquare: Constructor for GraphSquare.
GraphTests - Class in org.jgrapht: A collection of utilities to test for various graph properties.
GraphTests() - Constructor for class org.jgrapht.GraphTests
GraphUnion<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph: Read-only union of two graphs: G₁ and G₂.
GraphUnion(G, G, WeightCombiner) - Constructor for class org.jgrapht.graph.GraphUnion: Construct a new graph union.
GraphUnion(G, G) - Constructor for class org.jgrapht.graph.GraphUnion: Construct a new graph union.
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.
GraphWalk<V,E> - Class in org.jgrapht.graph: A walk in a graph is an alternating sequence of vertices and edges, starting and ending at a vertex, in which each edge is adjacent in the sequence to its two endpoints.
GraphWalk(Graph<V, E>, V, V, List<E>, double) - Constructor for class org.jgrapht.graph.GraphWalk: Creates a walk defined by a sequence of edges.
GraphWalk(Graph<V, E>, List<V>, double) - Constructor for class org.jgrapht.graph.GraphWalk: Creates a walk defined by a sequence of vertices.
GraphWalk(Graph<V, E>, V, V, List<V>, List<E>, double) - Constructor for class org.jgrapht.graph.GraphWalk: Creates a walk defined by both a sequence of edges and a sequence of vertices.
GreedyColoring<V,E> - Class in org.jgrapht.experimental.alg.color: Compute greedy graph colorings.
GreedyColoring(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.color.GreedyColoring: Create a new greedy coloring algorithm
GreedyColoring(Graph<V, E>, int) - Constructor for class org.jgrapht.experimental.alg.color.GreedyColoring: Create a new greedy coloring algorithm
GreedyMultiplicativeSpanner<V,E> - Class in org.jgrapht.alg: Deprecated.
Use GreedyMultiplicativeSpanner instead.
GreedyMultiplicativeSpanner(UndirectedGraph<V, E>, int) - Constructor for class org.jgrapht.alg.GreedyMultiplicativeSpanner: Deprecated.

Constructs instance to compute a (2k-1)-spanner of a graph.
GreedyMultiplicativeSpanner<V,E> - Class in org.jgrapht.alg.spanning: Greedy algorithm for (2k-1)-multiplicative spanner construction (for any integer k >= 1).
GreedyMultiplicativeSpanner(UndirectedGraph<V, E>, int) - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner: Constructs instance to compute a (2k-1)-spanner of an undirected graph.
GreedyVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover: Greedy algorithm to find a vertex cover for a graph.
GreedyVCImpl() - Constructor for class org.jgrapht.alg.vertexcover.GreedyVCImpl
GreedyWeightedMatching<V,E> - Class in org.jgrapht.alg.matching: The greedy algorithm for computing a maximum weight matching in an arbitrary graph.
GreedyWeightedMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.GreedyWeightedMatching: Create and execute a new instance of the greedy maximum weight matching algorithm.
GreedyWeightedMatching(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.matching.GreedyWeightedMatching: Create and execute a new instance of the greedy maximum weight matching algorithm.
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: Deprecated.
gScoreMap - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
GusfieldEquivalentFlowTree<V,E> - Class in org.jgrapht.alg.flow: This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.
GusfieldEquivalentFlowTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Constructs a new GusfieldEquivalentFlowTree instance.
GusfieldEquivalentFlowTree(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Constructs a new GusfieldEquivalentFlowTree instance.
GusfieldEquivalentFlowTree(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree: Constructs a new GusfieldEquivalentFlowTree instance.
GusfieldGomoryHuCutTree<V,E> - Class in org.jgrapht.alg.flow: This class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield.
GusfieldGomoryHuCutTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Constructs a new GusfieldEquivalentFlowTree instance.
GusfieldGomoryHuCutTree(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Constructs a new GusfieldEquivalentFlowTree instance.
GusfieldGomoryHuCutTree(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree: Constructs a new GusfieldEquivalentFlowTree instance.

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
hasElement(E) - Method in class org.jgrapht.alg.util.Pair: Assess if this pair contains an element.
hashCode() - Method in class org.jgrapht.alg.util.Pair
hashCode() - Method in class org.jgrapht.alg.util.UnorderedPair
hashCode() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
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.UnorderedVertexPair: Deprecated.
hashCode() - Method in class org.jgrapht.util.VertexPair: Deprecated.
hasMoreElements() - Method in class org.jgrapht.util.PrefetchIterator
hasNext() - Method in class org.jgrapht.traverse.CrossComponentIterator
hasNext() - Method in class org.jgrapht.traverse.RandomWalkIterator
hasNext() - Method in class org.jgrapht.util.PrefetchIterator
hasVertex(V) - Method in class org.jgrapht.util.VertexPair: Deprecated.

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.
HierholzerEulerianCycle<V,E> - Class in org.jgrapht.alg.cycle: An implementation of Hierholzer's algorithm for finding an Eulerian cycle in Eulerian graphs.
HierholzerEulerianCycle() - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle
HopcroftKarpBipartiteMatching<V,E> - Class in org.jgrapht.alg: Deprecated.
Use HopcroftKarpBipartiteMatching instead.
HopcroftKarpBipartiteMatching(UndirectedGraph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.HopcroftKarpBipartiteMatching: Deprecated.

Create a new instance of the Hopcroft-Karp algorithm for the computation of maximum matchings in bipartite graphs.
HopcroftKarpBipartiteMatching<V,E> - Class in org.jgrapht.alg.matching: This class is an implementation of the Hopcroft-Karp algorithm which finds a maximum matching in an undirected simple bipartite graph.
HopcroftKarpBipartiteMatching(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching: Construct a new instance of the Hopcroft-Karp algorithm for the computation of maximum matchings in bipartite graphs.
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

ID - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex: unique id, used to guarantee that compareTo never returns 0
ImportException - Exception in org.jgrapht.ext: An exception that the library throws in case of graph import errors.
ImportException() - Constructor for exception org.jgrapht.ext.ImportException: Constructs an ImportException with null as its error detail message.
ImportException(String) - Constructor for exception org.jgrapht.ext.ImportException: Constructs an ImportException with the specified detail message.
ImportException(String, Throwable) - Constructor for exception org.jgrapht.ext.ImportException: Constructs an ImportException with the specified detail message and cause.
ImportException(Throwable) - Constructor for exception org.jgrapht.ext.ImportException: Constructs an ImportException with the specified cause and a detail message of (cause==null ? null : cause.toString()) (which typically contains the class and detail message of cause).
importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.ext.CSVImporter: Import a graph.
importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.ext.DIMACSImporter: Import a graph.
importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.ext.DOTImporter: Read a dot formatted input and populate the provided graph.
importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.ext.GmlImporter: Import a graph.
importGraph(Graph<V, E>, InputStream) - Method in interface org.jgrapht.ext.GraphImporter: Import a graph
importGraph(Graph<V, E>, Reader) - Method in interface org.jgrapht.ext.GraphImporter: Import a graph
importGraph(Graph<V, E>, File) - Method in interface org.jgrapht.ext.GraphImporter: Import a graph
importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.ext.GraphMLImporter: Import a graph.
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: Returns a set of all edges incoming into the specified vertex.
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.DirectedMaskSubgraph: Returns a set of all edges incoming into the specified vertex.
incomingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph: Returns a set of all edges incoming into the specified vertex.
incomingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
incomingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator: Returns a set of all edges incoming into the specified vertex.
incomingEdgesOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
incomingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Returns a set of all edges incoming into the specified vertex.
incomingEdgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Returns a set of all edges incoming into the specified vertex.
incomingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Returns a set of all edges incoming into the specified vertex.
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: Returns the "in degree" of the specified vertex.
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.DirectedMaskSubgraph: Returns the "in degree" of the specified vertex.
inDegreeOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph: Returns the "in degree" of the specified vertex.
inDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
inDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator: Returns the "in degree" of the specified vertex.
inDegreeOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
inDegreeOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Returns the "in degree" of the specified vertex.
inDegreeOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Returns the "in degree" of the specified vertex.
inDegreeOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Returns the "in degree" of the specified vertex.
init(V, V, ExtensionFactory<VE>, ExtensionFactory<MaximumFlowAlgorithmBase<V, E>.AnnotatedFlowEdge>) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Prepares all data structures to start a new invocation of the Maximum Flow or Minimum Cut algorithms
init() - Method in class org.jgrapht.demo.JGraphAdapterDemo
init() - Method in class org.jgrapht.demo.JGraphXAdapterDemo
initialize(PushRelabelMFImpl<V, E>.VertexExtension, PushRelabelMFImpl<V, E>.VertexExtension, Queue<PushRelabelMFImpl<V, E>.VertexExtension>) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl: Initialization
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: Create a new instance.
IntegerComponentNameProvider<T> - Class in org.jgrapht.ext: Assigns a unique integer to represent each component.
IntegerComponentNameProvider() - Constructor for class org.jgrapht.ext.IntegerComponentNameProvider
IntegerEdgeNameProvider<E> - Class in org.jgrapht.ext: Deprecated.
in favor of IntegerComponentNameProvider
IntegerEdgeNameProvider() - Constructor for class org.jgrapht.ext.IntegerEdgeNameProvider: Deprecated.
IntegerNameProvider<V> - Class in org.jgrapht.ext: Deprecated.
in favor of IntegerComponentNameProvider
IntegerNameProvider() - Constructor for class org.jgrapht.ext.IntegerNameProvider: Deprecated.
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.GraphTests: Test whether a graph is bipartite.
isBipartitePartition(Graph<V, E>, Set<? extends V>, Set<? extends V>) - Static method in class org.jgrapht.GraphTests: Test whether a partition of the vertices into two sets is a bipartite partition.
isChordal() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition: Check if the graph is chordal.
isComplete(Graph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether a graph is complete.
isConnected(UndirectedGraph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether an undirected graph is connected.
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
isConsistentHeuristic(AStarAdmissibleHeuristic<V>) - Method in class org.jgrapht.alg.AStarShortestPath: Deprecated.

Returns true if the provided heuristic is a consistent or monotone heuristic wrt the graph provided at construction time.
isConsistentHeuristic(AStarAdmissibleHeuristic<V>) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath: Returns true if the provided heuristic is a consistent or monotone heuristic wrt the graph provided at construction time.
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: Deprecated.

Returns true if the edge is masked, false otherwise.
isEmpty(Graph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether a graph is empty.
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(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle: Test whether a graph is Eulerian.
isEulerian(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.EulerianCircuit: Deprecated.

Test whether a graph is Eulerian.
isEulerian(Graph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether a graph is Eulerian.
isExact() - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm: Checks if the algorithm is an exact algorithm.
isExact() - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
isExhausted() - Method in class org.jgrapht.traverse.RandomWalkIterator: Check if this walk is exhausted.
isExportEdgeWeights() - Method in class org.jgrapht.ext.GraphMLExporter: Whether the exporter will print edge weights.
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: Check if index is in the region.
isInduced - Variable in class org.jgrapht.graph.Subgraph
isOddVertexSet(Set<V>, Set<V>) - Static method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Convenience method which test whether the given set contains an odd number of odd-labeled nodes.
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: Construct a new isomorphic graph mapping
isomorphismExists() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector: Check if an isomorphism exists.
isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
IsomorphismInspector<V,E> - Interface in org.jgrapht.alg.isomorphism: General interface for graph and subgraph isomorphism.
isParameter(CSVFormat.Parameter) - Method in class org.jgrapht.ext.CSVExporter: Return if a particular parameter of the exporter is enabled
isParameter(CSVFormat.Parameter) - Method in class org.jgrapht.ext.CSVImporter: Return if a particular parameter of the exporter is enabled
isParameter(DIMACSExporter.Parameter) - Method in class org.jgrapht.ext.DIMACSExporter: Return if a particular parameter of the exporter is enabled
isParameter(GmlExporter.Parameter) - Method in class org.jgrapht.ext.GmlExporter: Return if a particular parameter of the exporter is enabled
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(V) - Method in class org.jgrapht.traverse.CrossComponentIterator: Determines whether a vertex has been seen yet by this traversal.
isSimple(Graph<V, E>) - Static method in class org.jgrapht.GraphTests: Check if a graph is simple.
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(DirectedGraph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether a directed graph is strongly connected.
isTree(UndirectedGraph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether an undirected graph is a tree.
isValidPath(AbstractPathElement<V, E>, E) - Method in interface org.jgrapht.alg.PathValidator: Deprecated.

Checks if an edge can be added to a previous path element.
isValidPath(AbstractPathElement<V, E>, E) - Method in interface org.jgrapht.alg.shortestpath.PathValidator: Checks if an edge can be added to a previous path element.
isVertexMasked(V) - Method in interface org.jgrapht.graph.MaskFunctor: Deprecated.

Returns true if the vertex is masked, false otherwise.
isWeaklyConnected(DirectedGraph<V, E>) - Static method in class org.jgrapht.GraphTests: Test whether a directed graph is weakly connected.
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: A JGraph model adapter.
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.
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: Deprecated.
Use KruskalMinimumSpanningTree instead.
KruskalMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.KruskalMinimumSpanningTree: Deprecated.

Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
KruskalMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning: An implementation of Kruskal's minimum spanning tree algorithm.
KruskalMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.spanning.KruskalMinimumSpanningTree: Construct a new instance of the algorithm.
KShortestPathAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: An algorithm which computes k-shortest paths between vertices.
KShortestPaths<V,E> - Class in org.jgrapht.alg: Deprecated.
Use KShortestPaths instead.
KShortestPaths(Graph<V, E>, V, int) - Constructor for class org.jgrapht.alg.KShortestPaths: Deprecated.

Creates an object to compute ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V, E>, V, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.KShortestPaths: Deprecated.

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: Deprecated.

Creates an object to calculate ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V, E>, V, int, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.KShortestPaths: Deprecated.

Creates an object to calculate ranking shortest paths between the start vertex and others vertices.
KShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath: The algorithm determines the k shortest simple paths in increasing order of weight.
KShortestPaths(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.shortestpath.KShortestPaths: Constructs an object to compute ranking shortest paths in a graph.
KShortestPaths(Graph<V, E>, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.KShortestPaths: Constructs an object to compute ranking shortest paths in a graph.
KShortestPaths(Graph<V, E>, int, int) - Constructor for class org.jgrapht.alg.shortestpath.KShortestPaths: Constructs an object to calculate ranking shortest paths in a graph.
KShortestPaths(Graph<V, E>, int, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.KShortestPaths: Constructs an object to calculate ranking shortest paths in a graph.
KuhnMunkresMatrixImplementation(WeightedGraph<V, E>, List<? extends V>, List<? extends V>) - Constructor for class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation: Deprecated.

Construct new instance
KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> - Class in org.jgrapht.alg: Deprecated.
Use KuhnMunkresMinimalWeightBipartitePerfectMatching instead.
KuhnMunkresMinimalWeightBipartitePerfectMatching(WeightedGraph<V, E>, List<? extends V>, List<? extends V>) - Constructor for class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching: Deprecated.

Construct a new instance of the algorithm.
KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> - Class in org.jgrapht.alg.matching: 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(Graph<V, E>, Set<? extends V>, Set<? extends V>) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching: Construct a new instance of the algorithm.
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,E> - Class in org.jgrapht.alg: Deprecated.

The actual implementation.
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender - Class in org.jgrapht.alg: Deprecated.

Aggregates utilities to extend matching

L

LARGEST_SATURATION_FIRST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
LcaRequestResponse(V, V) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse: Create a new LCA request response data transfer object.
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.
ListSingleSourcePathsImpl<V,E> - Class in org.jgrapht.alg.shortestpath: An implementation of ShortestPathAlgorithm.SingleSourcePaths which stores one path per vertex.
ListSingleSourcePathsImpl(Graph<V, E>, V, Map<V, GraphPath<V, E>>) - Constructor for class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: Construct a new instance.
longValue() - Method in class org.jgrapht.util.ModifiableInteger

M

main(String[]) - Static method in class org.jgrapht.demo.CompleteGraphDemo: Main demo entry point.
main(String[]) - Static method in class org.jgrapht.demo.GraphMLDemo: Main demo method
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.
map - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: A map which keeps for each target vertex the predecessor edge and the total length of the shortest path.
MaskFunctor<V,E> - Interface in org.jgrapht.graph: Deprecated.
in favor of using lambdas
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: Deprecated.
in favor of using the constructor with lambdas
MaskSubgraph(Graph<V, E>, Predicate<V>, Predicate<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 a matching of a given graph.
MatchingAlgorithm.Matching<E> - Interface in org.jgrapht.alg.interfaces: A graph matching.
MatchingAlgorithm.MatchingImpl<E> - Class in org.jgrapht.alg.interfaces: A default implementation of the matching interface.
MatchingImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl: Construct a new instance
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 with integer name provider for the vertex identifiers and MatrixExporter.Format.SPARSE_ADJACENCY_MATRIX as the default format.
MatrixExporter(MatrixExporter.Format) - Constructor for class org.jgrapht.ext.MatrixExporter: Creates a new MatrixExporter with integer name provider for the vertex identifiers.
MatrixExporter(MatrixExporter.Format, ComponentNameProvider<V>) - Constructor for class org.jgrapht.ext.MatrixExporter: Creates a new MatrixExporter.
MatrixExporter.Format - Enum in org.jgrapht.ext: Formats supported by the exporter.
MAX - Static variable in interface org.jgrapht.util.WeightCombiner: Maximum weight.
MAX_ITERATIONS_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank: Default number of maximum iterations.
maxFlow - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
maxFlowValue - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
MaximumFlowAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: Allows to derive maximum-flow from the supplied flow network
MaximumFlowAlgorithm.MaximumFlow<E> - Interface in org.jgrapht.alg.interfaces: A maximum flow
MaximumFlowAlgorithm.MaximumFlowImpl<E> - Class in org.jgrapht.alg.interfaces: Default implementation of the maximum flow
MaximumFlowAlgorithmBase<V,E> - Class in org.jgrapht.alg.flow: Base class backing algorithms allowing to derive maximum-flow from the supplied flow network
MaximumFlowAlgorithmBase(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Construct a new maximum flow
MaximumFlowImpl(Double, Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl: Create a new maximum flow
MaximumWeightBipartiteMatching<V,E> - Class in org.jgrapht.alg.matching: This class finds a maximum weight matching of a simple undirected weighted bipartite graph.
MaximumWeightBipartiteMatching(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching: Construct a new instance of the algorithm.
MaximumWeightBipartiteMatching<V,E> - Class in org.jgrapht.alg: Deprecated.
Use MaximumWeightBipartiteMatching instead.
MaximumWeightBipartiteMatching(WeightedGraph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.MaximumWeightBipartiteMatching: Deprecated.

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: Deprecated.
In favor of SpanningTreeAlgorithm.
MinimumSTCutAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: Given a weighted graph G(V,E) (directed or undirected).
MinimumVertexCoverAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: Computes a vertex cover in an undirected graph.
MinimumVertexCoverAlgorithm.VertexCover<V> - Interface in org.jgrapht.alg.interfaces: A vertex cover
MinimumVertexCoverAlgorithm.VertexCoverImpl<V> - Class in org.jgrapht.alg.interfaces: Default implementation of a vertex cover
MinimumWeightedVertexCoverAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: Computes a weighted vertex cover in an undirected graph.
MixedGraphUnion<V,E> - Class in org.jgrapht.graph: Read-only union of an undirected and a directed graph.
MixedGraphUnion(UndirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.MixedGraphUnion: Construct a new graph union.
MixedGraphUnion(UndirectedGraph<V, E>, DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.MixedGraphUnion: Construct a new graph union.
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

n1 - Variable in class org.jgrapht.util.VertexPair: Deprecated.
n2 - Variable in class org.jgrapht.util.VertexPair: Deprecated.
NaiveLcaFinder<V,E> - Class in org.jgrapht.alg: Find the Lowest Common Ancestor of a directed graph.
NaiveLcaFinder(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.NaiveLcaFinder: Create a new instance of the native LCA finder.
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.
neighbors - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex: Map of neighbors, and a count of the number of edges to this neighbor
neighborsOf(V) - Method in class org.jgrapht.alg.NeighborIndex: Returns the set of vertices which are adjacent to a specified vertex.
network - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
next() - Method in class org.jgrapht.traverse.CrossComponentIterator
next() - Method in class org.jgrapht.traverse.RandomWalkIterator
next() - Method in class org.jgrapht.util.PrefetchIterator
nextElement() - Method in class org.jgrapht.util.PrefetchIterator
nextElement() - Method in interface org.jgrapht.util.PrefetchIterator.NextElementFunctor: Return the next element or throw a NoSuchElementException if there are no more elements.
nListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
nMaxHops - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Maximum number of edges of the calculated paths.
numberOfExpandedNodes - Variable in class org.jgrapht.alg.AStarShortestPath: Deprecated.
numberOfExpandedNodes - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath

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.
of(A, B) - Static method in class org.jgrapht.alg.util.UnorderedPair: Creates new unordered pair of elements pulling of the necessity to provide corresponding types of the elements supplied.
openList - Variable in class org.jgrapht.alg.AStarShortestPath: Deprecated.
openList - Variable in class org.jgrapht.alg.shortestpath.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: Flow related algorithms.
org.jgrapht.alg.interfaces - package org.jgrapht.alg.interfaces: Algorithm related interfaces.
org.jgrapht.alg.isomorphism - package org.jgrapht.alg.isomorphism: Algorithms for (sub)graph isomorphism.
org.jgrapht.alg.matching - package org.jgrapht.alg.matching: Algorithms for the computation of matchings.
org.jgrapht.alg.scoring - package org.jgrapht.alg.scoring: Vertex and/or edge scoring algorithms.
org.jgrapht.alg.shortestpath - package org.jgrapht.alg.shortestpath: Shortest-path related algorithms.
org.jgrapht.alg.spanning - package org.jgrapht.alg.spanning: Spanning tree and spanner algorithms.
org.jgrapht.alg.util - package org.jgrapht.alg.util: Utilities used by JGraphT algorithms.
org.jgrapht.alg.util.extension - package org.jgrapht.alg.util.extension: Utility classes for managing extensions/encapsulations.
org.jgrapht.alg.vertexcover - package org.jgrapht.alg.vertexcover: Vertex cover algorithms.
org.jgrapht.alg.vertexcover.util - package org.jgrapht.alg.vertexcover.util: Utilities for vertex cover 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: Experimental work or work-in-progress.
org.jgrapht.experimental.alg - package org.jgrapht.experimental.alg: Experimental package with algorithms.
org.jgrapht.experimental.alg.color - package org.jgrapht.experimental.alg.color: Experimental package with graph coloring algorithms.
org.jgrapht.experimental.dag - package org.jgrapht.experimental.dag: Experimental package with directed acyclic graphs.
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.graph.specifics - package org.jgrapht.graph.specifics: Implementations of specifics for various graph types.
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: Returns the "out degree" of the specified vertex.
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.DirectedMaskSubgraph: Returns the "out degree" of the specified vertex.
outDegreeOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph: Returns the "out degree" of the specified vertex.
outDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
outDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator: Returns the "out degree" of the specified vertex.
outDegreeOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
outDegreeOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Returns the "out degree" of the specified vertex.
outDegreeOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Returns the "out degree" of the specified vertex.
outDegreeOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Returns the "out degree" of the specified vertex.
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: Returns a set of all edges outgoing from the specified vertex.
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.DirectedMaskSubgraph: Returns a set of all edges outgoing from the specified vertex.
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph: Returns a set of all edges outgoing from the specified vertex.
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator: Returns a set of all edges outgoing from the specified vertex.
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.MixedGraphUnion
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics: Returns a set of all edges outgoing from the specified vertex.
outgoingEdgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics: Returns a set of all edges outgoing from the specified vertex.
outgoingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Returns a set of all edges outgoing from the specified vertex.

P

PadbergRaoOddMinimumCutset<V,E> - Class in org.jgrapht.alg.flow: Implementation of the algorithm by Padberg and Rao to compute Odd Minimum Cut-Sets.
PadbergRaoOddMinimumCutset(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
PadbergRaoOddMinimumCutset(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
PadbergRaoOddMinimumCutset(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset: Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
PageRank<V,E> - Class in org.jgrapht.alg.scoring: PageRank implementation.
PageRank(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.PageRank: Create and execute an instance of PageRank.
PageRank(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.scoring.PageRank: Create and execute an instance of PageRank.
PageRank(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.scoring.PageRank: Create and execute an instance of PageRank.
PageRank(Graph<V, E>, double, int, double) - Constructor for class org.jgrapht.alg.scoring.PageRank: Create and execute an instance of PageRank.
Pair<A,B> - Class in org.jgrapht.alg.util: Generic pair.
Pair(A, B) - Constructor for class org.jgrapht.alg.util.Pair: Create a new 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: Create a new paranoid 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.
PathGrowingWeightedMatching<V,E> - Class in org.jgrapht.alg.matching: A linear time 1/2-approximation algorithm for finding a maximum weight matching in an arbitrary graph.
PathGrowingWeightedMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching: Construct a new instance of the path growing algorithm.
PathGrowingWeightedMatching(Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching: Construct a new instance of the path growing algorithm.
PathGrowingWeightedMatching(Graph<V, E>, boolean, double) - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching: Construct a new instance of the path growing algorithm.
paths - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: One path per vertex
PathValidator<V,E> - Interface in org.jgrapht.alg: Deprecated.
Use PathValidator instead.
PathValidator<V,E> - Interface in org.jgrapht.alg.shortestpath: May be used to provide external path validations in addition to the basic validations done by KShortestPaths - that the path is from source to target and that it does not contain loops.
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: Construct a new prefetch iterator.
PrefetchIterator.NextElementFunctor<EE> - Interface in org.jgrapht.util: A functor for the calculation of the next element.
PrimMinimumSpanningTree<V,E> - Class in org.jgrapht.alg: Deprecated.
Use PrimMinimumSpanningTree instead.
PrimMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.PrimMinimumSpanningTree: Deprecated.

Create and execute a new instance of Prim's algorithm.
PrimMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning: 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.spanning.PrimMinimumSpanningTree: Construct a new instance of the algorithm.
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>.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase: Increase flow in the direction denoted by edge (u,v).
pushFlowThrough(MaximumFlowAlgorithmBase<V, E>.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl: Push flow through an edge.
PushRelabelMFImpl<V,E> - Class in org.jgrapht.alg.flow: Push-relabel maximum flow algorithm designed by Andrew V.
PushRelabelMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl: Construct a new push-relabel algorithm.
PushRelabelMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl: Construct a new push-relabel algorithm.
PushRelabelMFImpl.VertexExtension - Class in org.jgrapht.alg.flow: Vertex extension for the push-relabel algorithm, which contains an additional label.
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

RandomWalkIterator<V,E> - Class in org.jgrapht.traverse: A random-walk iterator for a directed and an undirected graph.
RandomWalkIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.RandomWalkIterator: Creates a new iterator for the specified graph.
RandomWalkIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.RandomWalkIterator: Creates a new iterator for the specified graph.
RandomWalkIterator(Graph<V, E>, V, boolean) - Constructor for class org.jgrapht.traverse.RandomWalkIterator: Creates a new iterator for the specified graph.
RandomWalkIterator(Graph<V, E>, V, boolean, long) - Constructor for class org.jgrapht.traverse.RandomWalkIterator: Creates a new iterator for the specified graph.
RatioVertex<V> - Class in org.jgrapht.alg.vertexcover.util: Helper class for vertex covers.
RatioVertex(int, V, double) - Constructor for class org.jgrapht.alg.vertexcover.util.RatioVertex: Create a new ratio vertex
RecursiveExactVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover: Finds a minimum vertex cover in a undirected graph.
RecursiveExactVCImpl() - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
RecursiveExactVCImpl.BitSetCover - Class in org.jgrapht.alg.vertexcover: Helper class which represents a vertex cover as a space efficient BitSet
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.
Region(int, int) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region: Construct a new region.
registerAttribute(String, GraphMLExporter.AttributeCategory, GraphMLExporter.AttributeType) - Method in class org.jgrapht.ext.GraphMLExporter: Register a GraphML-Attribute
registerAttribute(String, GraphMLExporter.AttributeCategory, GraphMLExporter.AttributeType, String) - Method in class org.jgrapht.ext.GraphMLExporter: Register a GraphML-Attribute
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
removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.experimental.GraphSquare: Removes all the edges in this graph that are also contained in the specified edge collection.
removeAllEdges(V, V) - Method in class org.jgrapht.experimental.GraphSquare: 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.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: Removes all the edges in this graph that are also contained in the specified edge collection.
removeAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph: 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 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: 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.AbstractGraph
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.MaskSubgraph: Removes all the vertices in this graph that are also contained in the specified vertex collection.
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: Removes the specified edge from the graph.
removeEdge(V, V) - Method in class org.jgrapht.experimental.GraphSquare: Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
removeEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph: Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
removeEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph: Removes the specified edge from the graph.
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(E) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder: Removes the specified edge from 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: Removes the specified edge from the graph.
removeEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator: Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
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: Removes the specified edge from the graph.
removeEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph: Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
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.specifics.UndirectedEdgeContainer: Remove a vertex edge
removeEdge(E) - Method in class org.jgrapht.graph.Subgraph: Removes the specified edge from the graph.
removeEdge(V, V) - Method in class org.jgrapht.graph.Subgraph: Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
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.specifics.DirectedSpecifics: Removes the specified edge from the edge containers of its source and target vertices.
removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics: Removes the specified edge from the edge containers of its source and target vertices.
removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics: Removes the specified edge from the edge containers of its source and target vertices.
removeEdgeFromTouchingVertices(E) - Method in interface org.jgrapht.graph.specifics.Specifics: Removes the specified edge from the edge containers of its source and target vertices.
removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics: Removes the specified edge from the edge containers of its source and target vertices.
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(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer: Remove an incoming edge.
removeMin() - Method in class org.jgrapht.util.FibonacciHeap: Removes the smallest element from the heap.
removeNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex: Remove a neighbor.
removeOutgoingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer: Remove an outgoing edge.
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: Removes the specified vertex from this graph including all its touching edges if present.
removeVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph: Removes the specified vertex from this graph including all its touching edges if present.
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: Removes the specified vertex from this graph including all its touching edges if present.
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: Removes the specified vertex from this graph including all its touching edges if present.
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: Removes the specified vertex from this graph including all its touching edges if present.
removeVertex(V) - Method in class org.jgrapht.graph.UnmodifiableGraph
removeVertexAndPreserveConnectivity(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs: Removes the given vertex from the given graph.
removeVertexAndPreserveConnectivity(DirectedGraph<V, E>, Iterable<V>) - Static method in class org.jgrapht.Graphs: Removes all the given vertices from the given graph.
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.
removeVerticesAndPreserveConnectivity(DirectedGraph<V, E>, Predicate<V>) - Static method in class org.jgrapht.Graphs: Filters vertices from the given graph and subsequently removes them.
reusableEdgeEvent - Variable in class org.jgrapht.traverse.AbstractGraphIterator
reusableVertexEvent - Variable in class org.jgrapht.traverse.AbstractGraphIterator
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: The second pair element
second(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator: Set the second partition of the generator.
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.
setDelimiter(char) - Method in class org.jgrapht.ext.CSVExporter: Set the delimiter (comma, semicolon, pipe, etc).
setDelimiter(char) - Method in class org.jgrapht.ext.CSVImporter: Set the delimiter (comma, semicolon, pipe, etc).
setEdgeAttributeProvider(ComponentAttributeProvider<E>) - Method in class org.jgrapht.ext.GraphMLExporter: Set the edge attribute provider.
setEdgeLabelAttributeName(String) - Method in class org.jgrapht.ext.GraphMLExporter: Set the attribute name to use for edge labels.
setEdgeLabelProvider(ComponentNameProvider<E>) - Method in class org.jgrapht.ext.GraphMLExporter: Set the edge label provider.
setEdgeProvider(EdgeProvider<V, E>) - Method in class org.jgrapht.ext.DIMACSImporter: Set the edge provider.
setEdgeProvider(EdgeProvider<V, E>) - Method in class org.jgrapht.ext.GmlImporter: Set the edge provider.
setEdgeProvider(EdgeProvider<V, E>) - Method in class org.jgrapht.ext.GraphMLImporter: Set the edge provider.
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AbstractBaseGraph: Assigns a weight to an edge.
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsWeightedGraph
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.GraphDelegator: Assigns a weight to an edge.
setEdgeWeight(E, double) - Method in class org.jgrapht.graph.Subgraph: Assigns a weight to an edge.
setEdgeWeight(E, double) - Method in interface org.jgrapht.WeightedGraph: Assigns a weight to an edge.
setEdgeWeightAttributeName(String) - Method in class org.jgrapht.ext.GraphMLExporter: Set the attribute name to use for edge weights.
setEdgeWeightAttributeName(String) - Method in class org.jgrapht.ext.GraphMLImporter: Set the attribute name to use for edge weights.
setExportEdgeWeights(boolean) - Method in class org.jgrapht.ext.GraphMLExporter: Set whether the exporter will print edge weights.
setFormat(CSVFormat) - Method in class org.jgrapht.ext.CSVExporter: Set the format of the exporter
setFormat(CSVFormat) - Method in class org.jgrapht.ext.CSVImporter: Set the format of the importer
setFormat(DIMACSFormat) - Method in class org.jgrapht.ext.DIMACSExporter: Set the format of the exporter
setFormat(MatrixExporter.Format) - Method in class org.jgrapht.ext.MatrixExporter: Set the output format of the exporter
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.
setParameter(CSVFormat.Parameter, boolean) - Method in class org.jgrapht.ext.CSVExporter: Set the value of a parameter of the exporter
setParameter(CSVFormat.Parameter, boolean) - Method in class org.jgrapht.ext.CSVImporter: Set the value of a parameter of the exporter
setParameter(DIMACSExporter.Parameter, boolean) - Method in class org.jgrapht.ext.DIMACSExporter: Set the value of a parameter of the exporter
setParameter(GmlExporter.Parameter, boolean) - Method in class org.jgrapht.ext.GmlExporter: Set the value of a parameter of the exporter
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.
setVertexAttributeProvider(ComponentAttributeProvider<V>) - Method in class org.jgrapht.ext.GraphMLExporter: Set the vertex attribute provider.
setVertexLabelAttributeName(String) - Method in class org.jgrapht.ext.GraphMLExporter: Set the attribute name to use for vertex labels.
setVertexLabelProvider(ComponentNameProvider<V>) - Method in class org.jgrapht.ext.GraphMLExporter: Set the vertex label provider.
setVertexProvider(VertexProvider<V>) - Method in class org.jgrapht.ext.DIMACSImporter: Set the vertex provider
setVertexProvider(VertexProvider<V>) - Method in class org.jgrapht.ext.GmlImporter: Set the vertex provider
setVertexProvider(VertexProvider<V>) - Method in class org.jgrapht.ext.GraphMLImporter: Set the vertex provider
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: Deprecated.

Get the length of a shortest path.
ShortestPathAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: An algorithm which computes shortest paths between vertices.
ShortestPathAlgorithm.SingleSourcePaths<V,E> - Interface in org.jgrapht.alg.interfaces: A set of paths starting from a single source vertex.
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.
SimpleWeightedBipartiteGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate: A simple weighted bipartite graph matrix generator.
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: A simple weighted graph matrix generator.
SimpleWeightedGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
sink - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
sinkPartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
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
source - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
source - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl: The source vertex of all paths
source - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: The source vertex
sourcePartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
SpannerAlgorithm<E> - Interface in org.jgrapht.alg.interfaces: An algorithm which computes a graph spanner of a given graph.
SpannerAlgorithm.Spanner<E> - Interface in org.jgrapht.alg.interfaces: A graph spanner.
SpannerAlgorithm.SpannerImpl<E> - Class in org.jgrapht.alg.interfaces: Default implementation of the spanner interface.
SpannerImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl: Construct a new spanner
SpanningTreeAlgorithm<E> - Interface in org.jgrapht.alg.interfaces: An algorithm which computes a spanning tree of a given connected graph.
SpanningTreeAlgorithm.SpanningTree<E> - Interface in org.jgrapht.alg.interfaces: A spanning tree.
SpanningTreeAlgorithm.SpanningTreeImpl<E> - Class in org.jgrapht.alg.interfaces: Default implementation of the spanning tree interface.
SpanningTreeImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl: Construct a new spanning tree.
Specifics<V,E> - Interface in org.jgrapht.graph.specifics: An interface encapsulating the basic graph operations.
specifics - Variable in class org.jgrapht.traverse.AbstractGraphIterator
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: Deprecated.

Start vertex.
startVertex - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath: Start vertex.
startVertex - Variable in class org.jgrapht.graph.GraphWalk
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
StringComponentNameProvider<T> - Class in org.jgrapht.ext: Generates names by invoking Object.toString() on them.
StringComponentNameProvider() - Constructor for class org.jgrapht.ext.StringComponentNameProvider
StringEdgeNameProvider<E> - Class in org.jgrapht.ext: Deprecated.
in favor of StringComponentNameProvider
StringEdgeNameProvider() - Constructor for class org.jgrapht.ext.StringEdgeNameProvider: Deprecated.
StringNameProvider<V> - Class in org.jgrapht.ext: Deprecated.
in favor of StringComponentNameProvider
StringNameProvider() - Constructor for class org.jgrapht.ext.StringNameProvider: Deprecated.
StrongConnectivityAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces: An interface to the StrongConnectivityInspector algorithm classes.
stronglyConnectedSets() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector: Computes a List of Sets, 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 Sets, 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 Sets, 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 DirectedSubgraphs of the given graph.
stronglyConnectedSubgraphs() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm: Computes a list of DirectedSubgraphs of the given graph.
stronglyConnectedSubgraphs() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector: Computes a list of DirectedSubgraphs 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<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.Subgraph: Creates a new Subgraph.
Subgraph(G, Set<? extends V>) - Constructor for class org.jgrapht.graph.Subgraph: Creates a new induced Subgraph.
Subgraph(G) - Constructor for class org.jgrapht.graph.Subgraph: Creates a new induced Subgraph with all vertices included.
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: Data transfer object for LCA request and response.
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.
TOLERANCE_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank: Default value for the tolerance.
ToleranceDoubleComparator - Class in org.jgrapht.alg.util: A double comparator with adjustable tolerance.
ToleranceDoubleComparator() - Constructor for class org.jgrapht.alg.util.ToleranceDoubleComparator: Construct a new comparator with a ToleranceDoubleComparator.DEFAULT_EPSILON tolerance.
ToleranceDoubleComparator(double) - Constructor for class org.jgrapht.alg.util.ToleranceDoubleComparator: Construct a new comparator with a specified tolerance.
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.
TopoVertexMap() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
toString() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
toString() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
toString() - Method in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
toString() - Method in class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
toString() - Method in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
toString() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
toString() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
toString() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
toString() - Method in class org.jgrapht.alg.util.Pair
toString() - Method in class org.jgrapht.alg.util.UnorderedPair
toString() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
toString() - Method in enum org.jgrapht.ext.GraphMLExporter.AttributeCategory: Get a string representation of the attribute category
toString() - Method in enum org.jgrapht.ext.GraphMLExporter.AttributeType: Get a string representation of the attribute type
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: Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
toString() - Method in class org.jgrapht.graph.GraphWalk
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.UnorderedVertexPair: Deprecated.
toString() - Method in class org.jgrapht.util.VertexPair: Deprecated.
toStringFromSets(Collection<? extends V>, Collection<? extends E>, boolean) - Method in class org.jgrapht.graph.AbstractGraph: Helper for subclass implementations of toString( ).
touchingVerticesToEdgeMap - Variable in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
touchingVerticesToEdgeMap - Variable in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
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
TreeSingleSourcePathsImpl<V,E> - Class in org.jgrapht.alg.shortestpath: An implementation of ShortestPathAlgorithm.SingleSourcePaths which uses linear space.
TreeSingleSourcePathsImpl(Graph<V, E>, V, Map<V, Pair<Double, E>>) - Constructor for class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl: Construct a new instance.
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.
UndirectedEdgeContainer<V,E> - Class in org.jgrapht.graph.specifics: A container for vertex edges.
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: An undirected version of the read-only union of two graphs.
UndirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph: An undirected graph that is a MaskSubgraph of another graph.
UndirectedMaskSubgraph(UndirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.UndirectedMaskSubgraph: Deprecated.
in favor of using lambdas
UndirectedMaskSubgraph(UndirectedGraph<V, E>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.UndirectedMaskSubgraph: Create a new undirected MaskSubgraph of another graph.
UndirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics: Plain implementation of UndirectedSpecifics.
UndirectedSpecifics(AbstractBaseGraph<V, E>) - Constructor for class org.jgrapht.graph.specifics.UndirectedSpecifics: Construct a new undirected specifics.
UndirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, UndirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.specifics.UndirectedSpecifics: Construct a new undirected specifics.
UndirectedSpecifics(AbstractBaseGraph<V, E>, Map<V, UndirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.UndirectedSpecifics: Construct a new undirected specifics.
UndirectedSubgraph<V,E> - Class in org.jgrapht.graph: An undirected graph that is a subgraph of another graph.
UndirectedSubgraph(UndirectedGraph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph: Creates a new undirected subgraph.
UndirectedSubgraph(UndirectedGraph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph: Creates a new undirected induced subgraph.
UndirectedSubgraph(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph: Creates a new undirected induced subgraph with all vertices included.
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<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph: Creates a new undirected weighted subgraph.
UndirectedWeightedSubgraph(WeightedGraph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph: Creates a new weighted undirected induced subgraph.
UndirectedWeightedSubgraph(WeightedGraph<V, E>) - Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph: Creates a new weighted undirected induced subgraph with all vertices included.
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 the elements in separate 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.
UnorderedPair<A,B> - Class in org.jgrapht.alg.util: Generic unordered pair.
UnorderedPair(A, B) - Constructor for class org.jgrapht.alg.util.UnorderedPair: Create a new unordered pair
UnorderedVertexPair<V> - Class in org.jgrapht.util: Deprecated.
in favor of UnorderedPair
UnorderedVertexPair(V, V) - Constructor for class org.jgrapht.util.UnorderedVertexPair: Deprecated.

Create a unordered new vertex pair
unregisterAttribute(String) - Method in class org.jgrapht.ext.GraphMLExporter: Unregister a GraphML-Attribute
update(T, Map<String, String>) - Method in interface org.jgrapht.ext.ComponentUpdater: Update component with the extra attributes.
update(V, Map<String, String>) - Method in interface org.jgrapht.ext.VertexUpdater: Deprecated.

Update component with the extra attributes.
updateVertex(V, Map<String, String>) - Method in interface org.jgrapht.ext.VertexUpdater: Deprecated.

Update vertex with the extra attributes.

V

v - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex: original vertex
value - Variable in class org.jgrapht.util.ModifiableInteger: The int value represented by this ModifiableInteger.
valueOf(String) - Static method in enum org.jgrapht.alg.util.VertexDegreeComparator.Order: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.CSVFormat.Parameter: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.CSVFormat: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.DIMACSExporter.Parameter: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.DIMACSFormat: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.GmlExporter.Parameter: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.GraphMLExporter.AttributeCategory: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.GraphMLExporter.AttributeType: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum org.jgrapht.ext.MatrixExporter.Format: Returns the enum constant of this type with the specified name.
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.alg.util.VertexDegreeComparator.Order: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.CSVFormat.Parameter: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.CSVFormat: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.DIMACSExporter.Parameter: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.DIMACSFormat: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.GmlExporter.Parameter: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.GraphMLExporter.AttributeCategory: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.GraphMLExporter.AttributeType: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum org.jgrapht.ext.MatrixExporter.Format: Returns an array containing the constants of this enum type, in the order they are declared.
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
VertexAndWeight(Set<V>, double, boolean) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight: Construct a new weighted vertex.
vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
VertexCoverImpl(Set<V>, double) - Constructor for class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
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>, VertexDegreeComparator.Order) - Constructor for class org.jgrapht.alg.util.VertexDegreeComparator: Creates a comparator for comparing the degrees of vertices in the specified graph.
VertexDegreeComparator.Order - Enum in org.jgrapht.alg.util: Order in which we sort the vertices: ascending vertex degree or descending vertex degree
VertexExtension() - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
vertexExtensionManager - Variable 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
vertexHasPredecessors(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs: Check if a vertex has any direct predecessors.
vertexHasSuccessors(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs: Check if a vertex has any direct successors.
vertexList - Variable in class org.jgrapht.graph.GraphWalk
vertexMapDirected - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
vertexMapUndirected - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
vertexMask - Variable in class org.jgrapht.graph.MaskSubgraph
VertexNameProvider<V> - Interface in org.jgrapht.ext: Deprecated.
in favor of ComponentNameProvider
VertexPair<V> - Class in org.jgrapht.util: Deprecated.
in favor of Pair
VertexPair(V, V) - Constructor for class org.jgrapht.util.VertexPair: Deprecated.

Create a new vertex pair
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
VertexScoringAlgorithm<V,D> - Interface in org.jgrapht.alg.interfaces: An interface for all algorithms which assign scores to vertices of a graph.
vertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph: Returns a set of the vertices contained in this graph.
vertexSet() - Method in class org.jgrapht.graph.GraphDelegator: Returns a set of the vertices contained in this graph.
vertexSet() - Method in class org.jgrapht.graph.GraphUnion
vertexSet() - Method in class org.jgrapht.graph.MaskSubgraph: Returns a set of the vertices contained in this graph.
vertexSet - Variable in class org.jgrapht.graph.Subgraph
vertexSet() - Method in class org.jgrapht.graph.Subgraph: Returns a set of the vertices contained in this graph.
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: Deprecated.
vertexToHeapNodeMap - Variable in class org.jgrapht.alg.shortestpath.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: Deprecated.
in favor of ComponentUpdater
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: Set the generator vertices.
vertices - Variable in class org.jgrapht.graph.MaskSubgraph
VF2AbstractIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism: Base implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector: Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector: Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector: Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector: Construct a new base implementation of the VF2 isomorphism inspector.
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: Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector: Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector: Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector: Construct a new VF2 isomorphism inspector.
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: Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector: Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector: Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector: Construct a new VF2 isomorphism inspector.
VisioExporter<V,E> - Class in org.jgrapht.ext: Exports a graph to a CSV format that can be imported into MS Visio.
VisioExporter(ComponentNameProvider<V>) - Constructor for class org.jgrapht.ext.VisioExporter: Creates a new VisioExporter with the specified naming policy.
VisioExporter() - Constructor for class org.jgrapht.ext.VisioExporter: Creates a new VisioExporter.
VisitedArrayImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl: Constructs empty instance
VisitedArrayImpl(DirectedAcyclicGraph.Region) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl: Construct an empty instance for a region.
VisitedArrayListImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
VisitedBitSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
VisitedHashSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl

W

weight - Variable in class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
weight - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
weight - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
weight - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex: weight of the vertex
weight - Variable in class org.jgrapht.graph.GraphWalk
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: A base implementation of a weighted graph generator.
WeightedGraphGenerator() - Constructor for class org.jgrapht.generate.WeightedGraphGenerator
WeightedGraphGeneratorAdapter<V,E,T> - Class in org.jgrapht.generate: 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: Deprecated.
Use MatchingAlgorithm directly
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: Set the weights of the generator
weights - Variable in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
weights(double[][]) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter: Set the weights of the generator.
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 _