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

A

a - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
 
a - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
 
abstractBaseGraph - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
 
abstractBaseGraph - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
 
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.
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
 
AbstractGraphIterator.DirectedSpecifics<VV,​EE> - Class in org.jgrapht.traverse
An implementation of AbstractGraphIterator.Specifics for a directed graph.
AbstractGraphIterator.FlyweightEdgeEvent<VV,​localE> - Class in org.jgrapht.traverse
A reusable edge event.
AbstractGraphIterator.FlyweightVertexEvent<VV> - Class in org.jgrapht.traverse
A reusable vertex event.
AbstractGraphIterator.Specifics<VV,​EE> - Class in org.jgrapht.traverse
Provides unified interface for operations that are different in directed graphs and in undirected graphs.
AbstractGraphIterator.UndirectedSpecifics<VV,​EE> - Class in org.jgrapht.traverse
An implementation of AbstractGraphIterator.Specifics in which edge direction (if any) is ignored.
AbstractPathElement<V,​E> - Class in org.jgrapht.alg
Deprecated.
moved in shortest path package
AbstractPathElement<V,​E> - Class in org.jgrapht.alg.shortestpath
A new path is created from a path concatenated to an edge.
AbstractPathElement(AbstractPathElement<V, E>) - Constructor for class org.jgrapht.alg.AbstractPathElement
Deprecated.
Copy constructor.
AbstractPathElement(AbstractPathElement<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.AbstractPathElement
Copy constructor.
AbstractPathElement(Graph<V, E>, AbstractPathElement<V, E>, E) - Constructor for class org.jgrapht.alg.AbstractPathElement
Deprecated.
Creates a path element by concatenation of an edge to a path element.
AbstractPathElement(Graph<V, E>, AbstractPathElement<V, E>, E) - Constructor for class org.jgrapht.alg.shortestpath.AbstractPathElement
Creates a path element by concatenation of an edge to a path element.
AbstractPathElement(V) - Constructor for class org.jgrapht.alg.AbstractPathElement
Deprecated.
Creates an empty path element.
AbstractPathElement(V) - Constructor for class org.jgrapht.alg.shortestpath.AbstractPathElement
Creates an empty path element.
AbstractPathElementList<V,​E,​T extends AbstractPathElement<V,​E>> - Class in org.jgrapht.alg
Deprecated.
moved in shortest path package
AbstractPathElementList<V,​E,​T extends AbstractPathElement<V,​E>> - Class in org.jgrapht.alg.shortestpath
List of paths AbstractPathElement with same target vertex.
AbstractPathElementList(Graph<V, E>, int, AbstractPathElementList<V, E, T>, E) - Constructor for class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Creates paths obtained by concatenating the specified edge to the specified paths.
AbstractPathElementList(Graph<V, E>, int, AbstractPathElementList<V, E, T>, E) - Constructor for class org.jgrapht.alg.shortestpath.AbstractPathElementList
Creates paths obtained by concatenating the specified edge to the specified paths.
AbstractPathElementList(Graph<V, E>, int, T) - Constructor for class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Creates a list with an empty path.
AbstractPathElementList(Graph<V, E>, int, T) - Constructor for class org.jgrapht.alg.shortestpath.AbstractPathElementList
Creates a list with an empty path.
AbstractPathElementList(Graph<V, E>, int, V) - Constructor for class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Creates an empty list.
AbstractPathElementList(Graph<V, E>, int, V) - Constructor for class org.jgrapht.alg.shortestpath.AbstractPathElementList
Creates an empty list.
active - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
 
add(T) - Method in interface org.jgrapht.traverse.CrossComponentIterator.SimpleContainer
Adds the specified object to this container.
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(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
Add a vertex edge
addEdge(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, E) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
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.
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) - 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) - 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) - 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) - 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) - Method in class org.jgrapht.graph.DefaultListenableGraph
 
addEdge(V, V) - 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) - 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) - Method in class org.jgrapht.graph.Subgraph
Add an edge to the subgraph.
addEdge(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
 
addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase
Adds an weighted edge to the graph being built.
addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase
Adds an weighted edge to the graph being built.
addEdge(V, V, 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, 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, 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, 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, E) - Method in class org.jgrapht.graph.AsUndirectedGraph
 
addEdge(V, V, E) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
Adds the specified edge to the graph being built.
addEdge(V, V, E) - Method in class org.jgrapht.graph.DefaultListenableGraph
 
addEdge(V, V, E) - Method in class org.jgrapht.graph.EdgeReversedGraph
 
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, E) - Method in class org.jgrapht.graph.GraphUnion
Throws UnsupportedOperationException, because GraphUnion is read-only.
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(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, E) - Method in class org.jgrapht.graph.UnmodifiableGraph
 
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, E, double) - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase
Adds the specified weighted edge to the graph being built.
addEdgeChain(V, V, V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
Adds a chain of edges to the graph being built.
addEdgesStartingAt(Graph<V, E>, V, V, boolean) - Method in class org.jgrapht.experimental.GraphSquare
 
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>, 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) - 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>, 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.
addedVertex1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
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.
addNeighbor(V) - Method in class org.jgrapht.alg.NeighborIndex.Neighbors
 
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.
addPair() - Method in class org.jgrapht.alg.isomorphism.VF2State
adds the pair to the current matching.
addPathElements(RankingPathElementList<V, E>, E) - Method in class org.jgrapht.alg.RankingPathElementList
Deprecated.
Adds paths in the list at vertex y.
addPathElements(RankingPathElementList<V, E>, E) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList
Adds paths in the list at vertex y.
addPathToMatchings(List<E>, Set<E>) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
addPathToMatchings(List<E>, Set<E>) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
Deprecated.
 
addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
 
addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
Deprecated.
 
addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
 
addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
 
addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
 
addSquareEdges(Graph<V, E>, boolean) - Method in class org.jgrapht.experimental.GraphSquare
 
addToListenerList(List<L>, L) - Static method in class org.jgrapht.graph.DefaultListenableGraph
 
addToReach(Integer, V, HashMap<Integer, HashSet<V>>) - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Add a vertex to reach.
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.
addUnseenChildrenOf(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
 
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) - 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
 
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.
addVertex1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
addVertex2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
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.
adjEdgesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
adjMatrix - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
adjustVertexWeights(Map<V, List<E>>) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
adjustVertexWeights(Map<V, List<E>>) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
admissibleHeuristic - Variable in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
admissibleHeuristic - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
affectedRegion - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
 
affectedRegion - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
 
Ak - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
AlgorithmDetails(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
AllDirectedPaths<V,​E> - Class in org.jgrapht.alg
Deprecated.
In favor of AllDirectedPaths.
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.AllDirectedPaths
Deprecated.
Create a new instance
AllDirectedPaths(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.AllDirectedPaths
Create a new instance
allowingLoops - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
allowingMultipleEdges - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
allParents(Set<V>) - Method in class org.jgrapht.alg.NaiveLcaFinder
Find the immediate parents of every item in the given set, and return a set containing all those parents
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
 
ancestors - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
 
AnnotatedFlowEdge() - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
ApproximationAlgorithm<ResultType,​V> - Interface in org.jgrapht.experimental.alg
An interface for an approximation algorithm.
areCompatibleEdges(int, int, int, int) - Method in class org.jgrapht.alg.isomorphism.VF2State
checks the edges from v1 to v2 and from u1 to u2 for semantic equivalence
areCompatibleVertexes(int, int) - Method in class org.jgrapht.alg.isomorphism.VF2State
checks the vertices v1 and v2 for semantic equivalence
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(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
Constructs an empty set with the specified initial capacity.
ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
Constructs a set containing the elements of the specified collection.
ArrayUnenforcedSet.SetForEquality - Class in org.jgrapht.util
Multiple inheritance helper.
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
 
ASCENDING - org.jgrapht.alg.util.VertexDegreeComparator.Order
 
assertBellmanFordIterator(Graph<V, E>, V) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
assertBellmanFordIterator(Graph<V, E>, V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
assertGetPath(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
 
assertGetPaths(V) - Method in class org.jgrapht.alg.KShortestPaths
Deprecated.
 
assertKShortestPathsFinder(Graph<V, E>, V, int, int) - Method in class org.jgrapht.alg.KShortestPaths
Deprecated.
 
assertKShortestPathsIterator(Graph<V, E>, V) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
 
assertKShortestPathsIterator(Graph<V, E>, V) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
 
assertNonNegativeEdge(E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
 
assertValidEdge(E) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
assertValidEdge(E) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
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<V,​E> - Class in org.jgrapht.alg.shortestpath
A* shortest path.
AStarShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.AStarShortestPath
Deprecated.
Create a new instance of the A* shortest path algorithm.
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.
atoms - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
The atoms generated by the decomposition
augmentFlow() - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
For all paths which end in the sink.
augmentFlowAlongInternal(double, EdmondsKarpMFImpl.VertexExtension, Set<EdmondsKarpMFImpl.VertexExtension>) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
 

B

b - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
 
B - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
B - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
backtrace - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
backtrace - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
backtrack() - Method in class org.jgrapht.alg.isomorphism.VF2State
removes the last added pair from the matching
backtrack(V, V) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
backwardFrontier - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
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
 
BaseGraphListener() - Constructor for class org.jgrapht.graph.Subgraph.BaseGraphListener
 
BaseShortestPathAlgorithm<V,​E> - Class in org.jgrapht.alg.shortestpath
A base implementation of the shortest path interface.
BaseShortestPathAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
Constructs a new instance of the algorithm for a given graph.
BCGEdge(V, V) - Constructor for class org.jgrapht.alg.BlockCutpointGraph.BCGEdge
 
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.
BellmanFordIterator<V,​E> - Class in org.jgrapht.alg
Deprecated.
moved into shortest path package
BellmanFordIterator<V,​E> - Class in org.jgrapht.alg.shortestpath
Helper class for BellmanFordShortestPath; not intended for general use.
BellmanFordIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
BellmanFordIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
BellmanFordPathElement<V,​E> - Class in org.jgrapht.alg
Deprecated.
moved into shortest path package
BellmanFordPathElement<V,​E> - Class in org.jgrapht.alg.shortestpath
Helper class for BellmanFordShortestPath; not intended for general use.
BellmanFordPathElement(BellmanFordPathElement<V, E>) - Constructor for class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
Copy constructor.
BellmanFordPathElement(BellmanFordPathElement<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordPathElement
Copy constructor.
BellmanFordPathElement(Graph<V, E>, BellmanFordPathElement<V, E>, E, double, double) - Constructor for class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
Creates a path element by concatenation of an edge to a path element.
BellmanFordPathElement(Graph<V, E>, BellmanFordPathElement<V, E>, E, double, double) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordPathElement
Creates a path element by concatenation of an edge to a path element.
BellmanFordPathElement(V, double) - Constructor for class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
Creates an empty path element.
BellmanFordPathElement(V, double) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordPathElement
Creates an empty path element.
BellmanFordShortestPath<V,​E> - Class in org.jgrapht.alg
Deprecated.
BellmanFordShortestPath<V,​E> - Class in org.jgrapht.alg.shortestpath
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.
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.PathElementSingleSourcePaths - Class in org.jgrapht.alg.shortestpath
 
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
 
biconnectedComponentFinished(V, V) - Method in class org.jgrapht.alg.BlockCutpointGraph
 
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.
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.
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.AlgorithmDetails - Class in org.jgrapht.alg
Deprecated.
The implementation details
BidirectionalDijkstraShortestPath.AlgorithmDetails.DirectedSpecifics - Class in org.jgrapht.alg
Deprecated.
 
BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry - Class in org.jgrapht.alg
Deprecated.
 
BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier - Class in org.jgrapht.alg
Deprecated.
Helper class to maintain the search frontier
BidirectionalDijkstraShortestPath.AlgorithmDetails.Specifics - Class in org.jgrapht.alg
Deprecated.
 
BidirectionalDijkstraShortestPath.AlgorithmDetails.UndirectedSpecifics - Class in org.jgrapht.alg
Deprecated.
 
BidirectionalDijkstraShortestPath.DirectedSpecifics - Class in org.jgrapht.alg.shortestpath
 
BidirectionalDijkstraShortestPath.QueueEntry - Class in org.jgrapht.alg.shortestpath
 
BidirectionalDijkstraShortestPath.SearchFrontier - Class in org.jgrapht.alg.shortestpath
Helper class to maintain the search frontier
BidirectionalDijkstraShortestPath.Specifics - Class in org.jgrapht.alg.shortestpath
 
BidirectionalDijkstraShortestPath.UndirectedSpecifics - Class in org.jgrapht.alg.shortestpath
 
bipartiteMatching - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
bipartiteMatching - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
bitfield - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
bitSetCover - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
 
BitSetCover(int, int) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
Construct a new empty vertex cover as a BitSet.
BitSetCover(RecursiveExactVCImpl.BitSetCover) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
Copy constructor
black - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
 
BLACK - org.jgrapht.traverse.CrossComponentIterator.VisitColor
Vertex has been returned via iterator, and we're done with all of its out-edges.
blockCutpointGraph - Variable in class org.jgrapht.alg.BiconnectivityInspector
 
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.
BlockCutpointGraph.BCGEdge - Class in org.jgrapht.alg
 
blocked - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
blocked - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
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.
breadthFirstSearch() - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
Method which finds a path from source to sink the in the residual 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.
bSets - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
bSets - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
build() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
Build the graph.
buildAdjacencyList() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
builder(Class<? extends 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(Class<? extends 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(Class<? extends 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(Class<? extends 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(Class<? extends 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(Class<? extends 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(Class<? extends 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.DefaultDirectedGraph
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(EdgeFactory<V, 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.DirectedPseudograph
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(EdgeFactory<V, 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.Multigraph
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(EdgeFactory<V, 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.SimpleDirectedWeightedGraph
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(EdgeFactory<V, 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.WeightedMultigraph
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.
buildGraphPath(V, V, double) - Method in class org.jgrapht.alg.AStarShortestPath
Deprecated.
Builds the graph path
buildGraphPath(V, V, double) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
Builds the graph path
buildInternal() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
Create internal data structure
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
buildMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Gets costs-matrix as input and returns assignment of tasks (designated by the columns of cost-matrix) to the workers (designated by the rows of the cost-matrix) so that to MINIMIZE total tasks-tackling costs
buildMaximalMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Builds maximal matching corresponding to the given excess-matrix
buildMaximalMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Builds maximal matching corresponding to the given excess-matrix
buildMaximumFlow(V, V) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm
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
 
buildVertexCoverage() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Builds vertex-cover given built up matching
buildVertexCoverage() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Builds vertex-cover given built up matching
buildWalk() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
Build final walk

C

c - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
cacheEdges - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
calculate(V) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
Calculates the LCM as described by http://en.wikipedia.org/wiki/Tarjan's_off-line_lowest_common_ancestors_algorithm function TarjanOLCA(u) MakeSet(u); u.ancestor := u; for each v in u.children do TarjanOLCA(v); Union(u,v); Find(u).ancestor := u; u.colour := black; for each v such that {u,v} in P do if v.colour == black print "Tarjan's Lowest Common Ancestor of " + u + " and " + v + " is " + Find(v).ancestor + ".";
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
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.
calculateCoverRecursively(int, BitSet, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
 
calculateEquivalentFlowTree() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
Runs the algorithm
calculateGomoryHuTree() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
Runs the algorithm
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() - 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(Set<V>, boolean) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
Calculates the minimum odd cut.
calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
calculateMinCut(V, V) - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
Computes a minimum capacity s-t cut.
calculateMinCutWithoutTreeCompression() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
Modified implementation of the algorithm proposed in Odd Minimum Cut-sets and b-matchings by Padberg and Rao.
calculateMinCutWithTreeCompression() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
Implementation of the algorithm proposed in Odd Minimum Cut-sets and b-matchings by Padberg and Rao.
calculatePathCost(V, E) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Costs taken into account are the weights stored in Edge objects.
calculatePathCost(V, E) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Costs taken into account are the weights stored in Edge objects.
calculatePathLength(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
Determine weighted path length to a vertex via an edge, using the path length for the opposite vertex.
calculatePathWeight(RankingPathElement<V, E>, E) - Method in class org.jgrapht.alg.RankingPathElementList
Deprecated.
Costs taken into account are the weights stored in Edge objects.
calculatePathWeight(RankingPathElement<V, E>, E) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList
Costs taken into account are the weights stored in Edge objects.
calculateSourcePartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
Calculate the set of reachable vertices from s in the residual graph.
calculateUpperBound() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Calculates a cheap upper bound on the optimum solution.
cameFrom - Variable in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
cameFrom - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
capacity - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
cascadingCut(FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
Performs a cascading cut operation.
ccFinishedEvent - Variable in class org.jgrapht.traverse.CrossComponentIterator
 
CCS_AFTER_COMPONENT - Static variable in class org.jgrapht.traverse.CrossComponentIterator
 
CCS_BEFORE_COMPONENT - Static variable in class org.jgrapht.traverse.CrossComponentIterator
 
CCS_WITHIN_COMPONENT - Static variable in class org.jgrapht.traverse.CrossComponentIterator
 
ccStartedEvent - Variable in class org.jgrapht.traverse.CrossComponentIterator
 
CENTER_VERTEX - Static variable in class org.jgrapht.generate.StarGraphGenerator
 
checkInputData() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
Checks whether the input data meets the requirements: simple undirected graph and bipartite partitions.
checkInputData() - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
Checks whether the input data meets the requirements: simple undirected graph and bipartite partitions.
checkRadiusTraversal(boolean) - Method in class org.jgrapht.traverse.ClosestFirstIterator
 
child - Variable in class org.jgrapht.util.FibonacciHeapNode
first child node
chordalGraph - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Minimal triangulation of graph
ChromaticNumber - Class in org.jgrapht.alg
Allows the chromatic number of a graph to be calculated.
ChromaticNumber() - Constructor for class org.jgrapht.alg.ChromaticNumber
 
circuit(Integer, HawickJamesSimpleCycles.Operation) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
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.
cleanup() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
Release any memory held.
clear() - Method in class org.jgrapht.util.FibonacciHeap
Removes all elements from this heap.
clearMinSCCState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
clearState() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
clearState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
clearState() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
clearState() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
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.
cliques - Variable in class org.jgrapht.alg.BronKerboschCliqueFinder
 
clone() - Method in class org.jgrapht.graph.AbstractBaseGraph
Returns a shallow copy of this graph instance.
clone() - Method in class org.jgrapht.graph.DefaultListenableGraph
 
clone() - Method in class org.jgrapht.graph.IntrusiveEdge
 
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.
ClosestFirstIterator.QueueEntry<V,​E> - Class in org.jgrapht.traverse
Private data to associate with each entry in the priority queue.
color(int[]) - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
 
cols - Variable in class org.jgrapht.generate.GridGraphGenerator
 
colsVisited - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
Deprecated.
 
colsVisited - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
 
columnMatched - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
``columnMatched[i]'' is the column # of the ZERO matched at the i-th row
columnMatched - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
``columnMatched[i]'' is the column # of the ZERO matched at the i-th row
columnsCovered - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Columns coverage bit-mask
columnsCovered - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Columns coverage bit-mask
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.matching.GreedyWeightedMatching
 
comparator - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
 
comparator - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
 
comparator - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
comparator - Variable in class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree
 
compare(Double, Double) - Method in class org.jgrapht.alg.util.ToleranceDoubleComparator
Compares two floating point values.
compare(T, T) - Method in class org.jgrapht.alg.util.AlwaysEqualComparator
 
compare(V2, V2) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering.GeneralVertexDegreeComparator
 
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.
compare(V, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoComparator
 
compareTo(StoerWagnerMinimumCut.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.
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.
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
computeAtoms() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Compute the unique decomposition of the input graph G (atoms of G).
computeBinaryLog(int) - Method in class org.jgrapht.alg.TransitiveClosure
Computes floor(log_2(n)) + 1
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.
computeMaximumAllowedEdges(int, boolean, boolean, boolean) - Static method in class org.jgrapht.generate.GnmRandomGraphGenerator
Return the number of allowed edges based on the graph type.
computeMinimalTriangulation() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Compute the minimal triangulation of the graph.
computePartialCycle() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
Computes a partial cycle assuming that all vertices have an even degree.
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 class org.jgrapht.alg.ConnectivityInspector.MyTraversalListener
 
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 class org.jgrapht.alg.ConnectivityInspector.MyTraversalListener
 
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 - Variable in class org.jgrapht.alg.ConnectivityInspector
 
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(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.ConnectivityInspector
Creates a connectivity inspector for the specified directed graph.
ConnectivityInspector(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.ConnectivityInspector
Creates a connectivity inspector for the specified undirected graph.
ConnectivityInspector.MyTraversalListener - Class in org.jgrapht.alg
A traversal listener that groups all vertices according to to their containing connected set.
consolidate() - Method in class org.jgrapht.util.FibonacciHeap
Consolidate trees
contains(Object) - Method in class org.jgrapht.graph.MaskEdgeSet
contains(Object) - Method in class org.jgrapht.graph.MaskVertexSet
containsEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
Returns true if this graph contains the specified edge.
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.
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.
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.
contracted - Variable in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
contracted - Variable in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
copy() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
Copy a vertex cover.
copyAsSimpleGraph(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Create a copy of a graph for internal use.
core1 - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
 
core1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
core2 - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
 
core2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
coreLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
CORNER_VERTEX - Static variable in class org.jgrapht.generate.GridGraphGenerator
Role for the vertices at the corners.
cost - Variable in class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
 
cost - Variable in class org.jgrapht.alg.shortestpath.BellmanFordPathElement
 
costMatrix - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Cost matrix
costMatrix - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Cost matrix
COUNT_ONLY - org.jgrapht.alg.cycle.HawickJamesSimpleCycles.Operation
 
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
createBackwardEdge(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
createDirectedSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph
Deprecated.
specifics can be changed by overriding directly AbstractBaseGraph.createSpecifics().
createEdge(MaximumFlowAlgorithmBase.VertexExtensionBase, MaximumFlowAlgorithmBase.VertexExtensionBase, E, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
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
 
createEdgeList(Graph<V, E>, ClosestFirstIterator<V, E>, V, V) - Method in class org.jgrapht.alg.DijkstraShortestPath
Deprecated.
 
createEdgeListPath() - Method in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Returns the path as a list of edges.
createEdgeListPath() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElement
Returns the path as a list of edges.
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.
createEdgeTraversalEvent(E) - Method in class org.jgrapht.traverse.CrossComponentIterator
 
createEdgeTraversalEvent(E) - Method in class org.jgrapht.traverse.RandomWalkIterator
 
createEmptyPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
Create an empty path.
createExtension() - Method in class org.jgrapht.alg.util.extension.ExtensionManager
Creates and returns an extension object.
createGraphEdgeChangeEvent(int, E, V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
 
createGraphSpecifics(Graph<V, E>) - Static method in class org.jgrapht.traverse.AbstractGraphIterator
Creates directed/undirected graph specifics according to the provided graph - directed/undirected, respectively.
createGraphVertexChangeEvent(int, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
 
createIntrusiveEdge(E, V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
 
createPath(double, V) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
createPath(BidirectionalDijkstraShortestPath.SearchFrontier, BidirectionalDijkstraShortestPath.SearchFrontier, double, V, V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
 
createSeenData(V, E) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
The first time we see a vertex, make up a new entry for it.
createSeenData(V, E) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
The first time we see a vertex, make up a new entry for it.
createSeenData(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
The first time we see a vertex, make up a new heap node for it.
createSeenData(V, E, double) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
The first time we see a vertex, make up a new entry for it.
createSeenData(V, E, double) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
The first time we see a vertex, make up a new entry for it.
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.
createVertexData() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
createVertexNumber() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
createVertexTraversalEvent(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
 
createVertexTraversalEvent(V) - Method in class org.jgrapht.traverse.RandomWalkIterator
 
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.SimpleContainer<T> - Interface in org.jgrapht.traverse
 
CrossComponentIterator.VisitColor - Enum in org.jgrapht.traverse
Standard vertex visit state enumeration.
crossComponentTraversal - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
currentConnectedSet - Variable in class org.jgrapht.alg.ConnectivityInspector.MyTraversalListener
 
currentSink - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
 
currentSource - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
 
currentTopoIndex - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
currentVertex - Variable in class org.jgrapht.traverse.RandomWalkIterator
 
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
 
cutpoints - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
cycle(int, int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
CycleDetectedException() - Constructor for exception org.jgrapht.alg.CycleDetector.CycleDetectedException
 
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.
CycleDetector.CycleDetectedException - Exception in org.jgrapht.alg
Exception thrown internally when a cycle is detected during a yes/no cycle test.
CycleDetector.ProbeIterator - Class in org.jgrapht.alg
Version of DFS which maintains a backtracking path used to probe for cycles.
CycleFoundException() - Constructor for exception org.jgrapht.experimental.dag.DirectedAcyclicGraph.CycleFoundException
 
cycles - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
cycles - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
cycles - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
cycles - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
cycleSet - Variable in class org.jgrapht.alg.CycleDetector.ProbeIterator
 

D

d - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
d - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
Damping factor default value.
data - Variable in class org.jgrapht.util.FibonacciHeapNode
Node data.
DEBUG - Static variable in class org.jgrapht.alg.isomorphism.VF2State
 
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.
decrementInDegree(V) - Method in class org.jgrapht.traverse.TopologicalOrderIterator
Decrements the in-degree of a vertex.
DEFAULT_ALLOW_LOOPS - Static variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
DEFAULT_ALLOW_LOOPS - Static variable in class org.jgrapht.generate.GnpRandomGraphGenerator
 
DEFAULT_ALLOW_MULTIPLE_EDGES - Static variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
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.BellmanFordShortestPath
Deprecated.
 
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.shortestpath.BellmanFordShortestPath
 
DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.util.ToleranceDoubleComparator
Default tolerance used by the comparator.
DEFAULT_USE_HEURISTICS - Static variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
Default value on whether to use extra heuristics to improve the result.
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.
DefaultListenableGraph.FlyweightEdgeEvent<VV,​EE> - Class in org.jgrapht.graph
A reuseable edge event.
DefaultListenableGraph.FlyweightVertexEvent<VV> - Class in org.jgrapht.graph
A reuseable vertex event.
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
degree - Variable in class org.jgrapht.util.FibonacciHeapNode
number of children of this node (does not count grandchildren)
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.
delegate - Variable in class org.jgrapht.graph.GraphDelegator
The graph to which operations are delegated.
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.
DESCENDING - org.jgrapht.alg.util.VertexDegreeComparator.Order
 
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.
dfs(V, Map<V, Set<V>>) - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
dfs(V, Map<V, Set<V>>) - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
dfsB(V, Set<V>, DirectedAcyclicGraph.Visited, DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
Depth first search backward, building up the set (db) of back-connected vertices in the Affected Region
dfsF(V, Set<V>, DirectedAcyclicGraph.Visited, DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
Depth first search forward, building up the set (df) of forward-connected vertices in the Affected Region
dfsTree - Variable in class org.jgrapht.alg.BlockCutpointGraph
DFS (Depth-First-Search) tree.
dfsVisit(DirectedGraph<V, E>, GabowStrongConnectivityInspector.VertexNumber<V>) - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
dfsVisit(DirectedGraph<V, E>, KosarajuStrongConnectivityInspector.VertexData<V>, Set<V>) - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
dfsVisit(V, V) - Method in class org.jgrapht.alg.BlockCutpointGraph
 
diagnostic - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
DIAGNOSTIC_ENABLED - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
diameter - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
diameter - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
DijkstraClosestFirstIterator<V,​E> - Class in org.jgrapht.alg.shortestpath
A light-weight version of the closest-first iterator for a directed or undirected graphs.
DijkstraClosestFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
Creates a new iterator for the specified graph.
DijkstraClosestFirstIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
Creates a new radius-bounded iterator for the specified graph.
DijkstraClosestFirstIterator.DirectedSpecifics - Class in org.jgrapht.alg.shortestpath
 
DijkstraClosestFirstIterator.QueueEntry - Class in org.jgrapht.alg.shortestpath
 
DijkstraClosestFirstIterator.Specifics - Class in org.jgrapht.alg.shortestpath
 
DijkstraClosestFirstIterator.UndirectedSpecifics - Class in org.jgrapht.alg.shortestpath
 
DijkstraShortestPath<V,​E> - Class in org.jgrapht.alg
Deprecated.
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.
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.
dim - Variable in class org.jgrapht.generate.HyperCubeGraphGenerator
 
directed - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
 
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(Class<? extends E>, DirectedAcyclicGraph.VisitedFactory, DirectedAcyclicGraph.TopoOrderMappingFactory<V>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
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.TopoComparator<V> - Class in org.jgrapht.experimental.dag
Note, this is a lazy and incomplete implementation, with assumptions that inputs are in the given topoIndexMap
DirectedAcyclicGraph.TopoIterator - Class in org.jgrapht.experimental.dag
iterator which follows topological order
DirectedAcyclicGraph.TopoOrderMapping<V> - Interface in org.jgrapht.experimental.dag
For performance tuning, an interface for storing the topological ordering
DirectedAcyclicGraph.TopoOrderMappingFactory<V> - Interface in org.jgrapht.experimental.dag
DirectedAcyclicGraph.TopoVertexBiMap - Class in org.jgrapht.experimental.dag
a dual HashMap implementation
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.
DirectedEdgeContainer(EdgeSetFactory<V, E>, V) - Constructor for class org.jgrapht.graph.specifics.DirectedEdgeContainer
 
directedGraph - Variable in class org.jgrapht.graph.MixedGraphUnion
 
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>) - Constructor for class org.jgrapht.graph.DirectedGraphUnion
Construct a new directed graph union.
DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - 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>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.DirectedMaskSubgraph
Create a new directed MaskSubgraph of another graph.
DirectedMaskSubgraph(DirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.DirectedMaskSubgraph
Deprecated.
in favor of using lambdas
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(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.DirectedSpecifics
Deprecated.
 
DirectedSpecifics(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.scoring.PageRank.DirectedSpecifics
 
DirectedSpecifics(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DirectedSpecifics
 
DirectedSpecifics(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.DirectedSpecifics
 
DirectedSpecifics(DirectedGraph<VV, EE>) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.DirectedSpecifics
Creates a new DirectedSpecifics object.
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>) - Constructor for class org.jgrapht.graph.DirectedSubgraph
Creates a new directed induced subgraph with all vertices included.
DirectedSubgraph(DirectedGraph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.DirectedSubgraph
Creates a new directed induced subgraph.
DirectedSubgraph(DirectedGraph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.DirectedSubgraph
Creates a new directed subgraph.
DirectedWeightedGraphBuilder<V,​E,​G extends DirectedGraph<V,​E> & WeightedGraph<V,​E>> - Class in org.jgrapht.graph.builder
A builder class for directed weighted graphs}.
DirectedWeightedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.DirectedWeightedGraphBuilder
Creates a builder based on baseGraph.
DirectedWeightedGraphBuilderBase<V,​E,​G extends DirectedGraph<V,​E> & WeightedGraph<V,​E>,​B extends DirectedWeightedGraphBuilderBase<V,​E,​G,​B>> - Class in org.jgrapht.graph.builder
Base class for DirectedWeightedGraphBuilder for extending.
DirectedWeightedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase
Creates a builder based on baseGraph.
DirectedWeightedMultigraph<V,​E> - Class in org.jgrapht.graph
A directed weighted multigraph.
DirectedWeightedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
Creates a new directed weighted multigraph.
DirectedWeightedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
Creates a new directed weighted multigraph with the specified edge factory.
DirectedWeightedPseudograph<V,​E> - Class in org.jgrapht.graph
A directed weighted pseudograph.
DirectedWeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
Creates a new directed weighted pseudograph.
DirectedWeightedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
Creates a new directed weighted pseudograph with the specified edge factory.
DirectedWeightedSubgraph<V,​E> - Class in org.jgrapht.graph
A directed weighted graph that is a subgraph of another graph.
DirectedWeightedSubgraph(WeightedGraph<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph
Creates a new weighted directed induced subgraph with all vertices included.
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>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph
Creates a new weighted directed subgraph.
discharge(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
discharges - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
dischargesCounter - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
doubleValue() - Method in class org.jgrapht.util.ModifiableInteger
 
drawEdge(Set<? extends E>) - Method in class org.jgrapht.traverse.RandomWalkIterator
Randomly draws an edges out of the provided set.
dump() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
DynamicProgrammingPathSolver() - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
 

E

e - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry
Deprecated.
 
e - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
e - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.QueueEntry
 
e - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.QueueEntry
 
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.graph.Subgraph.BaseGraphListener
Notifies that an edge has been added to the graph.
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 - Variable in class org.jgrapht.graph.ClassBasedEdgeFactory
 
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
 
edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
edgeCount() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
Get number of vertex edges
edgeExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
edgeExtensionsFactory - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
 
edgeExtensionsFactory - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
edgeFactory - Variable in class org.jgrapht.generate.WeightedGraphGenerator
 
edgeFactory - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
edgeFactory(EdgeFactory<V, E>) - Method in class org.jgrapht.generate.WeightedGraphGenerator
Set the edge factory of the generator
EdgeFactory<V,​E> - Interface in org.jgrapht
An edge factory used by graphs for creating new edges.
edgeList - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner
Deprecated.
 
edgeList - Variable in class org.jgrapht.alg.KruskalMinimumSpanningTree
Deprecated.
 
edgeList - Variable in class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
edgeList - Variable in class org.jgrapht.graph.GraphWalk
 
edgeMap - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
edgeMask - Variable in class org.jgrapht.graph.MaskEdgeSet
 
edgeMask - Variable in class org.jgrapht.graph.MaskSubgraph
 
edgeMinDistancesBackwards(Set<V>, Integer) - Method in class org.jgrapht.alg.AllDirectedPaths
Deprecated.
Compute the minimum number of edges in a path to the targets through each edge, so long as it is not greater than a bound.
edgeMinDistancesBackwards(Set<V>, Integer) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
Compute the minimum number of edges in a path to the targets through each edge, so long as it is not greater than a bound.
EdgeNode(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode, E, HierholzerEulerianCycle.EdgeNode, HierholzerEulerianCycle.EdgeNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
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.graph.Subgraph.BaseGraphListener
Notifies that an edge has been removed from the graph.
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.alg.interfaces.MatchingAlgorithm.MatchingImpl
 
edges - Variable in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
 
edges - Variable in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
 
edges - Variable in class org.jgrapht.graph.MaskSubgraph
 
edgeSet - Variable in class org.jgrapht.graph.MaskEdgeSet
 
edgeSet - Variable in class org.jgrapht.graph.Subgraph
 
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() - Method in class org.jgrapht.graph.Subgraph
Returns a set of the edges contained in this graph.
edgeSetFactory - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
 
edgeSetFactory - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
 
EdgeSetFactory<V,​E> - Interface in org.jgrapht.graph
A factory for edge sets.
edgesOf(V) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.DirectedSpecifics
Deprecated.
 
edgesOf(V) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.Specifics
Deprecated.
 
edgesOf(V) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.UndirectedSpecifics
Deprecated.
 
edgesOf(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DirectedSpecifics
 
edgesOf(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.Specifics
 
edgesOf(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.UndirectedSpecifics
 
edgesOf(V) - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.DirectedSpecifics
 
edgesOf(V) - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.Specifics
 
edgesOf(V) - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.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.
edgesOf(VV) - Method in class org.jgrapht.traverse.AbstractGraphIterator.DirectedSpecifics
 
edgesOf(VV) - Method in class org.jgrapht.traverse.AbstractGraphIterator.Specifics
Returns the edges outgoing from the specified vertex in case of directed graph, and the edge touching the specified vertex in case of undirected graph.
edgesOf(VV) - Method in class org.jgrapht.traverse.AbstractGraphIterator.UndirectedSpecifics
 
edgesOfIterator(V) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Returns an iterator to loop over outgoing edges Edge of the vertex.
edgesOfIterator(V) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Returns an iterator to loop over outgoing edges Edge of the vertex.
edgesOfIterator(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Returns an iterator to loop over outgoing edges Edge of the vertex.
edgesOfIterator(V) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Returns an iterator to loop over outgoing edges Edge of the 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.
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.
EdmondsBlossomShrinking(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
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.
EdmondsKarpMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
 
element() - Method in class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
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.
encounterStartVertex() - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
encounterStartVertex() - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Initializes the list of paths at the start vertex and adds an empty path.
encounterStartVertex() - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
encounterStartVertex() - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Initializes the list of paths at the start vertex and adds an empty path.
encounterStartVertex() - Method in class org.jgrapht.traverse.CrossComponentIterator
 
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.alg.CycleDetector.ProbeIterator
Called whenever we re-encounter a vertex.
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(List<V>, List<V>) - Method in class org.jgrapht.alg.BronKerboschCliqueFinder
 
END_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
Role for the last vertex generated.
endOfEnumerationReached - Variable in class org.jgrapht.util.PrefetchIterator
 
endVertex - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
End vertex.
endVertex - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
End vertex.
endVertex - Variable in class org.jgrapht.graph.GraphWalk
 
ENUMERATE - org.jgrapht.alg.cycle.HawickJamesSimpleCycles.Operation
 
epsilon - Variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
epsilon - Variable in class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
 
epsilon - Variable in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
 
epsilon - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
epsilon - Variable in class org.jgrapht.alg.shortestpath.BellmanFordPathElement
 
epsilon - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
Tolerance when comparing floating point values.
epsilon - Variable in class org.jgrapht.alg.util.ToleranceDoubleComparator
 
equals(Object) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
equals(Object) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
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.
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.
eulerianHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
ExactAlgorithm<ResultType,​V> - Interface in org.jgrapht.experimental.alg
An interface for an exact algorithm.
excess - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
 
excessMatrix - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Excess matrix
excessMatrix - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Excess matrix
execute(Set<V>, V) - Method in class org.jgrapht.alg.CycleDetector
 
expandNode(FibonacciHeapNode<V>, V) - Method in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
expandNode(FibonacciHeapNode<V>, V) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
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
extend(int) - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
Performs DFS to seek after matching-augmenting path starting at the initial-vertex
extendEqualityGraph() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Extends equality-graph subtracting minimal excess from all the COLUMNS UNCOVERED and adding it to the all ROWS COVERED
extendEqualityGraph() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Extends equality-graph subtracting minimal excess from all the COLUMNS UNCOVERED and adding it to the all ROWS COVERED
extendMatchingEL(int) - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
Deprecated.
DFS helper #1 (applicable for ODD-LENGTH paths ONLY)
extendMatchingEL(int) - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
DFS helper #1 (applicable for ODD-LENGTH paths ONLY)
extendMatchingOL(int, int) - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
Deprecated.
DFS helper #1 (applicable for ODD-LENGTH paths ONLY)
extendMatchingOL(int, int) - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
DFS helper #1 (applicable for ODD-LENGTH paths ONLY)
Extension - Interface in org.jgrapht.alg.util.extension
Class which represents an abstract extension/encapsulation object.
extensionFactory - Variable in class org.jgrapht.alg.util.extension.ExtensionManager
 
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.
externalPathValidator - Variable in class org.jgrapht.alg.RankingPathElementList
Deprecated.
To be used on top of general path validations.
externalPathValidator - Variable in class org.jgrapht.alg.shortestpath.RankingPathElementList
To be used on top of general path validations.

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.
fillEdges - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Fill edges
find(T) - Method in class org.jgrapht.alg.util.UnionFind
Returns the representative element of the set that element is in.
findCliques(List<V>, List<V>, List<V>) - Method in class org.jgrapht.alg.BronKerboschCliqueFinder
 
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.
findCyclesInSCG(int, int, DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
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(Set<V>, Set<V>, LinkedHashSet<V>, LinkedHashSet<V>) - Method in class org.jgrapht.alg.NaiveLcaFinder
Recurse through the descendants of aSet and bSet looking for the LCA of a and b, which are members of sets aSeenSet and bSeenSet respectively, along with all elements on the paths from every member of aSet and bSet
findLca(V, V) - Method in class org.jgrapht.alg.NaiveLcaFinder
Return the first found LCA of a and b
findLcas(V, V) - Method in class org.jgrapht.alg.NaiveLcaFinder
Return all the LCA of a and b.
findMatch() - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
Runs the algorithm on the input graph and returns the match edge set.
findMatch() - Method in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
Runs the algorithm on the input graph and returns the match edge set.
findMinSCSG(int) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
findPath(V) - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
findPath(V) - Method in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
findPathBetween(SimpleWeightedGraph<V, DefaultWeightedEdge>, V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
BFS method to find the edges in the shortest path from a source to a target vertex in a tree graph.
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.
findPathsToVerticesFromVertices(List<V>, boolean, Map<V, List<E>>) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
findPathsToVerticesFromVertices(List<V>, boolean, Map<V, List<E>>) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
findSCCS(int) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
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
 
finishedData - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData1
 
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 - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
 
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.
firstPartition - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
Deprecated.
 
fl - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
flagIsEnumerationStartedEmpty - Variable in class org.jgrapht.util.PrefetchIterator
 
floatValue() - Method in class org.jgrapht.util.ModifiableInteger
 
flow - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
flow - Variable in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
 
flowBack - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
flowMatrix - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
flowMatrix - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
FloydWarshallShortestPaths<V,​E> - Class in org.jgrapht.alg
Deprecated.
FloydWarshallShortestPaths<V,​E> - Class in org.jgrapht.alg.shortestpath
The Floyd-Warshall algorithm.
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(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.
FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths - Class in org.jgrapht.alg.shortestpath
 
FloydWarshallSingleSourcePaths(V) - Constructor for class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
 
FlyweightEdgeEvent(Object, int, EE) - Constructor for class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
 
FlyweightEdgeEvent(Object, localE) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.FlyweightEdgeEvent
 
FlyweightVertexEvent(Object, int, VV) - Constructor for class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
 
FlyweightVertexEvent(Object, VV) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.FlyweightVertexEvent
 
forwardFrontier - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
fromLandmark - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
 
frozen - Variable in class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
True once spanningTreeEdge is guaranteed to be the true minimum.
fullComponentCount - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Map for each separator how many components it produces.

G

g - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
g - Variable in class org.jgrapht.alg.scoring.PageRank
 
g - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
The graph
g - Variable in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree
 
g - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor
 
g1 - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
 
g1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
g1 - Variable in class org.jgrapht.graph.GraphUnion
 
g2 - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
 
g2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
g2 - Variable in class org.jgrapht.graph.GraphUnion
 
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.
GabowStrongConnectivityInspector.VertexNumber<V> - Class in org.jgrapht.alg
 
GeneralVertexDegreeComparator(Graph<V2, ?>) - Constructor for class org.jgrapht.alg.isomorphism.GraphOrdering.GeneralVertexDegreeComparator
 
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, 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.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, 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(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(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.WheelGraphGenerator
Generate a graph structure.
generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, T>) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
Generate a weighted graph structure.
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
 
generatePaths(Set<V>, Set<V>, boolean, Integer, Map<E, Integer>) - Method in class org.jgrapht.alg.AllDirectedPaths
Deprecated.
Generate all paths from the sources to the targets, using pre-computed minimum distances.
generatePaths(Set<V>, Set<V>, boolean, Integer, Map<E, Integer>) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
Generate all paths from the sources to the targets, using pre-computed minimum distances.
generators - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
List of all vertices that generate a minimal separator of chordGraph
get(int) - Method in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Returns path AbstractPathElement stored at the specified index.
get(int) - Method in class org.jgrapht.alg.shortestpath.AbstractPathElementList
Returns path AbstractPathElement stored at the specified index.
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(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(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.
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(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.
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.
getAugmentingPaths() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
getAugmentingPaths() - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
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.
getBiconnectedSubgraphs(V) - Method in class org.jgrapht.alg.BlockCutpointGraph
Returns the biconnected components containing the vertex.
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.
getBSet(V) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
getBSet(V) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
getCost() - Method in class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
Returns the total cost of the path element.
getCost() - Method in class org.jgrapht.alg.shortestpath.BellmanFordPathElement
Returns the total cost of the path element.
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.
getCurrentMapping() - Method in class org.jgrapht.alg.isomorphism.VF2State
 
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.
getDegree() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
Returns the degree of the vertex
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.
getDistance(V) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
getDistance(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
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(int, int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
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.
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
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.
getEdgeList() - Method in class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
getEdgeList() - Method in class org.jgrapht.graph.GraphWalk
 
getEdgeList() - Method in interface org.jgrapht.GraphPath
Returns the edges making up the path.
getEdgeNumbers(E) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
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.
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.
getEndVertex() - Method in class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
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.
getFinishedData() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
getFinishedData() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData1
 
getFinishedData() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData2
 
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.
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 G1
getG2() - Method in class org.jgrapht.graph.GraphUnion
Return G2
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.isomorphism.GraphOrdering
 
getGraph() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
Returns the graph inspected by the StrongConnectivityAlgorithm.
getGraph() - Method in class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
getGraph() - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath.PathElementSingleSourcePaths
 
getGraph() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
 
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
 
getHopCount() - Method in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Returns the number of hops (or number of edges) of the path.
getHopCount() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElement
Returns the number of hops (or number of edges) of the path.
getInEdges(int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
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
 
getIntrusiveEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
 
getInverse() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
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.
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.
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.
getMaximumWeightMatching(Graph<V, E>, LinkedList<E>) - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
Find the maximum weight matching of a path using dynamic programming.
getMaxLabelVertex(Map<V, Integer>) - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Get the vertex with the maximal label.
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.
 
getNeighborList() - Method in class org.jgrapht.alg.NeighborIndex.Neighbors
 
getNeighbors() - Method in class org.jgrapht.alg.NeighborIndex.Neighbors
 
getNeighbors(V) - Method in class org.jgrapht.alg.NeighborIndex
 
getNextElementFromInnerFunctor() - Method in class org.jgrapht.util.PrefetchIterator
Serves as one contact place to the functor; all must use it and not directly the NextElementFunctor.
getNextIndex() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
getNextLastResult - Variable in class org.jgrapht.util.PrefetchIterator
 
getNumber() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector.VertexNumber
 
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.
getNumOrder(V) - Method in class org.jgrapht.alg.BlockCutpointGraph
Returns the traverse order of the vertex in the DFS.
getOppositeVertex(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
getOppositeVertex(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
Gets the vertex opposite another vertex across an edge.
getOrCreate(V) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.MultiMap
 
getOther(V) - Method in class org.jgrapht.util.VertexPair
Deprecated.
Given on of the vertices of the pair, get the other.
getOutEdges(int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
getOutgoing() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
 
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) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
Return the path from the source vertex to the sink vertex.
getPath(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath.PathElementSingleSourcePaths
 
getPath(V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
 
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.
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, 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.
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.
getPathEdgeList(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
Get the shortest path to a vertex.
getPathElement(V) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Returns the path element of the shortest path with less than nMaxHops edges between the start vertex and the end vertex.
getPathElement(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Returns the path element of the shortest path with less than nMaxHops edges between the start vertex and the end vertex.
getPathElements() - Method in class org.jgrapht.alg.RankingPathElementList
Deprecated.
 
getPathElements() - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList
 
getPathElements(V) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Returns the path elements of the ranking shortest paths with less than nMaxHops edges between the start vertex and the end vertex.
getPathElements(V) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Returns the path elements of the ranking shortest paths with less than nMaxHops edges between the start vertex and the end vertex.
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() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
Return the paths computed by this iterator.
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.BaseShortestPathAlgorithm
Compute all shortest paths starting from a single source vertex.
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 interface org.jgrapht.alg.interfaces.KShortestPathAlgorithm
Get a list of shortest paths from a source vertex to a sink 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.BaseShortestPathAlgorithm
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.
getPredecessors(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
 
getPrevEdge() - Method in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Returns the edge reaching the target vertex of the path.
getPrevEdge() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElement
Returns the edge reaching the target vertex of the path.
getPrevPathElement() - Method in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Returns the previous path element.
getPrevPathElement() - Method in class org.jgrapht.alg.RankingPathElement
Deprecated.
Returns the previous path element.
getPrevPathElement() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElement
Returns the previous path element.
getPrevPathElement() - Method in class org.jgrapht.alg.shortestpath.RankingPathElement
Returns the previous path element.
getPrevSeenData(V) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Access the data stored for a seen vertex in the previous pass.
getPrevSeenData(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Access the data stored for a seen vertex in the previous pass.
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
getRemoved(V) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
getRemoved(V) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
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.
getSCCs(int, int) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
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.alg.BellmanFordIterator
Deprecated.
Access the data stored for a seen vertex in the current pass.
getSeenData(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Access the data stored for a seen vertex in the current pass.
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) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
Get the shortest path between two vertices.
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.
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() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
Get all shortest paths in the graph.
getShortestPaths(V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
Get shortest paths from a vertex to all other vertices 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.alg.BlockCutpointGraph.BCGEdge
 
getSource() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
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.BellmanFordShortestPath.PathElementSingleSourcePaths
 
getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
 
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.alg.KShortestPaths.PathWrapper
Deprecated.
 
getStartVertex() - Method in class org.jgrapht.graph.GraphWalk
 
getStartVertex() - Method in interface org.jgrapht.GraphPath
Returns the start vertex in the path.
getSuccessors(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
 
getTarget() - Method in class org.jgrapht.alg.BlockCutpointGraph.BCGEdge
 
getTarget() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
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.TopoVertexBiMap
 
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.TopoVertexBiMap
 
getTopoOrderMapping() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
getTotalWeight(Collection<E>) - Method in class org.jgrapht.traverse.RandomWalkIterator
 
getTreeEdge(V) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
getTreeEdge(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
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.alg.AbstractPathElement
Deprecated.
Returns the target vertex of the path.
getVertex() - Method in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Returns target vertex.
getVertex() - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector.VertexNumber
 
getVertex() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
getVertex() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData1
 
getVertex() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData2
 
getVertex() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElement
Returns the target vertex of the path.
getVertex() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElementList
Returns target vertex.
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(int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
be careful: there's no check against an invalid vertexNumber
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.TopoVertexBiMap
 
getVertex(Integer) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
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
getVertexCount() - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
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>) - 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>) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
 
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>, 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>, Map<V, Double>) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
 
getVertexExtension(V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
 
getVertexExtension(V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
getVertexList() - Method in class org.jgrapht.graph.GraphWalk
 
getVertexList() - Method in interface org.jgrapht.GraphPath
Returns the path as a sequence of vertices.
getVertexNumber(V) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
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.
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() - 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() - Method in class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
getWeight() - Method in class org.jgrapht.alg.RankingPathElement
Deprecated.
Returns the weight of the path.
getWeight() - Method in class org.jgrapht.alg.shortestpath.RankingPathElement
Returns the weight of the path.
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.
getWeight(Collection<V>) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Returns the weight of a collection of vertices.
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(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath.PathElementSingleSourcePaths
 
getWeight(V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
 
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.
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.
gomoryHuTree - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
gomoryHuTree - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
 
graph - Variable in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
 
graph - Variable in class org.jgrapht.alg.AllDirectedPaths
Deprecated.
 
graph - Variable in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
graph - Variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.DirectedSpecifics
Deprecated.
 
graph - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
graph - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.UndirectedSpecifics
Deprecated.
 
graph - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
graph - Variable in class org.jgrapht.alg.BronKerboschCliqueFinder
 
graph - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Source graph to operate on
graph - Variable in class org.jgrapht.alg.ConnectivityInspector
 
graph - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
graph - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
graph - Variable in class org.jgrapht.alg.cycle.PatonCycleBase
 
graph - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
graph - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
graph - Variable in class org.jgrapht.alg.cycle.TiernanSimpleCycles
 
graph - Variable in class org.jgrapht.alg.CycleDetector
Graph on which cycle detection is being performed.
graph - Variable in class org.jgrapht.alg.DirectedNeighborIndex
 
graph - Variable in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
graph - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
graph - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
graph - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner
Deprecated.
 
graph - Variable in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
graph - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering.GeneralVertexDegreeComparator
 
graph - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
graph - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
graph - Variable in class org.jgrapht.alg.KShortestPaths
Deprecated.
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
Deprecated.
 
graph - Variable in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
graph - Variable in class org.jgrapht.alg.matching.GreedyWeightedMatching
 
graph - Variable in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
graph - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
 
graph - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
graph - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
 
graph - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
graph - Variable in class org.jgrapht.alg.NaiveLcaFinder
 
graph - Variable in class org.jgrapht.alg.NeighborIndex
 
graph - Variable in class org.jgrapht.alg.scoring.PageRank.DirectedSpecifics
 
graph - Variable in class org.jgrapht.alg.scoring.PageRank.UndirectedSpecifics
 
graph - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElementList
 
graph - Variable in class org.jgrapht.alg.shortestpath.AllDirectedPaths
 
graph - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
 
graph - Variable in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
 
graph - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DirectedSpecifics
 
graph - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
graph - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.UndirectedSpecifics
 
graph - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.DirectedSpecifics
 
graph - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
graph - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.UndirectedSpecifics
 
graph - Variable in class org.jgrapht.alg.shortestpath.KShortestPaths
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Graph on which shortest paths are searched.
graph - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
The graph
graph - Variable in class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree
 
graph - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
 
graph - Variable in class org.jgrapht.alg.spanning.KruskalMinimumSpanningTree
 
graph - Variable in class org.jgrapht.alg.util.VertexDegreeComparator
The graph that contains the vertices to be compared.
graph - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Input graph
graph - Variable in class org.jgrapht.graph.builder.AbstractGraphBuilder
 
graph - Variable in class org.jgrapht.graph.GraphWalk
 
graph - Variable in class org.jgrapht.graph.MaskEdgeSet
 
graph - Variable in class org.jgrapht.traverse.AbstractGraphIterator.DirectedSpecifics
 
graph - Variable in class org.jgrapht.traverse.AbstractGraphIterator.UndirectedSpecifics
 
graph - Variable in class org.jgrapht.traverse.CrossComponentIterator
 
graph - Variable in class org.jgrapht.traverse.RandomWalkIterator
 
Graph<V,​E> - Interface in org.jgrapht
The root interface in the graph hierarchy.
GRAPH_SPECIFICS_MUST_NOT_BE_NULL - Static variable in class org.jgrapht.graph.AbstractBaseGraph
 
graph1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
 
graph1 - Variable in class org.jgrapht.graph.DefaultGraphMapping
 
graph2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
 
graph2 - Variable in class org.jgrapht.graph.DefaultGraphMapping
 
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.
GraphGenerator<V,​E,​T> - Interface in org.jgrapht.generate
An interface for generating new graph structures.
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.
graphListeners - Variable in class org.jgrapht.graph.DefaultListenableGraph
 
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.
graphMappingForward - Variable in class org.jgrapht.graph.DefaultGraphMapping
 
graphMappingReverse - Variable in class org.jgrapht.graph.DefaultGraphMapping
 
GraphOrdering<V,​E> - Class in org.jgrapht.alg.isomorphism
This class represents the order on the graph vertices.
GraphOrdering(Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.GraphOrdering
 
GraphOrdering(Graph<V, E>, boolean, boolean) - Constructor for class org.jgrapht.alg.isomorphism.GraphOrdering
 
GraphOrdering.GeneralVertexDegreeComparator<V2> - Class in org.jgrapht.alg.isomorphism
 
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: G1 and G2.
GraphUnion(G, G) - Constructor for class org.jgrapht.graph.GraphUnion
Construct a new graph union.
GraphUnion(G, G, WeightCombiner) - 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>, 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<E>, double) - Constructor for class org.jgrapht.graph.GraphWalk
Creates a walk defined by a sequence of edges.
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.
GRAY - org.jgrapht.traverse.CrossComponentIterator.VisitColor
Vertex has been returned via iterator, but we're not done with all of its out-edges yet.
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
greedyMatch() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
Greedily match the vertices in partition1 to the vertices in partition2.
greedyMatch() - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
Greedily match the vertices in partition1 to the vertices in partition2.
GreedyMultiplicativeSpanner<V,​E> - Class in org.jgrapht.alg
Deprecated.
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.GreedyMultiplicativeSpanner
Deprecated.
Constructs instance to compute a (2k-1)-spanner of a graph.
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.
GreedyMultiplicativeSpanner.SpannerAlgorithmBase - Class in org.jgrapht.alg
Deprecated.
 
GreedyMultiplicativeSpanner.SpannerAlgorithmBase - Class in org.jgrapht.alg.spanning
 
GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm - Class in org.jgrapht.alg
Deprecated.
 
GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm - Class in org.jgrapht.alg.spanning
 
GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm - Class in org.jgrapht.alg
Deprecated.
 
GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm - Class in org.jgrapht.alg.spanning
 
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
 
guardVertexToNotDisconnect - Variable in class org.jgrapht.alg.RankingPathElementList
Deprecated.
Vertex that paths of the list must not disconnect.
guardVertexToNotDisconnect - Variable in class org.jgrapht.alg.shortestpath.RankingPathElementList
Vertex that paths of the list must not disconnect.
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.
gusfieldGomoryHuCutTreeAlgorithm - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
 

H

hadOneMapping - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
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
 
hasCapacity() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
hasEdge(int, int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
 
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.
hasExcess() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
 
hashCode() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
hashCode() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
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.alg.BellmanFordIterator
Deprecated.
 
hasNext() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
hasNext() - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
 
hasNext() - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
hasNext() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
hasNext() - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
 
hasNext() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
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.
hasVertexBeenProcessed - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
hasVertexBeenProcessed - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
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.
HawickJamesSimpleCycles.Operation - Enum in org.jgrapht.alg.cycle
 
heap - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
heap - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
Deprecated.
 
heap - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
heap - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
heap - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
 
heap - Variable in class org.jgrapht.traverse.ClosestFirstIterator
Priority queue of fringe vertices.
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
 
HierholzerEulerianCycle.EdgeNode - Class in org.jgrapht.alg.cycle
 
HierholzerEulerianCycle.VertexNode - Class in org.jgrapht.alg.cycle
 
HopcroftKarpBipartiteMatching<V,​E> - Class in org.jgrapht.alg
Deprecated.
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.
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.
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
improve(BellmanFordPathElement<V, E>, E, double) - Method in class org.jgrapht.alg.BellmanFordPathElement
Deprecated.
Returns true if the path has been improved, false otherwise.
improve(BellmanFordPathElement<V, E>, E, double) - Method in class org.jgrapht.alg.shortestpath.BellmanFordPathElement
Returns true if the path has been improved, false otherwise.
in1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
in2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
incoming - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
 
incomingEdges - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
incomingEdgesOf(V) - Method in class org.jgrapht.alg.scoring.PageRank.DirectedSpecifics
 
incomingEdgesOf(V) - Method in class org.jgrapht.alg.scoring.PageRank.Specifics
 
incomingEdgesOf(V) - Method in class org.jgrapht.alg.scoring.PageRank.UndirectedSpecifics
 
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.
incrementDischarges(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
incrementRelabels(int, int) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
inDegreeMap - Variable in class org.jgrapht.traverse.TopologicalOrderIterator
 
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.
index - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
indexMap - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
indexMap - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
init() - Method in class org.jgrapht.alg.ConnectivityInspector
 
init(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
Prepares all data structures to start a new invocation of the Maximum Flow or Minimum Cut algorithms
init(V, V, ExtensionFactory<VE>, ExtensionFactory<MaximumFlowAlgorithmBase.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
initialize() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
set the topoOrderMap based on the current factory, and create the comparator;
initialize(Set<? extends V>, Set<? extends E>) - Method in class org.jgrapht.graph.Subgraph
 
initialize(PushRelabelMFImpl.VertexExtension, PushRelabelMFImpl.VertexExtension, Queue<PushRelabelMFImpl.VertexExtension>) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
Initialization
initialize(AStarAdmissibleHeuristic<V>) - Method in class org.jgrapht.alg.AStarShortestPath
Deprecated.
Initializes the data structures
initialize(AStarAdmissibleHeuristic<V>) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
Initializes the data structures
initialize(DirectedGraph<V, E>, Queue<V>, Map<V, ModifiableInteger>) - Static method in class org.jgrapht.traverse.TopologicalOrderIterator
Initializes the internal traversal object structure.
initialize(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
Index the graph and create a double-linked list representation suitable for vertex and edge removals in constant time.
initialized - Variable in class org.jgrapht.traverse.ClosestFirstIterator
 
initializeVerticesAndEdges() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
initializeVerticesAndEdges() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
initMinSCGState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
initState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
initState() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
initState() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
initState(HawickJamesSimpleCycles.Operation) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
initVisibleVertices() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
Compute all vertices that have positive degree by iterating over the edges on purpose.
innerEnum - Variable in class org.jgrapht.util.PrefetchIterator
 
innerFunctorUsageCounter - Variable in class org.jgrapht.util.PrefetchIterator
 
insert(FibonacciHeapNode<T>, double) - Method in class org.jgrapht.util.FibonacciHeap
Inserts a new data element into the heap.
insertLocation - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
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.
intersection(Set<V>, Set<V>) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
Efficient way to compute the intersection between two sets
interSectionNotEmpty(Set<V>, Set<V>) - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
Helper method which checks whether the intersection of 2 sets is empty.
interSectionNotEmpty(Set<V>, Set<V>) - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
Helper method which checks whether the intersection of 2 sets is empty.
IntrusiveEdge - Class in org.jgrapht.graph
IntrusiveEdge encapsulates the internals for the default edge implementation.
IntrusiveEdge() - Constructor for class org.jgrapht.graph.IntrusiveEdge
 
intValue() - Method in class org.jgrapht.util.ModifiableInteger
 
inverse - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
inwardSpokes - Variable in class org.jgrapht.generate.WheelGraphGenerator
 
isAdmissible(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
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.
isClique(UndirectedGraph<V, E>, Set<V>) - Static method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Check whether the subgraph of graph induced by the given vertices is complete, i.e.
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.
isDirected - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
isDiscovered() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
isEdgeMasked(E) - Method in class org.jgrapht.alg.RankingPathElementList.PathMask
Deprecated.
 
isEdgeMasked(E) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList.PathMask
 
isEdgeMasked(E) - Method in interface org.jgrapht.graph.MaskFunctor
Deprecated.
Returns true if the edge is masked, false otherwise.
isEdgeMatched - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
isEdgeMatched - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
isEmpty() - Method in interface org.jgrapht.traverse.CrossComponentIterator.SimpleContainer
Tests if this container is empty.
isEmpty() - Method in class org.jgrapht.util.FibonacciHeap
Tests if the Fibonacci heap is empty or not.
isEmpty(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
Test whether a graph is empty.
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.
isEqualsStraightOrInverted(Object, Object, E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
 
isEulerian(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
Test whether a graph is Eulerian.
isEulerian(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
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.
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.
isFeasiblePair() - Method in class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismState
 
isFeasiblePair() - Method in class org.jgrapht.alg.isomorphism.VF2State
 
isFeasiblePair() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismState
 
isFinished() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
isGetNextLastResultUpToDate - Variable in class org.jgrapht.util.PrefetchIterator
 
isGoal() - Method in class org.jgrapht.alg.isomorphism.VF2State
 
isGraphConnected() - Method in class org.jgrapht.alg.ConnectivityInspector
Test if the inspected graph is connected.
isGuardVertexDisconnected(RankingPathElement<V, E>) - Method in class org.jgrapht.alg.RankingPathElementList
Deprecated.
Ensures that paths of the list do not disconnect the guard-vertex.
isGuardVertexDisconnected(RankingPathElement<V, E>) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList
Ensures that paths of the list do not disconnect the guard-vertex.
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
 
isNotValidPath(RankingPathElement<V, E>, E) - Method in class org.jgrapht.alg.RankingPathElementList
Deprecated.
 
isNotValidPath(RankingPathElement<V, E>, E) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList
 
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.
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.alg.BellmanFordIterator
Deprecated.
Determines whether a vertex has been seen yet by this traversal.
isSeenVertex(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Determines whether a vertex has been seen yet by this traversal.
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.
isSimplePath(RankingPathElement<V, E>, E) - Method in class org.jgrapht.alg.RankingPathElementList
Deprecated.
Ensures that paths of the list are simple (check that the vertex was not already in the path element).
isSimplePath(RankingPathElement<V, E>, E) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList
Ensures that paths of the list are simple (check that the vertex was not already in the path element).
isSourceVertex(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
isSourceVertex(V) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
Deprecated.
 
isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
Check if two vertices are reachable by a BFS in the spanner graph using only a certain number of hops.
isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
Deprecated.
 
isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
 
isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Check if two vertices are reachable by a BFS in the spanner graph using only a certain number of hops.
isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
 
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.
isTargetVertex(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
isTargetVertex(V) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
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 class org.jgrapht.alg.RankingPathElementList.PathMask
Deprecated.
 
isVertexMasked(V) - Method in class org.jgrapht.alg.shortestpath.RankingPathElementList.PathMask
 
isVertexMasked(V) - Method in interface org.jgrapht.graph.MaskFunctor
Deprecated.
Returns true if the vertex is masked, false otherwise.
isVertexMatched(V, Set<E>) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
isVertexMatched(V, Set<E>) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
isWeaklyConnected(DirectedGraph<V, E>) - Static method in class org.jgrapht.GraphTests
Test whether a directed graph is weakly connected.
isWeighted - Variable in class org.jgrapht.traverse.RandomWalkIterator
 
isWeightedGraph - Variable in class org.jgrapht.graph.AsWeightedGraph
 
it - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath.PathElementSingleSourcePaths
 
iter - Variable in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
 
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.
iterator() - Method in class org.jgrapht.graph.MaskEdgeSet
iterator() - Method in class org.jgrapht.graph.MaskVertexSet
iterator() - Method in class org.jgrapht.util.ArrayUnenforcedSet.SetForEquality
 
iToV - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
iToV - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
iToV - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 

J

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

k - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner
Deprecated.
 
k - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Number of paths stored at each end vertex.
k - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Number of paths stored at each end vertex.
k - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
 
key - Variable in class org.jgrapht.util.FibonacciHeapNode
key value for this node
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.
KosarajuStrongConnectivityInspector.VertexData<V> - Class in org.jgrapht.alg
 
KosarajuStrongConnectivityInspector.VertexData1<V> - Class in org.jgrapht.alg
 
KosarajuStrongConnectivityInspector.VertexData2<V> - Class in org.jgrapht.alg
 
KruskalMinimumSpanningTree<V,​E> - Class in org.jgrapht.alg
Deprecated.
KruskalMinimumSpanningTree<V,​E> - Class in org.jgrapht.alg.spanning
KruskalMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.KruskalMinimumSpanningTree
Deprecated.
Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
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<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, 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.
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>, 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, 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(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.PathWrapper - Class in org.jgrapht.alg
Deprecated.
 
KShortestPathsIterator<V,​E> - Class in org.jgrapht.alg
Deprecated.
Moved in shortest path package
KShortestPathsIterator<V,​E> - Class in org.jgrapht.alg.shortestpath
Helper class for KShortestPaths.
KShortestPathsIterator(Graph<V, E>, V, V, int) - Constructor for class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
 
KShortestPathsIterator(Graph<V, E>, V, V, int) - Constructor for class org.jgrapht.alg.shortestpath.KShortestPathsIterator
 
KShortestPathsIterator(Graph<V, E>, V, V, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
 
KShortestPathsIterator(Graph<V, E>, V, V, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.KShortestPathsIterator
 
KuhnMunkresMatrixImplementation(Graph<V, E>, List<? extends V>, List<? extends V>) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Construct new instance
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
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(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.KuhnMunkresMatrixImplementation<V,​E> - Class in org.jgrapht.alg
Deprecated.
The actual implementation.
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,​E> - Class in org.jgrapht.alg.matching
The actual implementation.
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender - Class in org.jgrapht.alg
Deprecated.
Aggregates utilities to extend matching
KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender - Class in org.jgrapht.alg.matching
Aggregates utilities to extend matching

L

label - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
 
label(PushRelabelMFImpl.VertexExtension, PushRelabelMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
labeling - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
LARGEST_SATURATION_FIRST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
 
largestSaturationFirstOrder() - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
 
lastArcs - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl.VertexExtension
 
lastHopMatrix - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
lastHopMatrix - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
lastInvokedSource - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
lastInvokedSource - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
lastInvokedTarget - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
lastInvokedTarget - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
lazyCalculate() - Method in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
 
lazyCalculateMatrix() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
Calculates the matrix of all shortest paths, but does not populate the paths map.
lazyCalculateMatrix() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
Calculates the matrix of all shortest paths, but does not populate the last hops matrix.
lazyCalculatePaths() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
Calculate the shortest paths (not done per default) TODO: This method can be optimized.
lazyFindConnectedSets() - Method in class org.jgrapht.alg.ConnectivityInspector
 
lca - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
 
LcaRequestResponse(V, V) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
Create a new LCA request response data transfer object.
left - Variable in class org.jgrapht.util.FibonacciHeapNode
left sibling node
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.
LinkedListQueue() - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
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
 
loops - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
loops - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
 
LOOPS_NOT_ALLOWED - Static variable in class org.jgrapht.graph.AbstractBaseGraph
 
lowestCommonAncestor(V, V) - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
lowestCommonAncestor(V, V) - Method in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
lrr - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
 
lrrMap - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
 

M

m - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
 
m - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
makeExcessMatrix() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Composes excess-matrix corresponding to the given cost-matrix
makeExcessMatrix() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Composes excess-matrix corresponding to the given cost-matrix
makePath(List<E>) - Method in class org.jgrapht.alg.AllDirectedPaths
Deprecated.
Transform an ordered list of edges into a GraphPath
makePath(List<E>) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
Transform an ordered list of edges into a GraphPath
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.
mapOrderToVertex - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
mapVertexToOrder - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
mark - Variable in class org.jgrapht.util.FibonacciHeapNode
true if this node has had a child removed since this node was added to its parent
marked - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
marked - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
markedStack - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
markPath(V, V, V, Set<V>) - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
markPath(V, V, V, Set<V>) - Method in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
mask - Variable in class org.jgrapht.graph.MaskVertexSet
 
maskedEdges - Variable in class org.jgrapht.alg.RankingPathElementList.PathMask
Deprecated.
 
maskedEdges - Variable in class org.jgrapht.alg.shortestpath.RankingPathElementList.PathMask
 
MaskEdgeSet<V,​E> - Class in org.jgrapht.graph
Helper for MaskSubgraph.
MaskEdgeSet(Graph<V, E>, Set<E>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.MaskEdgeSet
 
maskedVertices - Variable in class org.jgrapht.alg.RankingPathElementList.PathMask
Deprecated.
 
maskedVertices - Variable in class org.jgrapht.alg.shortestpath.RankingPathElementList.PathMask
 
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>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.MaskSubgraph
Creates a new induced subgraph.
MaskSubgraph(Graph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.MaskSubgraph
Deprecated.
in favor of using the constructor with lambdas
MaskVertexSet<V> - Class in org.jgrapht.graph
Helper for MaskSubgraph.
MaskVertexSet(Set<V>, Predicate<V>) - Constructor for class org.jgrapht.graph.MaskVertexSet
 
match - Variable in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
match - Variable in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
match() - Method in class org.jgrapht.alg.isomorphism.VF2GraphMappingIterator
 
match() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
This function moves over all mappings between graph1 and graph2.
match() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphMappingIterator
 
matchAndCheck() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
MatchExtender(boolean[], boolean[]) - Constructor for class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
Deprecated.
 
MatchExtender(boolean[], boolean[]) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
 
matching - Variable in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
matching - Variable in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
matching - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
Deprecated.
 
matching - Variable in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
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
 
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.
MAX_K - Static variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner
Deprecated.
 
MAX_K - Static variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
 
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
MaximumFlowAlgorithmBase.AnnotatedFlowEdge - Class in org.jgrapht.alg.flow
 
MaximumFlowAlgorithmBase.VertexExtensionBase - Class in org.jgrapht.alg.flow
 
MaximumFlowImpl(Double, Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
Create a new maximum flow
maximumWeightBipartiteMatching() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
maximumWeightBipartiteMatching() - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
MaximumWeightBipartiteMatching<V,​E> - Class in org.jgrapht.alg.matching
This class finds a maximum weight matching of a simple undirected weighted bipartite graph.
MaximumWeightBipartiteMatching<V,​E> - Class in org.jgrapht.alg
Deprecated.
MaximumWeightBipartiteMatching(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
Construct a new instance of the algorithm.
MaximumWeightBipartiteMatching(WeightedGraph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
Creates a new MaximumWeightBipartiteMatching algorithm instance.
maximumWeightOfEdgeIncidentToVertex(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
maximumWeightOfEdgeIncidentToVertex(V) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
maxMatching() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
This method is the main method of the class.
maxMatching() - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
This method is the main method of the class.
maxSize - Variable in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Max number of stored paths.
maxSize - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElementList
Max number of stored paths.
maxSteps - Variable in class org.jgrapht.traverse.RandomWalkIterator
 
maxTopoIndex - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
memo - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Map for memoization
meo - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Minimal elimination ordering on the vertices of graph
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
minimal(int[], boolean[], boolean[]) - Static method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Assures given column-n-rows-coverage/zero-matching to be minimal/maximal
minimal(int[], boolean[], boolean[]) - Static method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Assures given column-n-rows-coverage/zero-matching to be minimal/maximal
minimumCutPhase(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
Implements the MinimumCutPhase function of Stoer and Wagner.
minimumCutWeight - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
 
MinimumSpanningTree<V,​E> - Interface in org.jgrapht.alg.interfaces
Deprecated.
minimumSpanningTreeEdgeSet - Variable in class org.jgrapht.alg.PrimMinimumSpanningTree
Deprecated.
Minimum Spanning-Tree/Forest edge set
minimumSpanningTreeTotalWeight - Variable in class org.jgrapht.alg.PrimMinimumSpanningTree
Deprecated.
Minimum Spanning-Tree/Forest edge set overall weight
minimumSTCutAlgorithm - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
minimumSTCutAlgorithm - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
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.
minNode - Variable in class org.jgrapht.util.FibonacciHeap
Points to the minimum node in the heap.
minTopoIndex - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
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>) - Constructor for class org.jgrapht.graph.MixedGraphUnion
Construct a new graph union.
MixedGraphUnion(UndirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - 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.
moveToFront(HierholzerEulerianCycle.VertexNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
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.
MultiMap() - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor.MultiMap
 
multipleEdges - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
MyTraversalListener() - Constructor for class org.jgrapht.alg.ConnectivityInspector.MyTraversalListener
 

N

n - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
n - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
 
N - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
N - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
N - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Number of vertices in the graph
n1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
n1 - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
 
n1 - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
 
n1 - Variable in class org.jgrapht.util.VertexPair
Deprecated.
 
n2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
n2 - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
 
n2 - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
 
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
 
nCycles - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
NEGATIVE_UNDIRECTED_EDGE - Static variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Error message.
NEGATIVE_UNDIRECTED_EDGE - Static variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Error message.
neighborCounts - Variable in class org.jgrapht.alg.NeighborIndex.Neighbors
 
neighborIndex - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Neighbor cache TODO JK: It might be worth trying to replace the neighbors index by a bitset view.
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.
NeighborIndex.Neighbors<V> - Class in org.jgrapht.alg
Stores cached neighbors for a single 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.
neighborListOf(V) - Method in class org.jgrapht.alg.NeighborIndex
Returns a list of vertices which are adjacent to a specified vertex.
neighborMap - Variable in class org.jgrapht.alg.NeighborIndex
 
neighbors - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
neighbors - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
Map of neighbors, and a count of the number of edges to this neighbor
Neighbors(Collection<V>) - Constructor for class org.jgrapht.alg.NeighborIndex.Neighbors
 
neighborSet - Variable in class org.jgrapht.alg.NeighborIndex.Neighbors
 
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.GusfieldGomoryHuCutTree
 
network - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
network - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
 
next - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
next - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
next() - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Returns the list Collection of vertices whose path has been improved during the current pass.
next() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
next() - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Returns the list of vertices whose path has been improved during the current pass.
next() - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Returns the list Collection of vertices whose path has been improved during the current pass.
next() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
next() - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Returns the list of vertices whose path has been improved during the current pass.
next() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
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.
nextIndex - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
nextMapping - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
nextPair() - Method in class org.jgrapht.alg.isomorphism.VF2State
calculates a pair of nodes which may be added to the current matching, according to the VF2 algorithm.
nHops - Variable in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Number of hops of the path.
nHops - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElement
Number of hops of the path.
nListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
nMaxHops - Variable in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
Maximum number of edges of the calculated paths.
nMaxHops - Variable in class org.jgrapht.alg.KShortestPaths
Deprecated.
 
nMaxHops - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
Maximum number of edges of the calculated paths.
nMaxHops - Variable in class org.jgrapht.alg.shortestpath.KShortestPaths
 
nNodes - Variable in class org.jgrapht.util.FibonacciHeap
Number of nodes in the heap.
NO_EDGE_ADD - Static variable in class org.jgrapht.graph.AsUndirectedGraph
 
NO_SUCH_EDGE_IN_BASE - Static variable in class org.jgrapht.graph.Subgraph
 
NO_SUCH_VERTEX_IN_BASE - Static variable in class org.jgrapht.graph.Subgraph
 
noCycle(int, int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
nodes - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
Deprecated.
 
nodes - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
 
NOT_IN_DIRECTED_GRAPH - Static variable in class org.jgrapht.graph.specifics.DirectedSpecifics
 
NOT_IN_UNDIRECTED_GRAPH - Static variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
 
nPaths - Variable in class org.jgrapht.alg.KShortestPaths
Deprecated.
 
nPaths - Variable in class org.jgrapht.alg.shortestpath.KShortestPaths
 
nShortestPaths - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
nShortestPaths - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
NULL_NODE - Static variable in class org.jgrapht.alg.isomorphism.VF2State
 
number - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector.VertexNumber
 
numberOfExpandedNodes - Variable in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
numberOfExpandedNodes - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
numOrder - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
nVertices - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 

O

oddVertices - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
 
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.
offer(T) - Method in class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
ONEOVERLOGPHI - Static variable in class org.jgrapht.util.FibonacciHeap
 
openList - Variable in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
openList - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
Operation() - Constructor for enum org.jgrapht.alg.cycle.HawickJamesSimpleCycles.Operation
 
operator - Variable in class org.jgrapht.graph.GraphUnion
 
order - Variable in class org.jgrapht.alg.util.VertexDegreeComparator
Order in which the vertices are sorted: ascending or descending
order - Variable in class org.jgrapht.generate.StarGraphGenerator
 
Order() - Constructor for enum org.jgrapht.alg.util.VertexDegreeComparator.Order
 
orderedVertices - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
ordering1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
 
ordering1 - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
ordering2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
 
ordering2 - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
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.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.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.
originalToExtensionMap - Variable in class org.jgrapht.alg.util.extension.ExtensionManager
 
out1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
out2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
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.
outgoing - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
 
outgoing - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
 
outgoingEdges - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
outgoingEdgesOf(V) - Method in class org.jgrapht.alg.scoring.PageRank.DirectedSpecifics
 
outgoingEdgesOf(V) - Method in class org.jgrapht.alg.scoring.PageRank.Specifics
 
outgoingEdgesOf(V) - Method in class org.jgrapht.alg.scoring.PageRank.UndirectedSpecifics
 
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.
overlappingMember(Set<V>, Set<V>) - Method in class org.jgrapht.alg.NaiveLcaFinder
Return a single vertex that is both in x and y.

P

p - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
p - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
p - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
 
p - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
 
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.
PageRank.DirectedSpecifics - Class in org.jgrapht.alg.scoring
 
PageRank.Specifics - Class in org.jgrapht.alg.scoring
 
PageRank.UndirectedSpecifics - Class in org.jgrapht.alg.scoring
 
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.
parent - Variable in class org.jgrapht.util.FibonacciHeapNode
parent node
parentMap - Variable in class org.jgrapht.alg.util.UnionFind
 
partition1 - Variable in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
partition1 - Variable in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
partition1 - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
 
partition1 - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
partition1 - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
partition2 - Variable in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
partition2 - Variable in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
partition2 - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
 
partition2 - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
partition2 - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
passNumber - Variable in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
 
passNumber - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Stores the number of the path.
passNumber - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Stores the number of the path.
path - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath
Deprecated.
 
path - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
path - Variable in class org.jgrapht.alg.CycleDetector.ProbeIterator
 
path - Variable in class org.jgrapht.alg.DijkstraShortestPath
Deprecated.
 
path - Variable in class org.jgrapht.alg.EdmondsBlossomShrinking
Deprecated.
 
path - Variable in class org.jgrapht.alg.matching.EdmondsBlossomShrinking
 
path2disconnect - Variable in class org.jgrapht.alg.RankingPathElementList
Deprecated.
 
path2disconnect - Variable in class org.jgrapht.alg.shortestpath.RankingPathElementList
 
pathElements - Variable in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Stored paths, list of AbstractPathElement.
pathElements - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElementList
Stored paths, list of AbstractPathElement.
PathElementSingleSourcePaths(BellmanFordIterator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath.PathElementSingleSourcePaths
 
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.
PathGrowingWeightedMatching.DynamicProgrammingPathSolver - Class in org.jgrapht.alg.matching
Helper class for repeatedly solving the maximum weight matching on paths.
PathMask(RankingPathElement<V, E>) - Constructor for class org.jgrapht.alg.RankingPathElementList.PathMask
Deprecated.
Creates a mask for all the edges and the vertices of the path (including the 2 extremity vertices).
PathMask(RankingPathElement<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList.PathMask
Creates a mask for all the edges and the vertices of the path (including the 2 extremity vertices).
paths - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
paths - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
One path per vertex
pathSet - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
pathValidator - Variable in class org.jgrapht.alg.KShortestPaths
Deprecated.
 
pathValidator - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Performs path validations in addition to the basics (source and target are connected w/o loops)
pathValidator - Variable in class org.jgrapht.alg.shortestpath.KShortestPaths
 
pathValidator - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Performs path validations in addition to the basics (source and target are connected w/o loops)
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.
PathWrapper(RankingPathElement<V, E>) - Constructor for class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
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.
peek() - Method in class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
pointStack - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
poll() - Method in class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
populateLastHopMatrix() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
Populate the last hop matrix, using the earlier computed backtrace matrix.
populateLastHopMatrix() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
Populate the last hop matrix, using the earlier computed backtrace matrix.
position - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
precomputeToFromLandmark(V) - Method in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
Compute all distances to and from a landmark
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.
predecessorListOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
Returns the set of vertices which are the predecessors of a specified vertex.
predecessorMap - Variable in class org.jgrapht.alg.DirectedNeighborIndex
 
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.
prev - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
prev - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
prevEdge - Variable in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Edge reaching the target vertex of the path.
prevEdge - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElement
Edge reaching the target vertex of the path.
prevImprovedVertices - Variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Vertices whose shortest path cost have been improved during the previous pass.
prevImprovedVertices - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Vertices whose ranking shortest paths have been modified during the previous pass.
prevImprovedVertices - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Vertices whose shortest path cost have been improved during the previous pass.
prevImprovedVertices - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Vertices whose ranking shortest paths have been modified during the previous pass.
prevPathElement - Variable in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Previous path element.
prevPathElement - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElement
Previous path element.
prevSeenDataContainer - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Stores the paths that improved the vertex in the previous pass.
prevSeenDataContainer - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Stores the paths that improved the vertex in the previous pass.
prevVertexData - Variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
prevVertexData - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
PrimMinimumSpanningTree<V,​E> - Class in org.jgrapht.alg
Deprecated.
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.PrimMinimumSpanningTree
Deprecated.
Create and execute a new instance of Prim's algorithm.
PrimMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.spanning.PrimMinimumSpanningTree
Construct a new instance of the algorithm.
PRINT_ONLY - org.jgrapht.alg.cycle.HawickJamesSimpleCycles.Operation
 
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.
ProbeIterator(Set<V>, V) - Constructor for class org.jgrapht.alg.CycleDetector.ProbeIterator
 
prototype - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
prototype - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
 
provideNextVertex() - Method in class org.jgrapht.alg.CycleDetector.ProbeIterator
Returns the vertex to be returned in the following call to the iterator next method.
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.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
Increase flow in the direction denoted by edge (u,v).
pushFlowThrough(MaximumFlowAlgorithmBase.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
Push flow through an edge.
PushRelabelDiagnostic() - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
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.PushRelabelDiagnostic - Class in org.jgrapht.alg.flow
 
PushRelabelMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
Vertex extension for the push-relabel algorithm, which contains an additional label.
putPrevSeenData(V, BellmanFordPathElement<V, E>) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
putPrevSeenData(V, BellmanFordPathElement<V, E>) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
putSeenData(V, D) - Method in class org.jgrapht.traverse.CrossComponentIterator
Stores iterator-dependent data for a vertex that has been seen.
putSeenData(V, BellmanFordPathElement<V, E>) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Stores iterator-dependent data for a vertex that has been seen during the current pass.
putSeenData(V, BellmanFordPathElement<V, E>) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Stores iterator-dependent data for a vertex that has been seen during the current pass.
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.TopoVertexBiMap
 
putVertex(Integer, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 

Q

queue - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
 
queue - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
 
queue - Variable in class org.jgrapht.traverse.BreadthFirstIterator
 
queue - Variable in class org.jgrapht.traverse.TopologicalOrderIterator
 
QueueEntry() - Constructor for class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
 
QueueEntry(E, V) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry
Deprecated.
 
QueueEntry(E, V) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.QueueEntry
 
QueueEntry(E, V) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.QueueEntry
 

R

radius - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
radius - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
 
radius - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
radius - Variable in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
 
radius - Variable in class org.jgrapht.traverse.ClosestFirstIterator
Maximum distance to search.
random - Variable in class org.jgrapht.generate.ScaleFreeGraphGenerator
 
random - Variable in class org.jgrapht.traverse.RandomWalkIterator
 
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.
rankingPathElement - Variable in class org.jgrapht.alg.KShortestPaths.PathWrapper
Deprecated.
 
RankingPathElement<V,​E> - Class in org.jgrapht.alg
Deprecated.
Use RankingPathElement instead.
RankingPathElement<V,​E> - Class in org.jgrapht.alg.shortestpath
Helper class for KShortestPaths.
RankingPathElement(Graph<V, E>, RankingPathElement<V, E>, E, double) - Constructor for class org.jgrapht.alg.RankingPathElement
Deprecated.
Creates a path element by concatenation of an edge to a path element.
RankingPathElement(Graph<V, E>, RankingPathElement<V, E>, E, double) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElement
Creates a path element by concatenation of an edge to a path element.
RankingPathElement(V) - Constructor for class org.jgrapht.alg.RankingPathElement
Deprecated.
Creates an empty path element.
RankingPathElement(V) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElement
Creates an empty path element.
RankingPathElementList<V,​E> - Class in org.jgrapht.alg
Deprecated.
Use RankingPathElement instead.
RankingPathElementList<V,​E> - Class in org.jgrapht.alg.shortestpath
List of simple paths in increasing order of weight.
RankingPathElementList(Graph<V, E>, int, RankingPathElement<V, E>) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates a list with an empty path.
RankingPathElementList(Graph<V, E>, int, RankingPathElement<V, E>, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates a list with an empty path.
RankingPathElementList(Graph<V, E>, int, RankingPathElementList<V, E>, E) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V, E>, int, RankingPathElementList<V, E>, E, V) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V, E>, int, RankingPathElementList<V, E>, E, V, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V, E>, int, RankingPathElement<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates a list with an empty path.
RankingPathElementList(Graph<V, E>, int, RankingPathElement<V, E>, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates a list with an empty path.
RankingPathElementList(Graph<V, E>, int, RankingPathElementList<V, E>, E) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V, E>, int, RankingPathElementList<V, E>, E, V) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V, E>, int, RankingPathElementList<V, E>, E, V, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V, E>, int, V) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates an empty list.
RankingPathElementList(Graph<V, E>, int, V) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates an empty list.
RankingPathElementList(Graph<V, E>, int, V, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.RankingPathElementList
Deprecated.
Creates an empty list.
RankingPathElementList(Graph<V, E>, int, V, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.RankingPathElementList
Creates an empty list.
RankingPathElementList.PathMask<V,​E> - Class in org.jgrapht.alg
Deprecated.
 
RankingPathElementList.PathMask<V,​E> - Class in org.jgrapht.alg.shortestpath
 
rankMap - Variable in class org.jgrapht.alg.util.UnionFind
 
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
reach - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
READ_ONLY - Static variable in class org.jgrapht.graph.GraphUnion
 
recordFinish() - Method in class org.jgrapht.traverse.DepthFirstIterator
 
recursiveColor(int) - Method in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
 
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.
reducedWeight(E) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
reducedWeight(E) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
region - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
 
Region(int, int) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
Construct a new region.
relabel(PushRelabelMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
relabels - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
relabelsCounter - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
 
relaxVertex(V, E) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Upates data first time a vertex is reached by a path.
relaxVertex(V, E) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Upates data first time a vertex is reached by a path.
relaxVertexAgain(V, E) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Check if the cost of the best path so far reaching the specified vertex could be improved if the vertex is reached through the specified edge.
relaxVertexAgain(V, E) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Check if the cost of the best path so far reaching the specified vertex could be improved if the vertex is reached through the specified edge.
remove() - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Unsupported
remove() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
remove() - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Unsupported.
remove() - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Unsupported
remove() - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Unsupported.
remove() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
remove() - Method in class org.jgrapht.traverse.AbstractGraphIterator
Unsupported.
remove() - Method in interface org.jgrapht.traverse.CrossComponentIterator.SimpleContainer
Remove an object from this container and return it.
remove() - Method in interface org.jgrapht.traverse.GraphIterator
Unsupported.
remove() - Method in class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
remove() - Method in class org.jgrapht.util.PrefetchIterator
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.experimental.GraphSquare
Removes all the edges in this graph that are also contained in the specified edge collection.
removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.AbstractGraph
 
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(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(Collection<? extends E>) - Method in class org.jgrapht.graph.UnmodifiableGraph
 
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(V, V) - Method in class org.jgrapht.graph.AbstractGraph
 
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(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(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
 
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.TopoVertexBiMap
 
removeAllVertices() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
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
 
removed - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
removed - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
removeEdge(E) - Method in class org.jgrapht.experimental.GraphSquare
Removes the specified edge from the graph.
removeEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
Removes the specified edge from the graph.
removeEdge(E) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
Removes the specified edge from the graph.
removeEdge(E) - Method in class org.jgrapht.graph.DefaultListenableGraph
 
removeEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
Removes the specified edge from the graph.
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(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(E) - Method in class org.jgrapht.graph.UnmodifiableGraph
 
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(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
Removes an edge going from source vertex to target vertex from the graph being built, if such vertices and such edge exist in the graph.
removeEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
 
removeEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
 
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(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(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(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.
removeFromList(List<Integer>, Integer) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
Remove all occurrences of a value from the list.
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.
removeNeighbor(V) - Method in class org.jgrapht.alg.NeighborIndex.Neighbors
 
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.TopoVertexBiMap
 
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>, Iterable<V>) - Static method in class org.jgrapht.Graphs
Removes all the given vertices from the given graph.
removeVertexAndPreserveConnectivity(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs
Removes the given vertex 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.
reorder(Set<V>, Set<V>, DirectedAcyclicGraph.Visited) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
resetAddVertexes() - Method in class org.jgrapht.alg.isomorphism.VF2State
 
resetVertexData() - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
reusableEdgeEvent - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
reusableVertexEvent - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
reuseableEdgeEvent - Variable in class org.jgrapht.graph.DefaultListenableGraph
 
reuseableVertexEvent - Variable in class org.jgrapht.graph.DefaultListenableGraph
 
reuseEvents - Variable in class org.jgrapht.graph.DefaultListenableGraph
 
reuseEvents - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
reverse - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
right - Variable in class org.jgrapht.util.FibonacciHeapNode
right sibling node
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.
rng - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
 
rng - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
 
rng - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
 
rng - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
 
root - Variable in class org.jgrapht.alg.CycleDetector.ProbeIterator
 
rowMatched - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
``rowMatched[j]'' is the row # of the ZERO matched at the j-th column
rowMatched - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
``rowMatched[j]'' is the row # of the ZERO matched at the j-th column
rows - Variable in class org.jgrapht.generate.GridGraphGenerator
 
rowsCovered - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Rows coverage bit-mask
rowsCovered - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Rows coverage bit-mask
rowsVisited - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
Deprecated.
 
rowsVisited - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
 
run() - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
run() - Method in class org.jgrapht.alg.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
Deprecated.
 
run() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
 
run() - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
 
run(double, int, double) - Method in class org.jgrapht.alg.scoring.PageRank
 
runWithHeuristics() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
 

S

savePassData(List<V>) - Method in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
savePassData(List<V>) - Method in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
savePassData(Set<V>) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
 
savePassData(Set<V>) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
 
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.
SCCs - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
scores - Variable in class org.jgrapht.alg.scoring.PageRank
 
SearchFrontier(Graph<V, E>) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
SearchFrontier(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
second - Variable in class org.jgrapht.alg.util.Pair
The second pair element
second - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
 
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.
secondPartition - Variable in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
Deprecated.
 
seed - Variable in class org.jgrapht.generate.ScaleFreeGraphGenerator
 
seen - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
seen - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
seen - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
seen - Variable in class org.jgrapht.traverse.CrossComponentIterator
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.
seenDataContainer - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.
seenDataContainer - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.
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.
separators - Variable in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
Set of clique minimal separators
serialVersionUID - Static variable in class org.jgrapht.alg.BlockCutpointGraph.BCGEdge
 
serialVersionUID - Static variable in class org.jgrapht.alg.BlockCutpointGraph
 
serialVersionUID - Static variable in exception org.jgrapht.alg.CycleDetector.CycleDetectedException
 
serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
 
serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
 
serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
 
serialVersionUID - Static variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
 
serialVersionUID - Static variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
 
serialVersionUID - Static variable in class org.jgrapht.alg.util.Pair
 
serialVersionUID - Static variable in class org.jgrapht.alg.util.UnorderedPair
 
serialVersionUID - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
 
serialVersionUID - Static variable in class org.jgrapht.event.EdgeTraversalEvent
 
serialVersionUID - Static variable in class org.jgrapht.event.GraphChangeEvent
 
serialVersionUID - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
 
serialVersionUID - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
 
serialVersionUID - Static variable in class org.jgrapht.event.VertexTraversalEvent
 
serialVersionUID - Static variable in exception org.jgrapht.experimental.dag.DirectedAcyclicGraph.CycleFoundException
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoComparator
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexBiMap
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
 
serialVersionUID - Static variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
 
serialVersionUID - Static variable in class org.jgrapht.experimental.GraphSquare
 
serialVersionUID - Static variable in class org.jgrapht.graph.AbstractBaseGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.AsUndirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.AsUnweightedDirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.AsUnweightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.AsWeightedDirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.AsWeightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.ClassBasedEdgeFactory
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultDirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultDirectedWeightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultEdge
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultListenableGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DefaultWeightedEdge
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedGraphUnion
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedMultigraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedPseudograph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedSubgraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedWeightedMultigraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedWeightedPseudograph
 
serialVersionUID - Static variable in class org.jgrapht.graph.DirectedWeightedSubgraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.EdgeReversedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.GraphDelegator
 
serialVersionUID - Static variable in class org.jgrapht.graph.GraphUnion
 
serialVersionUID - Static variable in class org.jgrapht.graph.IntrusiveEdge
 
serialVersionUID - Static variable in class org.jgrapht.graph.ListenableDirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.ListenableDirectedWeightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.ListenableUndirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.ListenableUndirectedWeightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.MaskEdgeSet
 
serialVersionUID - Static variable in class org.jgrapht.graph.MaskVertexSet
 
serialVersionUID - Static variable in class org.jgrapht.graph.MixedGraphUnion
 
serialVersionUID - Static variable in class org.jgrapht.graph.Multigraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.ParanoidGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.Pseudograph
 
serialVersionUID - Static variable in class org.jgrapht.graph.SimpleDirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.SimpleDirectedWeightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.SimpleGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.SimpleWeightedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.DirectedSpecifics
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
 
serialVersionUID - Static variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
 
serialVersionUID - Static variable in class org.jgrapht.graph.Subgraph.BaseGraphListener
 
serialVersionUID - Static variable in class org.jgrapht.graph.Subgraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.UndirectedGraphUnion
 
serialVersionUID - Static variable in class org.jgrapht.graph.UndirectedSubgraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.UndirectedWeightedSubgraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.UnmodifiableDirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.UnmodifiableGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.UnmodifiableUndirectedGraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.WeightedMultigraph
 
serialVersionUID - Static variable in class org.jgrapht.graph.WeightedPseudograph
 
serialVersionUID - Static variable in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightEdgeEvent
 
serialVersionUID - Static variable in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightVertexEvent
 
serialVersionUID - Static variable in class org.jgrapht.traverse.TopologicalOrderIterator.LinkedListQueue
 
serialVersionUID - Static variable in class org.jgrapht.util.ArrayUnenforcedSet
 
serialVersionUID - Static variable in class org.jgrapht.util.ModifiableInteger
 
serialVersionUID - Static variable in class org.jgrapht.util.UnorderedVertexPair
Deprecated.
 
serialVersionUID - Static variable in class org.jgrapht.util.VertexPair
Deprecated.
 
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
 
setDiscovered(boolean) - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
setEdge(EE) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
Sets the edge of this event.
setEdge(localE) - Method in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightEdgeEvent
Sets the edge of this event.
setEdgeSource(VV) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
 
setEdgeTarget(VV) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
 
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.
setFinished(boolean) - Method in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
SetForEquality() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet.SetForEquality
 
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(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 class org.jgrapht.alg.cycle.PatonCycleBase
Sets the graph on which the cycle base 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.
setLca(V) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
 
setNumber(int) - Method in class org.jgrapht.alg.GabowStrongConnectivityInspector.VertexNumber
 
setNumOrder(V, int) - Method in class org.jgrapht.alg.BlockCutpointGraph
 
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.
setSource(MaximumFlowAlgorithmBase.VertexExtensionBase) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
setTarget(MaximumFlowAlgorithmBase.VertexExtensionBase) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
setType(int) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
Set the event type of this event.
setType(int) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
Set the event type of this event.
setValue(int) - Method in class org.jgrapht.util.ModifiableInteger
Sets a new value for this modifiable integer.
setVertex(VV) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
Sets the vertex of this event.
setVertex(VV) - Method in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightVertexEvent
Sets the vertex of this event.
setVertexWeight(V, Long) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
setVertexWeight(V, Long) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
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.
showLog(String, String) - Method in class org.jgrapht.alg.isomorphism.VF2State
creates the debug output only if DEBUG is true.
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(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
Creates a new 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.
SimpleGraph<V,​E> - Class in org.jgrapht.graph
A simple graph.
SimpleGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleGraph
Creates a new simple graph.
SimpleGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleGraph
Creates a new simple graph with the specified edge factory.
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(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
Creates a new 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.
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
 
sinkReached - Variable in class org.jgrapht.traverse.RandomWalkIterator
 
size - Variable in class org.jgrapht.generate.CompleteGraphGenerator
 
size - Variable in class org.jgrapht.generate.EmptyGraphGenerator
 
size - Variable in class org.jgrapht.generate.LinearGraphGenerator
 
size - Variable in class org.jgrapht.generate.RingGraphGenerator
 
size - Variable in class org.jgrapht.generate.ScaleFreeGraphGenerator
 
size - Variable in class org.jgrapht.generate.WheelGraphGenerator
 
size() - Method in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Returns the number of paths stored in the list.
size() - Method in class org.jgrapht.alg.shortestpath.AbstractPathElementList
Returns the number of paths stored in the list.
size() - Method in class org.jgrapht.graph.MaskEdgeSet
size() - Method in class org.jgrapht.graph.MaskVertexSet
size() - Method in class org.jgrapht.util.ArrayUnenforcedSet.SetForEquality
 
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.
sizeA - Variable in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
 
sizeB - Variable in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
 
SMALLEST_DEGREE_LAST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
 
smallestDegreeLastOrder() - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
 
source - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
source - Variable in class org.jgrapht.alg.BlockCutpointGraph.BCGEdge
 
source - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
source - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
source - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
source - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
 
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
source - Variable in class org.jgrapht.graph.IntrusiveEdge
 
sourceNode - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
sourcePartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
sourcePartitionLastInvokedSource - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
sourcePartitionMinimumCut - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
 
spanner - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
 
spanner - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
Deprecated.
 
spanner - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
 
spanner - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
 
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.
SpannerAlgorithmBase() - Constructor for class org.jgrapht.alg.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
Deprecated.
 
SpannerAlgorithmBase() - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
 
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.
spanningTreeCost - Variable in class org.jgrapht.alg.KruskalMinimumSpanningTree
Deprecated.
 
spanningTreeEdge - Variable in class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
Best spanning tree edge to vertex seen so far.
SpanningTreeImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
Construct a new spanning tree.
specifics - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
specifics - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
specifics - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
specifics - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
specifics - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
Specifics<V,​E> - Interface in org.jgrapht.graph.specifics
An interface encapsulating the basic graph operations.
Specifics() - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.Specifics
Deprecated.
 
Specifics() - Constructor for class org.jgrapht.alg.scoring.PageRank.Specifics
 
Specifics() - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.Specifics
 
Specifics() - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.Specifics
 
Specifics() - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.Specifics
 
splitCluster(Set<V>, Queue<Set<V>>) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
Takes a set of odd vertices with cardinality 2 or more, and splits them into 2 new non-empty sets.
stack - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
stack - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
stack - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
stack - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
stack - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
stack - Variable in class org.jgrapht.traverse.DepthFirstIterator
 
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.alg.cycle.HawickJamesSimpleCycles
 
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.BellmanFordIterator
Deprecated.
Start vertex.
startVertex - Variable in class org.jgrapht.alg.BellmanFordShortestPath
Deprecated.
Start vertex.
startVertex - Variable in class org.jgrapht.alg.KShortestPaths
Deprecated.
 
startVertex - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Start vertex.
startVertex - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Start vertex.
startVertex - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
Start vertex.
startVertex - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Start vertex.
startVertex - Variable in class org.jgrapht.graph.GraphWalk
 
startVertex - Variable in class org.jgrapht.traverse.CrossComponentIterator
 
startVertexEncountered - Variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
 
startVertexEncountered - Variable in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
 
startVertexEncountered - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
 
startVertexEncountered - Variable in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
 
startVertices - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
state - Variable in class org.jgrapht.traverse.CrossComponentIterator
The connected component state
stateStack - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
StoerWagnerMinimumCut<V,​E> - Class in org.jgrapht.alg
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
StrongConnectivityAlgorithm<V,​E> - Interface in org.jgrapht.alg.interfaces
An interface to the StrongConnectivityInspector algorithm classes.
stronglyConnectedSets - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
stronglyConnectedSets - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
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 - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
stronglyConnectedSubgraphs - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
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) - Constructor for class org.jgrapht.graph.Subgraph
Creates a new induced Subgraph with all vertices included.
Subgraph(G, Set<? extends V>) - Constructor for class org.jgrapht.graph.Subgraph
Creates a new induced Subgraph.
Subgraph(G, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.Subgraph
Creates a new Subgraph.
Subgraph.BaseGraphListener - Class in org.jgrapht.graph
An internal listener on the base graph.
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.
successorListOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
Returns the set of vertices which are the successors of a specified vertex.
successorMap - Variable in class org.jgrapht.alg.DirectedNeighborIndex
 
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.
symmetricDifference(LinkedList<V>) - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
Given are the current matching and a new augmenting path p.
symmetricDifference(LinkedList<V>) - Method in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
Given are the current matching and a new augmenting path p.
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

t1BothLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
t1InLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
t1OutLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
t2BothLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
t2InLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
t2OutLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
target - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
Deprecated.
 
target - Variable in class org.jgrapht.alg.BlockCutpointGraph.BCGEdge
 
target - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
target - Variable in class org.jgrapht.graph.IntrusiveEdge
 
targetNode - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
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.
TarjanLowestCommonAncestor.MultiMap<V> - Class in org.jgrapht.alg
 
TarjanLowestCommonAncestor.Worker - Class in org.jgrapht.alg
 
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.
toI(V) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
toI(V) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
toI(V) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 
toInteger() - Method in class org.jgrapht.util.ModifiableInteger
Returns an Integer object representing this ModifiableInteger's value.
toLandmark - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
 
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.
topoComparator - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
TopoComparator(DirectedAcyclicGraph.TopoOrderMapping<V>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoComparator
 
TopoIterator() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
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.
TopologicalOrderIterator(DirectedGraph<V, E>, Queue<V>, Map<V, ModifiableInteger>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
 
TopologicalOrderIterator(DirectedGraph<V, E>, V) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
 
TopologicalOrderIterator.LinkedListQueue<T> - Class in org.jgrapht.traverse
 
topologyUpdateCount - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
topoOrderFactory - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
Pluggable TopoOrderMappingFactory implementation
topoOrderMap - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoComparator
 
topoOrderMap - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
topoToVertex - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexBiMap
 
topoToVertex - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
TopoVertexBiMap() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexBiMap
 
TopoVertexMap() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
toString() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
 
toString() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
toString() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
 
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.KShortestPaths.PathWrapper
Deprecated.
 
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 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( ).
touchedVertices - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
 
touchedVertices - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
 
touchingVerticesToEdgeMap - Variable in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
 
touchingVerticesToEdgeMap - Variable in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
 
toV(int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
toV(Integer) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
transformToPathMatrix(BitSet[]) - Static method in class org.jgrapht.alg.TransitiveReduction
The matrix passed as input parameter will be transformed into a path matrix.
TransitiveClosure - Class in org.jgrapht.alg
Constructs the transitive closure of the input graph.
TransitiveClosure() - Constructor for class org.jgrapht.alg.TransitiveClosure
Private Constructor.
transitiveReduction(BitSet[]) - Static method in class org.jgrapht.alg.TransitiveReduction
The path matrix passed as input parameter will be transformed into a transitively reduced matrix.
TransitiveReduction - Class in org.jgrapht.alg
An implementation of Harry Hsu's transitive reduction algorithm.
TransitiveReduction() - Constructor for class org.jgrapht.alg.TransitiveReduction
Private Constructor.
translateIndex(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
We translate the topological index to an ArrayList index.
translateIndex(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
We translate the topological index to an ArrayList index.
translateIndex(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
We translate the topological index to an ArrayList index.
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
 
traversalListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
 
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.
tryToAddFirstPaths(V, E) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Try to add the first paths to the specified vertex.
tryToAddFirstPaths(V, E) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Try to add the first paths to the specified vertex.
tryToAddNewPaths(V, E) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Try to add new paths for the vertex.
tryToAddNewPaths(V, E) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Try to add new paths for the vertex.
type - Variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
The type of this event.
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

uf - Variable in class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
 
unblock(Integer) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
unblock(V) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
uncheckedCast(Object, TypeUtil<T>) - Static method in class org.jgrapht.util.TypeUtil
Casts an object to a type.
uncovered(double[][], boolean[], boolean[]) - Static method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Deprecated.
Accounts for zeroes being uncovered
uncovered(double[][], boolean[], boolean[]) - Static method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
Accounts for zeroes being uncovered
UNDIRECTED - Static variable in class org.jgrapht.graph.AsUndirectedGraph
 
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.
UndirectedEdgeContainer(EdgeSetFactory<V, E>, V) - Constructor for class org.jgrapht.graph.specifics.UndirectedEdgeContainer
 
undirectedGraph - Variable in class org.jgrapht.graph.MixedGraphUnion
 
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.
UndirectedGraphUnion(UndirectedGraph<V, E>, UndirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.UndirectedGraphUnion
 
UndirectedGraphUnion(UndirectedGraph<V, E>, UndirectedGraph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.UndirectedGraphUnion
 
UndirectedMaskSubgraph<V,​E> - Class in org.jgrapht.graph
An undirected graph that is a MaskSubgraph of another graph.
UndirectedMaskSubgraph(UndirectedGraph<V, E>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.UndirectedMaskSubgraph
Create a new undirected MaskSubgraph of another graph.
UndirectedMaskSubgraph(UndirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.UndirectedMaskSubgraph
Deprecated.
in favor of using lambdas
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.
UndirectedSpecifics(Graph<V, E>) - Constructor for class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.UndirectedSpecifics
Deprecated.
 
UndirectedSpecifics(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.PageRank.UndirectedSpecifics
 
UndirectedSpecifics(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.UndirectedSpecifics
 
UndirectedSpecifics(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.UndirectedSpecifics
 
UndirectedSpecifics(Graph<VV, EE>) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.UndirectedSpecifics
Creates a new UndirectedSpecifics object.
UndirectedSubgraph<V,​E> - Class in org.jgrapht.graph
An undirected graph that is a subgraph of another graph.
UndirectedSubgraph(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph
Creates a new undirected induced subgraph with all vertices included.
UndirectedSubgraph(UndirectedGraph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph
Creates a new undirected induced subgraph.
UndirectedSubgraph(UndirectedGraph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.UndirectedSubgraph
Creates a new undirected subgraph.
UndirectedWeightedGraphBuilder<V,​E,​G extends UndirectedGraph<V,​E> & WeightedGraph<V,​E>> - Class in org.jgrapht.graph.builder
A builder class for undirected weighted graphs.
UndirectedWeightedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilder
Creates a builder based on baseGraph.
UndirectedWeightedGraphBuilderBase<V,​E,​G extends UndirectedGraph<V,​E> & WeightedGraph<V,​E>,​B extends UndirectedWeightedGraphBuilderBase<V,​E,​G,​B>> - Class in org.jgrapht.graph.builder
Base class for UndirectedWeightedGraphBuilder for extending.
UndirectedWeightedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase
Creates a builder based on baseGraph.
UndirectedWeightedSubgraph<V,​E> - Class in org.jgrapht.graph
An undirected weighted graph that is a subgraph on other graph.
UndirectedWeightedSubgraph(WeightedGraph<V, E>) - Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph
Creates a new weighted undirected induced subgraph with all vertices included.
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>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.UndirectedWeightedSubgraph
Creates a new undirected weighted subgraph.
union(FibonacciHeap<T>, FibonacciHeap<T>) - Static method in class org.jgrapht.util.FibonacciHeap
Joins two Fibonacci heaps into a new one.
union(T, T) - Method in class org.jgrapht.alg.util.UnionFind
Merges the sets which contain element1 and element2.
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.
unlink(HierholzerEulerianCycle.EdgeNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
unlink(HierholzerEulerianCycle.VertexNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
unmark(int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
unmatchedVertices1 - Variable in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
unmatchedVertices1 - Variable in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
unmatchedVertices2 - Variable in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
Deprecated.
 
unmatchedVertices2 - Variable in class org.jgrapht.alg.matching.HopcroftKarpBipartiteMatching
 
UNMODIFIABLE - Static variable in class org.jgrapht.experimental.GraphSquare
 
UNMODIFIABLE - Static variable in class org.jgrapht.graph.MaskSubgraph
 
UNMODIFIABLE - Static variable in class org.jgrapht.graph.UnmodifiableGraph
 
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.
unmodifiableEdgeSet - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
unmodifiableEdgeSet - Variable in class org.jgrapht.graph.Subgraph
 
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.
unmodifiableIncoming - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
 
unmodifiableOutgoing - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
 
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.
unmodifiableVertexEdges - Variable in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
 
unmodifiableVertexSet - Variable in class org.jgrapht.graph.AbstractBaseGraph
 
unmodifiableVertexSet - Variable in class org.jgrapht.graph.Subgraph
 
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
UnweightedSpannerAlgorithm() - Constructor for class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
 
UnweightedSpannerAlgorithm() - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
 
updateCountAtCreation - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoIterator
 
updateDag(V, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
 
updateDistance(V, E, double) - Method in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Deprecated.
 
updateDistance(V, E, double) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.SearchFrontier
 
updateDistance(V, E, double) - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
 
updateGraphAndInsertLocations(Pair<HierholzerEulerianCycle.EdgeNode, HierholzerEulerianCycle.EdgeNode>, HierholzerEulerianCycle.VertexNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
Iterate over the partial cycle to remove vertices with zero degrees and compute new insert locations for vertices with non-zero degrees.
updateLabeling(PushRelabelMFImpl.VertexExtension, int) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
updateOutgoingVertices(V, Set<V>) - Method in class org.jgrapht.alg.KShortestPathsIterator
Deprecated.
Updates outgoing vertices of the vertex.
updateOutgoingVertices(V, Set<V>) - Method in class org.jgrapht.alg.shortestpath.KShortestPathsIterator
Updates outgoing vertices of the vertex.
upperBoundOnVertexCoverWeight - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Maximum weight of the vertex cover.
useHeuristics - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
 

V

v - Variable in class org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry
Deprecated.
 
v - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
v - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.QueueEntry
 
v - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator.QueueEntry
 
v - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
original vertex
value - Variable in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
 
value - Variable in class org.jgrapht.util.ModifiableInteger
The int value represented by this ModifiableInteger.
valueOf(String) - Static method in enum org.jgrapht.alg.cycle.HawickJamesSimpleCycles.Operation
Returns the enum constant of this type with the specified name.
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.traverse.CrossComponentIterator.VisitColor
Returns the enum constant of this type with the specified name.
values() - Static method in enum org.jgrapht.alg.cycle.HawickJamesSimpleCycles.Operation
Returns an array containing the constants of this enum type, in the order they are declared.
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.traverse.CrossComponentIterator.VisitColor
Returns an array containing the constants of this enum type, in the order they are declared.
verifyAdd(Set<T>, T) - Static method in class org.jgrapht.graph.ParanoidGraph
 
vertex - Variable in class org.jgrapht.alg.AbstractPathElement
Deprecated.
Target vertex.
vertex - Variable in class org.jgrapht.alg.AbstractPathElementList
Deprecated.
Target vertex of the paths.
vertex - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector.VertexNumber
 
vertex - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData2
 
vertex - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElement
Target vertex.
vertex - Variable in class org.jgrapht.alg.shortestpath.AbstractPathElementList
Target vertex of the paths.
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 - Variable in class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
The vertex reached.
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.
vertex2biconnectedSubgraphs - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
vertex2block - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
vertex2numOrder - Variable in class org.jgrapht.alg.BlockCutpointGraph
 
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.graph.Subgraph.BaseGraphListener
Notifies that a vertex has been added to the graph.
VertexAndWeight(Set<V>, double, boolean) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
Construct a new weighted vertex.
vertexClass - Variable in class org.jgrapht.graph.ClassBasedVertexFactory
 
vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
 
vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2State
 
vertexCount - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
 
vertexCounter - Static variable in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
 
vertexCounter - Static variable in class org.jgrapht.alg.vertexcover.GreedyVCImpl
 
VertexCoverImpl(Set<V>, double) - Constructor for class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
 
vertexData - Variable in class org.jgrapht.alg.BellmanFordIterator
Deprecated.
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.
vertexData - Variable in class org.jgrapht.alg.shortestpath.BellmanFordIterator
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.
VertexData(boolean, boolean) - Constructor for class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData
 
VertexData1(KosarajuStrongConnectivityInspector.VertexData<V>, boolean, boolean) - Constructor for class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData1
 
VertexData2(V, boolean, boolean) - Constructor for class org.jgrapht.alg.KosarajuStrongConnectivityInspector.VertexData2
 
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
vertexDistance - Variable in class org.jgrapht.alg.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
Deprecated.
 
vertexDistance - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
 
vertexEdges - Variable in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
 
VertexExtension() - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMFImpl.VertexExtension
 
VertexExtension() - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
 
VertexExtensionBase() - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
 
vertexExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
 
vertexExtensionsFactory - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
 
vertexExtensionsFactory - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
 
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.
vertexIDDictionary - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Mapping of a vertex to its index in the list of vertices
vertexIndices - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
vertexIndices - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
vertexIterator - Variable in class org.jgrapht.traverse.CrossComponentIterator
 
vertexList - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
 
vertexList - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
 
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.MaskEdgeSet
 
vertexMask - Variable in class org.jgrapht.graph.MaskSubgraph
 
VertexNode(HierholzerEulerianCycle.VertexNode, V, HierholzerEulerianCycle.VertexNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
 
VertexNumber(V, int) - Constructor for class org.jgrapht.alg.GabowStrongConnectivityInspector.VertexNumber
 
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
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.graph.Subgraph.BaseGraphListener
Notifies that a vertex has been removed from the graph.
VertexScoringAlgorithm<V,​D> - Interface in org.jgrapht.alg.interfaces
An interface for all algorithms which assign scores to vertices of a graph.
vertexSet - Variable in class org.jgrapht.graph.MaskVertexSet
 
vertexSet - Variable in class org.jgrapht.graph.Subgraph
 
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() - 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.
vertexSetListeners - Variable in class org.jgrapht.graph.DefaultListenableGraph
 
vertexToConnectedSet - Variable in class org.jgrapht.alg.ConnectivityInspector
 
vertexToHeapNodeMap - Variable in class org.jgrapht.alg.AStarShortestPath
Deprecated.
 
vertexToHeapNodeMap - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
 
vertexToTopo - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexBiMap
 
vertexToTopo - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
 
vertexToVertexData - Variable in class org.jgrapht.alg.KosarajuStrongConnectivityInspector
 
vertexToVertexNumber - Variable in class org.jgrapht.alg.GabowStrongConnectivityInspector
 
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 class org.jgrapht.alg.ConnectivityInspector.MyTraversalListener
 
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
 
vertexTypeDecl - Variable in class org.jgrapht.traverse.DepthFirstIterator
 
vertexWeight(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
Compute the sum of the weights entering a vertex
vertexWeight(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
vertexWeight(V) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
vertexWeightMap - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
 
vertexWeights - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
vertexWeights - Variable in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
vertices - Variable in class org.jgrapht.alg.FloydWarshallShortestPaths
Deprecated.
 
vertices - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
 
vertices - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Ordered list of vertices which will be iteratively considered to be included in a matching
vertices - Variable in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
 
vertices - Variable in class org.jgrapht.graph.MaskSubgraph
 
vertices(List<V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
Set the generator vertices.
verticesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
 
verticesReachableByTightAlternatingEdgesFromVertex(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
 
verticesReachableByTightAlternatingEdgesFromVertex(V) - Method in class org.jgrapht.alg.MaximumWeightBipartiteMatching
Deprecated.
 
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>) - 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>, 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>, Comparator<V>, Comparator<E>, boolean) - 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>) - 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>, 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>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismState<V,​E> - Class in org.jgrapht.alg.isomorphism
 
VF2GraphIsomorphismState(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismState
 
VF2GraphIsomorphismState(VF2State<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismState
 
VF2GraphMappingIterator<V,​E> - Class in org.jgrapht.alg.isomorphism
This class is used to iterate over all existing (isomorphic) mappings between two graphs.
VF2GraphMappingIterator(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphMappingIterator
 
VF2MappingIterator<V,​E> - Class in org.jgrapht.alg.isomorphism
 
VF2MappingIterator(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2MappingIterator
 
VF2State<V,​E> - Class in org.jgrapht.alg.isomorphism
controls the matching between two graphs according to the VF2 algorithm.
VF2State(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2State
 
VF2State(VF2State<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2State
copy constructor
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>) - 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>, 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>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismState<V,​E> - Class in org.jgrapht.alg.isomorphism
 
VF2SubgraphIsomorphismState(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismState
 
VF2SubgraphIsomorphismState(VF2State<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismState
 
VF2SubgraphMappingIterator<V,​E> - Class in org.jgrapht.alg.isomorphism
This class is used to iterate over all existing (subgraph isomorphic) mappings between two graphs.
VF2SubgraphMappingIterator(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphMappingIterator
 
vIndex - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
VisitColor() - Constructor for enum org.jgrapht.traverse.CrossComponentIterator.VisitColor
 
visited - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl.VertexExtension
 
visited - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
 
visited - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
 
visited - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
 
visited - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
 
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
 
visitedFactory - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
Pluggable VisitedFactory implementation
VisitedHashSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
 
vLowlink - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
vToI - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
 
vToI - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
 
vToI - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
 
vToI - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
 

W

weight - Variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
 
weight - Variable in class org.jgrapht.alg.interfaces.MinimumVertexCoverAlgorithm.VertexCoverImpl
 
weight - Variable in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
 
weight - Variable in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
 
weight - Variable in class org.jgrapht.alg.RankingPathElement
Deprecated.
Weight of the path.
weight - Variable in class org.jgrapht.alg.shortestpath.RankingPathElement
Weight of the path.
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.DefaultWeightedEdge
 
weight - Variable in class org.jgrapht.graph.GraphWalk
 
WeightCombiner - Interface in org.jgrapht.util
Binary operator for edge weights.
weighted - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
Indicates whether we are solving a weighted or unweighted version of the problem
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(Class<? extends E>) - Constructor for class org.jgrapht.graph.WeightedMultigraph
Creates a new weighted multigraph.
WeightedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.WeightedMultigraph
Creates a new weighted multigraph with the specified edge factory.
WeightedPseudograph<V,​E> - Class in org.jgrapht.graph
A weighted pseudograph.
WeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.WeightedPseudograph
Creates a new weighted pseudograph.
WeightedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.WeightedPseudograph
Creates a new weighted pseudograph with the specified edge factory.
WeightedSpannerAlgorithm() - Constructor for class org.jgrapht.alg.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
Deprecated.
 
WeightedSpannerAlgorithm() - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
 
weightMap - Variable in class org.jgrapht.graph.AsWeightedGraph
 
weights - Variable in class org.jgrapht.generate.WeightedGraphGenerator
 
weights - Variable in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
 
weights(double[][]) - Method in class org.jgrapht.generate.WeightedGraphGenerator
Set the weights of the generator
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.
WHITE - org.jgrapht.traverse.CrossComponentIterator.VisitColor
Vertex has not been returned via iterator yet.
WORK_ARRAY_INITIAL_SIZE - Static variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
 
Worker(List<TarjanLowestCommonAncestor.LcaRequestResponse<V>>) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor.Worker
 
workingGraph - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut
 

_

_allowedColors - Variable in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
 
_chi - Variable in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
 
_color - Variable in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
 
_colorCount - Variable in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
 
_neighbors - Variable in class org.jgrapht.experimental.alg.IntArrayGraphAlgorithm
 
_order - Variable in class org.jgrapht.experimental.alg.color.GreedyColoring
 
_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 Q R S T U V W _ 
All Classes All Packages