- AbstractBaseGraph<V,E> - Class in org.jgrapht.graph
-
The most general implementation of the
Graph interface.
- AbstractBaseGraph(EdgeFactory<V, E>, boolean, boolean) - Constructor for class org.jgrapht.graph.AbstractBaseGraph
-
Construct a new graph.
- AbstractBaseGraph.DirectedEdgeContainer<VV,EE> - Class in org.jgrapht.graph
-
A container for vertex edges.
- AbstractBaseGraph.DirectedSpecifics - Class in org.jgrapht.graph
-
.
- AbstractBaseGraph.DirectedSpecifics() - Constructor for class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- AbstractBaseGraph.DirectedSpecifics(Map<V, AbstractBaseGraph.DirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- AbstractBaseGraph.UndirectedSpecifics - Class in org.jgrapht.graph
-
.
- AbstractBaseGraph.UndirectedSpecifics() - Constructor for class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- AbstractBaseGraph.UndirectedSpecifics(Map<V, AbstractBaseGraph.UndirectedEdgeContainer<V, E>>) - Constructor for class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- AbstractGraph<V,E> - Class in org.jgrapht.graph
-
A skeletal implementation of the Graph interface, to minimize the
effort required to implement graph interfaces.
- AbstractGraph() - Constructor for class org.jgrapht.graph.AbstractGraph
-
Construct a new empty graph object.
- AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>> - Class in org.jgrapht.graph.builder
-
Base class for builders of
Graph
- AbstractGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Creates a builder based on baseGraph.
- AbstractGraphIterator<V,E> - Class in org.jgrapht.traverse
-
An empty implementation of a graph iterator to minimize the effort required
to implement graph iterators.
- AbstractGraphIterator() - Constructor for class org.jgrapht.traverse.AbstractGraphIterator
-
- active - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
- AdaptiveIsomorphismInspectorFactory - Class in org.jgrapht.experimental.isomorphism
-
This class serves as a factory for GraphIsomorphismInspector concrete
implementations.
- AdaptiveIsomorphismInspectorFactory() - Constructor for class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- add(E) - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
Adds an element to the group.
- addAllEdges(Graph<? super V, ? super E>, Graph<V, E>, Collection<? extends E>) - Static method in class org.jgrapht.Graphs
-
Adds a subset of the edges of the specified source graph to the specified
destination graph.
- addAllVertices(Graph<? super V, ? super E>, Collection<? extends V>) - Static method in class org.jgrapht.Graphs
-
Adds all of the specified vertices to the destination graph.
- addDagEdge(V, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
Adds the given edge and updates the internal topological order for
consistency IFF
there is not already an edge (fromVertex, toVertex) in the graph
the edge does not induce a cycle in the graph
- addDagEdge(V, V, E) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
Adds the given edge and updates the internal topological order for
consistency IFF
the given edge is not already a member of the graph
there is not already an edge (fromVertex, toVertex) in the graph
the edge does not induce a cycle in the graph
- addEdge(V, V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
- addEdge(V, V) - Method in class org.jgrapht.experimental.GraphSquare
-
- addEdge(V, V, E) - Method in class org.jgrapht.experimental.GraphSquare
-
- addEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- addEdge(V, V) - Method in interface org.jgrapht.Graph
-
Creates a new edge in this graph, going from the source vertex to the
target vertex, and returns the created edge.
- addEdge(V, V, E) - Method in interface org.jgrapht.Graph
-
Adds the specified edge to this graph, going from the source vertex to
the target vertex.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- addEdge(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds an edge to the graph being built.
- addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase
-
Adds an weighted edge to the graph being built.
- addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilderBase
-
Adds an weighted edge to the graph being built.
- addEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- addEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- addEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.GraphDelegator
-
- addEdge(V, V) - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- addEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.MaskSubgraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.ParanoidGraph
-
- addEdge(V, V) - Method in class org.jgrapht.graph.Subgraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.Subgraph
-
- addEdge(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- addEdge(V, V, E) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- addEdge(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
-
- addEdgeChain(V, V, V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds a chain of edges to the graph being built.
- addEdges(Graph, List, List, int) - Static method in class org.jgrapht.experimental.RandomGraphHelper
-
- addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- addEdgeToTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- addEdgeWithVertices(Graph<V, E>, V, V) - Static method in class org.jgrapht.Graphs
-
Adds the specified source and target vertices to the graph, if not
already included, and creates a new edge and adds it to the specified
graph similarly to the
Graph.addEdge(Object, Object) method.
- addEdgeWithVertices(Graph<V, E>, Graph<V, E>, E) - Static method in class org.jgrapht.Graphs
-
Adds the specified edge to the graph, including its vertices if not
already included.
- addEdgeWithVertices(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
-
Adds the specified source and target vertices to the graph, if not
already included, and creates a new weighted edge and adds it to the
specified graph similarly to the
Graph.addEdge(Object, Object)
method.
- addElement(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Adds a new element to the data structure in its own set.
- addGraph(Graph<? extends V, ? extends E>) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds all the vertices and all the edges of the sourceGraph to the
graph being built.
- addGraph(Graph<? super V, ? super E>, Graph<V, E>) - Static method in class org.jgrapht.Graphs
-
Adds all the vertices and all the edges of the specified source graph to
the specified destination graph.
- addGraphListener(GraphListener<V, E>) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- addGraphListener(GraphListener<V, E>) - Method in interface org.jgrapht.ListenableGraph
-
Adds the specified graph listener to this graph, if not already present.
- addGraphReversed(DirectedGraph<? super V, ? super E>, DirectedGraph<V, E>) - Static method in class org.jgrapht.Graphs
-
Adds all the vertices and all the edges of the specified source digraph
to the specified destination digraph, reversing all of the edges.
- addIncomingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
-
.
- addOutgoingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
-
.
- addTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Adds the specified traversal listener to this iterator.
- addTraversalListener(TraversalListener<V, E>) - Method in interface org.jgrapht.traverse.GraphIterator
-
Adds the specified traversal listener to this iterator.
- addVertex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
adds the vertex if it wasn't already in the graph, and puts it at the top
of the internal topological vertex ordering
- addVertex(V, boolean) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
adds the vertex if it wasn't already in the graph, and puts it either at
the top or the bottom of the topological ordering, depending on the value
of addToTop.
- addVertex(V) - Method in class org.jgrapht.experimental.GraphSquare
-
- addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- addVertex(V) - Method in interface org.jgrapht.Graph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds vertex to the graph being built.
- addVertex(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- addVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- addVertex(V) - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- addVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- addVertex(V) - Method in class org.jgrapht.graph.ParanoidGraph
-
- addVertex(V) - Method in class org.jgrapht.graph.Subgraph
-
Adds the specified vertex to this subgraph.
- addVertex(V) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- addVertexSetListener(VertexSetListener<V>) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- addVertexSetListener(VertexSetListener<V>) - Method in interface org.jgrapht.ListenableGraph
-
Adds the specified vertex set listener to this graph, if not already
present.
- addVertices(Graph, VertexFactory, int) - Static method in class org.jgrapht.experimental.RandomGraphHelper
-
.
- addVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds each vertex of vertices to the graph being built.
- appendComparator(EquivalenceComparator<E, C>) - Method in interface org.jgrapht.experimental.equivalence.EquivalenceComparatorChain
-
Adds a comparator which will also test equivalence.
- appendComparator(EquivalenceComparator) - Method in class org.jgrapht.experimental.equivalence.EquivalenceComparatorChainBase
-
- ApproximationAlgorithm<ResultType,V> - Interface in org.jgrapht.experimental.alg
-
- ArrayPermutationsIter - Interface in org.jgrapht.experimental.permutation
-
An interface to iterate over array permutations.
- ArrayUnenforcedSet<E> - Class in org.jgrapht.util
-
Helper for efficiently representing small sets whose elements are known to be
unique by construction, implying we don't need to enforce the uniqueness
property in the data structure itself.
- ArrayUnenforcedSet() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
- ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
- ArrayUnenforcedSet(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
- assertUnsupportedGraphTypes(Graph) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
Checks if one of the graphs is from unsupported graph type and throws
IllegalArgumentException if it is.
- assertVertexExist(V) - Method in class org.jgrapht.graph.AbstractGraph
-
Ensures that the specified vertex exists in this graph, or else throws
exception.
- 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.
- 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.
- calculate(V, V, V) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor
-
Calculate the LCM between a and b treating
start as the root we want to search from.
- calculate(V, List<TarjanLowestCommonAncestor.LcaRequestResponse<V>>) - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor
-
Calculate the LCMs between a set of pairs (a and
b) treating start as the root we want to search from,
and setting the LCA of each pair in its LCA field
- calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Sets current source to source, current sink to sink,
then calculates maximum flow from source to sink.
- cascadingCut(FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
-
Performs a cascading cut operation.
- CENTER_VERTEX - Static variable in class org.jgrapht.generate.StarGraphGenerator
-
- checkGraphsType(Graph, Graph) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- ChromaticNumber - Class in org.jgrapht.alg
-
- ChromaticNumber() - Constructor for class org.jgrapht.alg.ChromaticNumber
-
- ClassBasedEdgeFactory<V,E> - Class in org.jgrapht.graph
-
An
EdgeFactory for producing edges by using a class as a factory.
- ClassBasedEdgeFactory(Class<? extends E>) - Constructor for class org.jgrapht.graph.ClassBasedEdgeFactory
-
- ClassBasedVertexFactory<V> - Class in org.jgrapht.graph
-
A
VertexFactory for producing vertices by using a class as a factory.
- ClassBasedVertexFactory(Class<? extends V>) - Constructor for class org.jgrapht.graph.ClassBasedVertexFactory
-
- clear() - Method in class org.jgrapht.util.FibonacciHeap
-
Removes all elements from this heap.
- clearVisited(int) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited
-
Clear the visited state of the given topological index
- clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
-
- clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
-
- clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
-
- clearVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
-
- CliqueMinimalSeparatorDecomposition<V,E> - Class in org.jgrapht.alg
-
Clique Minimal Separator Decomposition using MCS-M+ and Atoms algorithm as
described in Berry et al.
- CliqueMinimalSeparatorDecomposition(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Setup a clique minimal separator decomposition on undirected graph
g.
- clone() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- 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.
- CollectionPermutationIter<E> - Class in org.jgrapht.experimental.permutation
-
Given a container with elements (Collection,Enumeration,array) defines a
permutation iterator which returns, on each iteration, a differnt permutation
of the source container.
- CollectionPermutationIter(Set<E>) - Constructor for class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
Note: the Set interface does not guarantee iteration order.
- CollectionPermutationIter(List<E>) - Constructor for class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
Uses a permArray like [1,1,1,2] where some of the permutations are not
relevant.
- CollectionPermutationIter(List<E>, ArrayPermutationsIter) - Constructor for class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
- combine(double, double) - Method in interface org.jgrapht.util.WeightCombiner
-
Combines two weights.
- comparatorContext - Variable in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
- compare(V, V) - Method in class org.jgrapht.alg.util.VertexDegreeComparator
-
Compare the degrees of v1 and v2, taking into
account whether ascending or descending order is used.
- compareTo(StoerWagnerMinimumCut<V, E>.VertexAndWeight) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
compareTo that sorts in reverse order because we need extract-max and
queue provides extract-min.
- compareTo(ModifiableInteger) - Method in class org.jgrapht.util.ModifiableInteger
-
Compares two ModifiableInteger objects numerically.
- CompleteBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
-
- 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.
- CompoundPermutationIter - Class in org.jgrapht.experimental.permutation
-
For permutation like this:
1,2 are the same eq.group (numbers)
a,b are og the same eq.group (letters)
'$' is of its own eq.
- CompoundPermutationIter(int[]) - Constructor for class org.jgrapht.experimental.permutation.CompoundPermutationIter
-
For the class example, use [1,2,2].
- computeMinCut(V, V) - Method in class org.jgrapht.alg.MinSourceSinkCut
-
Compute a minimum s-t cut
- CONNECTED_COMPONENT_FINISHED - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Connected component traversal finished event.
- CONNECTED_COMPONENT_STARTED - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Connected component traversal started event.
- connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform listeners that the traversal of the current connected
component has finished.
- connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
-
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform listeners that a traversal of a new connected component
has started.
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
-
- ConnectedComponentTraversalEvent - Class in org.jgrapht.event
-
A traversal event with respect to a connected component.
- ConnectedComponentTraversalEvent(Object, int) - Constructor for class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Creates a new ConnectedComponentTraversalEvent.
- connectedSetOf(V) - Method in class org.jgrapht.alg.ConnectivityInspector
-
Returns a set of all vertices that are in the maximally connected
component together with the specified vertex.
- connectedSets() - Method in class org.jgrapht.alg.ConnectivityInspector
-
Returns a list of Set s, where each set contains all
vertices that are in the same maximally connected component.
- ConnectivityInspector<V,E> - Class in org.jgrapht.alg
-
Allows obtaining various connectivity aspects of a graph.
- ConnectivityInspector(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.ConnectivityInspector
-
Creates a connectivity inspector for the specified undirected graph.
- ConnectivityInspector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.ConnectivityInspector
-
Creates a connectivity inspector for the specified directed graph.
- consolidate() - Method in class org.jgrapht.util.FibonacciHeap
-
- containsEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- containsEdge(V, V) - Method in class org.jgrapht.graph.AbstractGraph
-
- containsEdge(V, V) - Method in interface org.jgrapht.Graph
-
Returns true if and only if this graph contains an edge going
from the source vertex to the target vertex.
- containsEdge(E) - Method in interface org.jgrapht.Graph
-
Returns true if this graph contains the specified edge.
- containsEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
-
- containsEdge(E) - Method in class org.jgrapht.graph.GraphUnion
-
- containsEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
- containsEdge(E) - Method in class org.jgrapht.graph.Subgraph
-
- containsVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- containsVertex(V) - Method in interface org.jgrapht.Graph
-
Returns true if this graph contains the specified vertex.
- containsVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- containsVertex(V) - Method in class org.jgrapht.graph.GraphUnion
-
- containsVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- containsVertex(V) - Method in class org.jgrapht.graph.Subgraph
-
- CORNER_VERTEX - Static variable in class org.jgrapht.generate.GridGraphGenerator
-
Role for the vertices at the corners.
- createAppropriateConcreteInspector(int, Graph<V, E>, Graph<V, E>, EquivalenceComparator<V, Graph<V, E>>, EquivalenceComparator<E, Graph<V, E>>) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
Checks the graph type, and accordingly decides which type of concrete
inspector class to create.
- createByGroups(int[]) - Static method in class org.jgrapht.experimental.permutation.PermutationFactory
-
For efficiency, try putting the biggest groups at the beggining of the
array.
- createDirectedSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- createEdge(V, V) - Method in interface org.jgrapht.EdgeFactory
-
Creates a new edge whose endpoints are the specified source and target
vertices.
- createEdge(V, V) - Method in class org.jgrapht.graph.ClassBasedEdgeFactory
-
- createEdges(Graph<VV, EE>, Map<Integer, VV>, int, Random) - Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
-
- createEdges(Graph<VV, EE>, Map<Integer, VV>, int, Random) - Method in interface org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory
-
Two different calls to the createEdges() with the same parameters
must result in the generation of the same.
- createEdgeSet(V) - Method in interface org.jgrapht.graph.EdgeSetFactory
-
Create a new edge set for a particular vertex.
- createEqualityGroupOrderedArray(EE[], EquivalenceComparator<? super EE, ? super CC>, CC) - Static method in class org.jgrapht.experimental.equivalence.EquivalenceSetCreator
-
- createEqualityGroupOrderedArray(Collection<EE>, EquivalenceComparator<? super EE, ? super CC>, CC) - Static method in class org.jgrapht.experimental.equivalence.EquivalenceSetCreator
-
Checks for equivalance groups in the aElementsArray.
- createIsomorphismInspector(Graph<V, E>, Graph<V, E>, EquivalenceComparator<V, Graph<V, E>>, EquivalenceComparator<E, Graph<V, E>>) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
Creates a new inspector, letting this class determine what is the most
efficient algorithm.
- createIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
Creates a new inspector, letting this class determine what is the most
efficient algorithm and using default equivalence comparators.
- createIsomorphismInspectorByType(int, Graph<V, E>, Graph<V, E>, EquivalenceComparator<V, Graph<V, E>>, EquivalenceComparator<E, Graph<V, E>>) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
Creates a new inspector for a particular graph type (planar / tree /
other).
- createIsomorphismInspectorByType(int, Graph<V, E>, Graph<V, E>) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
Creates a new inspector for a particular graph type (planar / tree /
other) using default equivalence comparators.
- createRegular(int[]) - Static method in class org.jgrapht.experimental.permutation.PermutationFactory
-
- createTopologicalExhaustiveInspector(Graph<V, E>, Graph<V, E>, EquivalenceComparator<V, Graph<V, E>>, EquivalenceComparator<E, Graph<V, E>>) - Static method in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- createUndirectedSpecifics() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- createVertex() - Method in class org.jgrapht.graph.ClassBasedVertexFactory
-
- createVertex() - Method in interface org.jgrapht.VertexFactory
-
Creates a new vertex.
- CrossComponentIterator<V,E,D> - Class in org.jgrapht.traverse
-
Provides a cross-connected-component traversal functionality for iterator
subclasses.
- CrossComponentIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- CrossComponentIterator.VisitColor - Enum in org.jgrapht.traverse
-
Standard vertex visit state enumeration.
- cut(FibonacciHeapNode<T>, FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
-
The reverse of the link operation: removes x from the child list of y.
- CycleDetector<V,E> - Class in org.jgrapht.alg
-
Performs cycle detection on a graph.
- CycleDetector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.CycleDetector
-
Creates a cycle detector for the specified graph.
- decreaseKey(FibonacciHeapNode<T>, double) - Method in class org.jgrapht.util.FibonacciHeap
-
Decreases the key value for a heap node, given the new value to take on.
- decrement() - Method in class org.jgrapht.util.ModifiableInteger
-
Subtracts one from the value of this modifiable integer.
- DEFAULT_EDGE_WEIGHT - Static variable in interface org.jgrapht.WeightedGraph
-
The default weight for an edge.
- DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Default tolerance.
- DefaultDirectedGraph<V,E> - Class in org.jgrapht.graph
-
A directed graph.
- DefaultDirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultDirectedGraph
-
Creates a new directed graph.
- DefaultDirectedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DefaultDirectedGraph
-
Creates a new directed graph with the specified edge factory.
- DefaultDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
-
A directed weighted graph.
- DefaultDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Creates a new directed weighted graph.
- DefaultDirectedWeightedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Creates a new directed weighted graph with the specified edge factory.
- DefaultEdge - Class in org.jgrapht.graph
-
A default implementation for edges in a
Graph.
- DefaultEdge() - Constructor for class org.jgrapht.graph.DefaultEdge
-
- DefaultGraphMapping<V,E> - Class in org.jgrapht.graph
-
Implementation of the GraphMapping interface.
- DefaultGraphMapping(Map<V, V>, Map<V, V>, Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.graph.DefaultGraphMapping
-
The maps themselves are used.
- DefaultListenableGraph<V,E> - Class in org.jgrapht.graph
-
A graph backed by the the graph specified at the constructor, which can be
listened by GraphListener s and by
VertexSetListener s.
- DefaultListenableGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.DefaultListenableGraph
-
Creates a new listenable graph.
- DefaultListenableGraph(Graph<V, E>, boolean) - Constructor for class org.jgrapht.graph.DefaultListenableGraph
-
Creates a new listenable graph.
- DefaultWeightedEdge - Class in org.jgrapht.graph
-
- DefaultWeightedEdge() - Constructor for class org.jgrapht.graph.DefaultWeightedEdge
-
- degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- degreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- degreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- degreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- degreeOf(V) - Method in class org.jgrapht.graph.UndirectedGraphUnion
-
- degreeOf(V) - Method in class org.jgrapht.graph.UndirectedSubgraph
-
- degreeOf(V) - Method in interface org.jgrapht.UndirectedGraph
-
Returns the degree of the specified vertex.
- delete(FibonacciHeapNode<T>) - Method in class org.jgrapht.util.FibonacciHeap
-
Deletes a node from the heap given the reference to the node.
- DepthFirstIterator<V,E> - Class in org.jgrapht.traverse
-
A depth-first iterator for a directed and an undirected graph.
- DepthFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
-
Creates a new depth-first iterator for the specified graph.
- DepthFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
-
Creates a new depth-first iterator for the specified graph.
- detectCycles() - Method in class org.jgrapht.alg.CycleDetector
-
Performs yes/no cycle detection on the entire graph.
- detectCyclesContainingVertex(V) - Method in class org.jgrapht.alg.CycleDetector
-
Performs yes/no cycle detection on an individual vertex.
- DijkstraShortestPath<V,E> - Class in org.jgrapht.alg
-
- DijkstraShortestPath(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.DijkstraShortestPath
-
Creates and executes a new DijkstraShortestPath algorithm instance.
- DijkstraShortestPath(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.DijkstraShortestPath
-
Creates and executes a new DijkstraShortestPath algorithm instance.
- DirectedAcyclicGraph<V,E> - Class in org.jgrapht.experimental.dag
-
DirectedAcyclicGraph implements a DAG that can be modified (vertices &
edges added and removed), is guaranteed to remain acyclic, and provides fast
topological order iteration.
- DirectedAcyclicGraph(Class<? extends E>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
- DirectedAcyclicGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
- DirectedAcyclicGraph.CycleFoundException - Exception in org.jgrapht.experimental.dag
-
Exception used in dfsF when a cycle is found
- DirectedAcyclicGraph.CycleFoundException() - Constructor for exception org.jgrapht.experimental.dag.DirectedAcyclicGraph.CycleFoundException
-
- DirectedAcyclicGraph.Region - Class in org.jgrapht.experimental.dag
-
Region is an *inclusive* range of indices.
- DirectedAcyclicGraph.Region(int, int) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
-
- DirectedAcyclicGraph.TopoOrderMapping<V> - Interface in org.jgrapht.experimental.dag
-
For performance tuning, an interface for storing the topological ordering
- DirectedAcyclicGraph.TopoOrderMappingFactory<V> - Interface in org.jgrapht.experimental.dag
-
- DirectedAcyclicGraph.TopoVertexMap - Class in org.jgrapht.experimental.dag
-
For performance and flexibility uses an ArrayList for topological index
to vertex mapping, and a HashMap for vertex to topological index mapping.
- DirectedAcyclicGraph.TopoVertexMap() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
-
- DirectedAcyclicGraph.Visited - Interface in org.jgrapht.experimental.dag
-
this interface allows specification of a strategy for marking vertices as
visited (based on their topological index, so the vertex type isn't part
of the interface).
- DirectedAcyclicGraph.VisitedArrayImpl - Class in org.jgrapht.experimental.dag
-
This implementation, somewhat to my surprise, is slower than the
ArrayList version, probably due to its reallocation of the underlying
array for every topology reorder that is required.
- DirectedAcyclicGraph.VisitedArrayImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
-
Constructs empty factory instance
- DirectedAcyclicGraph.VisitedArrayImpl(DirectedAcyclicGraph.Region) - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
-
- DirectedAcyclicGraph.VisitedArrayListImpl - Class in org.jgrapht.experimental.dag
-
This implementation seems to offer the best performance in most cases.
- DirectedAcyclicGraph.VisitedArrayListImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
-
- DirectedAcyclicGraph.VisitedBitSetImpl - Class in org.jgrapht.experimental.dag
-
This implementation is close to the performance of VisitedArrayListImpl,
with 1/8 the memory usage.
- DirectedAcyclicGraph.VisitedBitSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
-
- DirectedAcyclicGraph.VisitedFactory - Interface in org.jgrapht.experimental.dag
-
interface for a factory that vends Visited implementations
- DirectedAcyclicGraph.VisitedHashSetImpl - Class in org.jgrapht.experimental.dag
-
This implementation doesn't seem to perform as well, though I can imagine
circumstances where it should shine (lots and lots of vertices).
- DirectedAcyclicGraph.VisitedHashSetImpl() - Constructor for class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
-
- DirectedGraph<V,E> - Interface in org.jgrapht
-
A graph whose all edges are directed.
- DirectedGraphBuilder<V,E,G extends DirectedGraph<V,E>> - Class in org.jgrapht.graph.builder
-
A builder class for
Graph.
- DirectedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.DirectedGraphBuilder
-
Creates a builder based on baseGraph.
- DirectedGraphBuilderBase<V,E,G extends DirectedGraph<V,E>,B extends DirectedGraphBuilderBase<V,E,G,B>> - Class in org.jgrapht.graph.builder
-
- DirectedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.DirectedGraphBuilderBase
-
Creates a builder based on baseGraph.
- DirectedGraphUnion<V,E> - Class in org.jgrapht.graph
-
- DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.DirectedGraphUnion
-
- DirectedGraphUnion(DirectedGraph<V, E>, DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.DirectedGraphUnion
-
- DirectedMaskSubgraph<V,E> - Class in org.jgrapht.graph
-
- DirectedMaskSubgraph(DirectedGraph<V, E>, MaskFunctor<V, E>) - Constructor for class org.jgrapht.graph.DirectedMaskSubgraph
-
- DirectedMultigraph<V,E> - Class in org.jgrapht.graph
-
A directed multigraph.
- DirectedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedMultigraph
-
Creates a new directed multigraph.
- DirectedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedMultigraph
-
Creates a new directed multigraph with the specified edge factory.
- DirectedNeighborIndex<V,E> - Class in org.jgrapht.alg
-
Maintains a cache of each vertex's neighbors.
- DirectedNeighborIndex(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.DirectedNeighborIndex
-
Creates a neighbor index for the specified directed graph.
- DirectedPseudograph<V,E> - Class in org.jgrapht.graph
-
A directed pseudograph.
- DirectedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph
-
- DirectedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph
-
- DirectedSimpleCycles<V,E> - Interface in org.jgrapht.alg.cycle
-
A common interface for classes implementing algorithms for enumeration of the
simple cycles of a directed graph.
- DirectedSubgraph<V,E> - Class in org.jgrapht.graph
-
A directed graph that is a subgraph on other graph.
- DirectedSubgraph(DirectedGraph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.DirectedSubgraph
-
Creates a new directed subgraph.
- DirectedWeightedGraphBuilder<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>> - Class in org.jgrapht.graph.builder
-
A builder class for directed weighted graphs}.
- DirectedWeightedGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.DirectedWeightedGraphBuilder
-
Creates a builder based on baseGraph.
- DirectedWeightedGraphBuilderBase<V,E,G extends DirectedGraph<V,E> & WeightedGraph<V,E>,B extends DirectedWeightedGraphBuilderBase<V,E,G,B>> - Class in org.jgrapht.graph.builder
-
- DirectedWeightedGraphBuilderBase(G) - Constructor for class org.jgrapht.graph.builder.DirectedWeightedGraphBuilderBase
-
Creates a builder based on baseGraph.
- DirectedWeightedMultigraph<V,E> - Class in org.jgrapht.graph
-
A directed weighted multigraph.
- DirectedWeightedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
-
Creates a new directed weighted multigraph.
- DirectedWeightedMultigraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
-
Creates a new directed weighted multigraph with the specified edge
factory.
- DirectedWeightedPseudograph<V,E> - Class in org.jgrapht.graph
-
A directed weighted pseudograph.
- DirectedWeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
-
Creates a new directed weighted pseudograph.
- DirectedWeightedPseudograph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
-
Creates a new directed weighted pseudograph with the specified edge
factory.
- DirectedWeightedSubgraph<V,E> - Class in org.jgrapht.graph
-
A directed weighted graph that is a subgraph on other graph.
- DirectedWeightedSubgraph(WeightedGraph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.DirectedWeightedSubgraph
-
Creates a new weighted directed subgraph.
- doubleValue() - Method in class org.jgrapht.util.ModifiableInteger
-
- 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.
- edgeClass - Variable in class org.jgrapht.generate.WeightedGraphGenerator
-
- edgeClass(Class<? extends E>) - Method in class org.jgrapht.generate.WeightedGraphGenerator
-
- EdgeFactory<V,E> - Interface in org.jgrapht
-
An edge factory used by graphs for creating new edges.
- edgeFactory - Variable in class org.jgrapht.generate.WeightedGraphGenerator
-
- edgeFactory(EdgeFactory<V, E>) - Method in class org.jgrapht.generate.WeightedGraphGenerator
-
- 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.
- EdgeReversedGraph<V,E> - Class in org.jgrapht.graph
-
Provides an edge-reversed view g' of a directed graph g.
- EdgeReversedGraph(DirectedGraph<V, E>) - Constructor for class org.jgrapht.graph.EdgeReversedGraph
-
Creates a new EdgeReversedGraph.
- edgeSet() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- edgeSet() - Method in interface org.jgrapht.Graph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.GraphDelegator
-
- edgeSet() - Method in class org.jgrapht.graph.GraphUnion
-
- edgeSet() - Method in class org.jgrapht.graph.MaskSubgraph
-
- edgeSet() - Method in class org.jgrapht.graph.Subgraph
-
- EdgeSetFactory<V,E> - Interface in org.jgrapht.graph
-
A factory for edge sets.
- edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- edgesOf(V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- edgesOf(V) - Method in class org.jgrapht.graph.GraphUnion
-
- edgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- edgesOf(V) - Method in class org.jgrapht.graph.Subgraph
-
- edgeSource - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The source vertex of the edge that this event is related to.
- edgeTarget - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The target vertex of the edge that this event is related to.
- EdgeTraversalEvent<V,E> - Class in org.jgrapht.event
-
A traversal event for a graph edge.
- EdgeTraversalEvent(Object, E) - Constructor for class org.jgrapht.event.EdgeTraversalEvent
-
Creates a new EdgeTraversalEvent.
- edgeTraversed(EdgeTraversalEvent<V, E>) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform the listener that the specified edge have been visited
during the graph traversal.
- edgeTraversed(EdgeTraversalEvent<V, E>) - Method in class org.jgrapht.event.TraversalListenerAdapter
-
- EdmondsBlossomShrinking<V,E> - Class in org.jgrapht.alg
-
An implementation of Edmonds Blossom Shrinking algorithm for constructing
maximum matchings on graphs.
- EdmondsBlossomShrinking() - Constructor for class org.jgrapht.alg.EdmondsBlossomShrinking
-
Deprecated.
- EdmondsBlossomShrinking(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.EdmondsBlossomShrinking
-
- EdmondsKarpMaximumFlow<V,E> - Class in org.jgrapht.alg
-
A
flow network is a
directed graph where each edge has a capacity and each edge receives a flow.
- EdmondsKarpMaximumFlow(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Constructs MaximumFlow instance to work with a copy of
network.
- EdmondsKarpMaximumFlow(DirectedGraph<V, E>, double) - Constructor for class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Constructs MaximumFlow instance to work with a copy of
network.
- elementsSet - Variable in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
Contains the current elements of the group
- EmptyGraphGenerator<V,E> - Class in org.jgrapht.generate
-
- EmptyGraphGenerator(int) - Constructor for class org.jgrapht.generate.EmptyGraphGenerator
-
Construct a new EmptyGraphGenerator.
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Update data structures the first time we see a vertex.
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.DepthFirstIterator
-
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.TopologicalOrderIterator
-
- encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
- encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
Override superclass.
- encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Called whenever we re-encounter a vertex.
- encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.DepthFirstIterator
-
- encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.TopologicalOrderIterator
-
- END_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the last vertex generated.
- eqComparator - Variable in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
The comparator used to define the group
- equals(Object) - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
Uses the equivalenceCompare() of the comparator to compare a
representation of this group, taken using this.getRepresentative(), and a
representation of the other object, which may be the object itself, or,
if it is an equivalence group too, other.getRepresentative()
- equals(Object) - Method in class org.jgrapht.experimental.isomorphism.VertexDegreeEquivalenceComparator.InOutDegrees
-
Checks both inDegree and outDegree.
- equals(Object) - Method in class org.jgrapht.graph.AbstractGraph
-
Indicates whether some other object is "equal to" this graph.
- equals(Object) - Method in class org.jgrapht.util.ArrayUnenforcedSet
-
- equals(Object) - Method in class org.jgrapht.util.ModifiableInteger
-
Compares this object to the specified object.
- equals(Object) - Method in class org.jgrapht.util.VertexPair
-
- equalsByEdgeOrder(GraphOrdering) - Method in class org.jgrapht.experimental.isomorphism.GraphOrdering
-
Tests equality by order of edges
- EquivalenceComparator<E,C> - Interface in org.jgrapht.experimental.equivalence
-
This interface distinguishes between Equivalence sets.
- EquivalenceComparatorChain<E,C> - Interface in org.jgrapht.experimental.equivalence
-
A container of comparators, which are tested in a chain until the first
result can be supplied.
- EquivalenceComparatorChainBase<E,C> - Class in org.jgrapht.experimental.equivalence
-
This class implements comparator chaining.
Usage examples:
graph-theory, node equivalence: You can create a comparator for the
inDegree of a node, another for the total weight of outDegree edges, and a
third which checks the business content of the node.
- EquivalenceComparatorChainBase(EquivalenceComparator<E, C>) - Constructor for class org.jgrapht.experimental.equivalence.EquivalenceComparatorChainBase
-
- equivalenceCompare(E, E, C, C) - Method in interface org.jgrapht.experimental.equivalence.EquivalenceComparator
-
- equivalenceCompare(E, E, C, C) - Method in class org.jgrapht.experimental.equivalence.EquivalenceComparatorChainBase
-
Implements logical AND between the comparators results.
- equivalenceCompare(E, E, C, C) - Method in class org.jgrapht.experimental.equivalence.UniformEquivalenceComparator
-
Always returns true.
- equivalenceCompare(V, V, Graph<V, E>, Graph<V, E>) - Method in class org.jgrapht.experimental.isomorphism.VertexDegreeEquivalenceComparator
-
Compares the in degrees and the out degrees of the two vertexes.
- equivalenceHashcode(E, C) - Method in interface org.jgrapht.experimental.equivalence.EquivalenceComparator
-
- equivalenceHashcode(E, C) - Method in class org.jgrapht.experimental.equivalence.EquivalenceComparatorChainBase
-
Rehashes the concatenation of the results of all single hashcodes.
- equivalenceHashcode(E, C) - Method in class org.jgrapht.experimental.equivalence.UniformEquivalenceComparator
-
Always returns 0.
- equivalenceHashcode(V, Graph<V, E>) - Method in class org.jgrapht.experimental.isomorphism.VertexDegreeEquivalenceComparator
-
Hashes using the in and out degree of a vertex
- EquivalenceSet<E,C> - Class in org.jgrapht.experimental.equivalence
-
EquivalenceSet is a Set of elements which have been determined to be
equivalent using EquivalenceComparator.
- EquivalenceSet(E, EquivalenceComparator<? super E, ? super C>, C) - Constructor for class org.jgrapht.experimental.equivalence.EquivalenceSet
-
Constructs a new EquivalenceSet, filled with the aElement parameter and a
reference to the comparator which is used.
- EquivalenceSetCreator<E,C> - Class in org.jgrapht.experimental.equivalence
-
FIXME Document me.
- EquivalenceSetCreator() - Constructor for class org.jgrapht.experimental.equivalence.EquivalenceSetCreator
-
- equivalentTo(E, C) - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
- EulerianCircuit - Class in org.jgrapht.alg
-
This algorithm will check whether a graph is Eulerian (hence it contains an
Eulerian
circuit).
- EulerianCircuit() - Constructor for class org.jgrapht.alg.EulerianCircuit
-
- ExactAlgorithm<ResultType,V> - Interface in org.jgrapht.experimental.alg
-
- extend(int) - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
-
Performs DFS to seek after matching-augmenting path starting at
the initial-vertex
- factorial(int) - Static method in class org.jgrapht.util.MathUtil
-
- FibonacciHeap<T> - Class in org.jgrapht.util
-
This class implements a Fibonacci heap data structure.
- FibonacciHeap() - Constructor for class org.jgrapht.util.FibonacciHeap
-
Constructs a FibonacciHeap object that contains no elements.
- FibonacciHeapNode<T> - Class in org.jgrapht.util
-
Implements a node of the Fibonacci heap.
- FibonacciHeapNode(T) - Constructor for class org.jgrapht.util.FibonacciHeapNode
-
Default constructor.
- find(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the representative element of the set that element is in.
- find2ApproximationCover(Graph<V, E>) - Static method in class org.jgrapht.alg.VertexCovers
-
Finds a 2-approximation for a minimal vertex cover of the specified
graph.
- findCycleBase() - Method in class org.jgrapht.alg.cycle.PatonCycleBase
-
Finds a cycle base of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- findCycleBase() - Method in interface org.jgrapht.alg.cycle.UndirectedCycleBase
-
Finds a cycle base of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- findCycles() - Method in class org.jgrapht.alg.CycleDetector
-
Finds the vertex set for the subgraph of all cycles.
- findCyclesContainingVertex(V) - Method in class org.jgrapht.alg.CycleDetector
-
Finds the vertex set for the subgraph of all cycles which contain a
particular vertex.
- findGreedyChromaticNumber(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.ChromaticNumber
-
Finds the number of colors required for a greedy coloring of the graph.
- findGreedyColoredGroups(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.ChromaticNumber
-
Finds a greedy coloring of the graph.
- findGreedyCover(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.VertexCovers
-
Finds a greedy approximation for a minimal vertex cover of a specified
graph.
- findLca(V, V) - Method in class org.jgrapht.alg.NaiveLcaFinder
-
Return the first found LCA of a and b
- findLcas(V, V) - Method in class org.jgrapht.alg.NaiveLcaFinder
-
Return all the LCA of a and b.
- findMatch(UndirectedGraph<V, E>) - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
-
Deprecated.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.BellmanFordShortestPath
-
Convenience method to find the shortest path via a single static method
call.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.DijkstraShortestPath
-
Convenience method to find the shortest path via a single static method
call.
- findSimpleCycles() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Finds the simple cycles of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
-
Finds the simple cycles of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Finds the simple cycles of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Finds the simple cycles of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Finds the simple cycles of the graph.
Note that the full algorithm is executed on every call since the graph
may have changed between calls.
- finish - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
-
- finishVertex(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Called when a vertex has been finished (meaning is dependent on traversal
represented by subclass).
- fireConnectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that the traversal of the current connected
component finished.
- fireConnectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a traversal of a new connected component has
started.
- fireEdgeAdded(E, V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified edge was added.
- fireEdgeRemoved(E, V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified edge was removed.
- fireEdgeTraversed(EdgeTraversalEvent<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified edge was visited.
- fireVertexAdded(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified vertex was added.
- fireVertexFinished(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified vertex was finished.
- fireVertexRemoved(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified vertex was removed.
- fireVertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified vertex was visited.
- first(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
- FIRST - Static variable in interface org.jgrapht.util.WeightCombiner
-
First weight.
- floatValue() - Method in class org.jgrapht.util.ModifiableInteger
-
- FloydWarshallShortestPaths<V,E> - Class in org.jgrapht.alg
-
- FloydWarshallShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.FloydWarshallShortestPaths
-
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.experimental.GraphReader
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, Object[]>) - Method in class org.jgrapht.experimental.PartiteRandomGraphGenerator
-
TODO hb 30-nov-05: document me
- generateGraph(Graph, VertexFactory, Map) - Method in class org.jgrapht.experimental.UniformRandomGraphGenerator
-
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
-
Construct a complete bipartite graph
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.EmptyGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, T>) - Method in interface org.jgrapht.generate.GraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.GridGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.HyperCubeGraphGenerator
-
This will generate the hypercube graph
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.LinearGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.RandomGraphGenerator
-
(non-Javadoc)
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.RingGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Generates scale-free network with size passed to the
constructor.
- generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
- generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
-
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.StarGraphGenerator
-
Generates a star graph with the designated order from the constructor
- generateGraph(WeightedGraph<V, E>, VertexFactory<V>, Map<String, T>) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
-
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, T>) - Method in class org.jgrapht.generate.WeightedGraphGeneratorAdapter
-
- generateGraph(Graph<V, E>, VertexFactory<V>, Map<String, V>) - Method in class org.jgrapht.generate.WheelGraphGenerator
-
Generate a graph structure.
- getA() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- getAllEdges(V, V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges connecting source vertex to target vertex if
such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.GraphUnion
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- getAllEdges(V, V) - Method in class org.jgrapht.graph.Subgraph
-
- getAllMaximalCliques() - Method in class org.jgrapht.alg.BronKerboschCliqueFinder
-
Finds all maximal cliques of the graph.
- getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V, E>) - Static method in class org.jgrapht.alg.HamiltonianCycle
-
This method will return an approximate minimal traveling salesman tour
(hamiltonian cycle).
- getAtoms() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the atoms generated by the decomposition.
- getB() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
-
- getBase() - Method in class org.jgrapht.graph.Subgraph
-
- getBiconnectedVertexComponents() - Method in class org.jgrapht.alg.BiconnectivityInspector
-
Returns the biconnected vertex-components of the graph.
- getBiconnectedVertexComponents(V) - Method in class org.jgrapht.alg.BiconnectivityInspector
-
Returns the biconnected vertex-components containing the vertex.
- getBiggestMaximalCliques() - Method in class org.jgrapht.alg.BronKerboschCliqueFinder
-
Finds the biggest maximal cliques of the graph.
- getBlock(V) - Method in class org.jgrapht.alg.BlockCutpointGraph
-
Returns the vertex if vertex is a cutpoint, and otherwise returns the
block (biconnected component) containing the vertex.
- getContext() - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
- getCost(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath
-
- getCurrent() - Method in class org.jgrapht.experimental.permutation.IntegerPermutationIter
-
- getCurrentPermutationArray() - Method in class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
- getCurrentSink() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Returns current sink vertex, or null if there was no
calculateMaximumFlow calls.
- getCurrentSink() - Method in class org.jgrapht.alg.MinSourceSinkCut
-
Returns the sink of the last call
- getCurrentSource() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Returns current source vertex, or null if there was no
calculateMaximumFlow calls.
- getCurrentSource() - Method in class org.jgrapht.alg.MinSourceSinkCut
-
Returns the source of the last call
- getCutEdges() - Method in class org.jgrapht.alg.MinSourceSinkCut
-
Let S be the set containing the source, and T be the set containing the
sink, i.e.
- getCutpoints() - Method in class org.jgrapht.alg.BiconnectivityInspector
-
Returns the cutpoints of the graph.
- getCutpoints() - Method in class org.jgrapht.alg.BlockCutpointGraph
-
Returns the cutpoints of the initial graph.
- getCutWeight() - Method in class org.jgrapht.alg.MinSourceSinkCut
-
Get the cut weight.
- getData() - Method in class org.jgrapht.util.FibonacciHeapNode
-
Obtain the data for this node.
- getDiameter() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
- getEdge() - Method in class org.jgrapht.event.EdgeTraversalEvent
-
Returns the traversed edge.
- getEdge() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the edge that this event is related to.
- getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- getEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- getEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- getEdge(V, V) - Method in interface org.jgrapht.Graph
-
Returns an edge connecting source vertex to target vertex if such
vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
- getEdge(V, V) - Method in class org.jgrapht.graph.GraphUnion
-
- getEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- getEdge(V, V) - Method in class org.jgrapht.graph.Subgraph
-
- getEdgeCorrespondence(E, boolean) - Method in class org.jgrapht.experimental.isomorphism.IsomorphismRelation
-
- getEdgeCorrespondence(E, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
-
- getEdgeCorrespondence(E, boolean) - Method in interface org.jgrapht.GraphMapping
-
Gets the mapped value where the key is edge
- getEdgeFactory() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- getEdgeFactory() - Method in interface org.jgrapht.Graph
-
Returns the edge factory using which this graph creates new edges.
- getEdgeFactory() - Method in class org.jgrapht.graph.GraphDelegator
-
- getEdgeFactory() - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- getEdgeFactory() - Method in class org.jgrapht.graph.MaskSubgraph
-
- getEdgeFactory() - Method in class org.jgrapht.graph.Subgraph
-
- getEdgeList() - Method in class org.jgrapht.graph.GraphPathImpl
-
- getEdgeList() - Method in class org.jgrapht.graph.SimpleGraphPath
-
- getEdgeList() - Method in interface org.jgrapht.GraphPath
-
Returns the edges making up the path.
- getEdgeSet() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
-
Deprecated.
- getEdgeSource() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the source vertex that this event is related to.
- getEdgeSource(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- getEdgeSource(E) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- getEdgeSource(E) - Method in interface org.jgrapht.Graph
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.GraphDelegator
-
- getEdgeSource(E) - Method in class org.jgrapht.graph.GraphUnion
-
- getEdgeSource(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
- getEdgeSource(E) - Method in class org.jgrapht.graph.Subgraph
-
- getEdgeTarget() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the target vertex that this event is related to.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- getEdgeTarget(E) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- getEdgeTarget(E) - Method in interface org.jgrapht.Graph
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.GraphDelegator
-
- getEdgeTarget(E) - Method in class org.jgrapht.graph.GraphUnion
-
- getEdgeTarget(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
- getEdgeTarget(E) - Method in class org.jgrapht.graph.Subgraph
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsUnweightedDirectedGraph
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsUnweightedGraph
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsWeightedGraph
-
- getEdgeWeight(E) - Method in interface org.jgrapht.Graph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.GraphDelegator
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.GraphUnion
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
- getEdgeWeight(E) - Method in class org.jgrapht.graph.Subgraph
-
- getEndVertex() - Method in class org.jgrapht.graph.GraphPathImpl
-
- getEndVertex() - Method in class org.jgrapht.graph.SimpleGraphPath
-
- getEndVertex() - Method in interface org.jgrapht.GraphPath
-
Returns the end vertex in the path.
- getEulerianCircuitVertices(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.EulerianCircuit
-
This method will return a list of vertices which represents the Eulerian
circuit of the graph.
- getFillEdges() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the fill edges generated by the triangulation.
- getFirst() - Method in class org.jgrapht.util.VertexPair
-
- getFullComponentCount() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get a map to know for each separator how many components it produces.
- getG1() - Method in class org.jgrapht.graph.GraphUnion
-
- getG2() - Method in class org.jgrapht.graph.GraphUnion
-
- getGenerators() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the generators of the separators of the triangulated graph, i.e.
- getGraph() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the original graph.
- getGraph() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Returns the graph on which the simple cycle search algorithm is executed
by this object.
- getGraph() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
-
Returns the graph on which the simple cycle search algorithm is executed
by this object.
- getGraph() - Method in class org.jgrapht.alg.cycle.PatonCycleBase
-
Returns the graph on which the cycle base search algorithm is executed by
this object.
- getGraph() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Returns the graph on which the simple cycle search algorithm is executed
by this object.
- getGraph() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Returns the graph on which the simple cycle search algorithm is executed
by this object.
- getGraph() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Returns the graph on which the simple cycle search algorithm is executed
by this object.
- getGraph() - Method in interface org.jgrapht.alg.cycle.UndirectedCycleBase
-
Returns the graph on which the cycle base search algorithm is executed by
this object.
- getGraph() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
- getGraph() - Method in class org.jgrapht.alg.StrongConnectivityInspector
-
Returns the graph inspected by the StrongConnectivityInspector.
- getGraph() - Method in class org.jgrapht.graph.GraphPathImpl
-
- getGraph() - Method in class org.jgrapht.graph.SimpleGraphPath
-
- getGraph() - Method in interface org.jgrapht.GraphPath
-
Returns the graph over which this path is defined.
- getGraph() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
- getInOutDegrees(Graph<V, E>, V) - Method in class org.jgrapht.experimental.isomorphism.VertexDegreeEquivalenceComparator
-
Calculates the In and Out degrees of vertexes.
- getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
-
- getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
-
- getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
-
- getInstance(DirectedAcyclicGraph.Region) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedFactory
-
- getInstance(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
-
- getKey() - Method in class org.jgrapht.util.FibonacciHeapNode
-
Obtain the key for this node.
- getLabelsEdgesSet() - Method in class org.jgrapht.experimental.isomorphism.GraphOrdering
-
- getLca() - Method in class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
-
- getLowerBound(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm
-
- getLowerBound(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
-
- getMatching() - Method in class org.jgrapht.alg.EdmondsBlossomShrinking
-
- getMatching() - Method in class org.jgrapht.alg.HopcroftKarpBipartiteMatching
-
- getMatching() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm
-
Returns set of edges making up the matching
- getMatching() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
-
- getMatchingWeight() - Method in interface org.jgrapht.alg.interfaces.WeightedMatchingAlgorithm
-
Returns weight of a matching found
- getMatchingWeight() - Method in class org.jgrapht.alg.KuhnMunkresMinimalWeightBipartitePerfectMatching
-
- getMax() - Method in class org.jgrapht.experimental.permutation.CompoundPermutationIter
-
- getMaxEdgesForVertexNum(Graph<VV, EE>) - Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
-
Return max edges for that graph.
- getMaximumFlow() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Returns maximum flow, that was calculated during last
calculateMaximumFlow call, or null, if there was no
calculateMaximumFlow calls.
- getMaximumFlowValue() - Method in class org.jgrapht.alg.EdmondsKarpMaximumFlow
-
Returns maximum flow value, that was calculated during last
calculateMaximumFlow call, or null, if there was no
calculateMaximumFlow calls.
- getMeo() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the minimal elimination ordering produced by the triangulation.
- getMinimalTriangulation() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the minimal triangulation of the graph.
- getMinimumSpanningTreeEdgeSet() - Method in interface org.jgrapht.alg.interfaces.MinimumSpanningTree
-
Returns edges set constituting the minimum spanning tree/forest
- getMinimumSpanningTreeEdgeSet() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
-
- getMinimumSpanningTreeEdgeSet() - Method in class org.jgrapht.alg.PrimMinimumSpanningTree
-
- getMinimumSpanningTreeTotalWeight() - Method in interface org.jgrapht.alg.interfaces.MinimumSpanningTree
-
Returns total weight of the minimum spanning tree/forest.
- getMinimumSpanningTreeTotalWeight() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
-
- getMinimumSpanningTreeTotalWeight() - Method in class org.jgrapht.alg.PrimMinimumSpanningTree
-
- getNext() - Method in class org.jgrapht.experimental.permutation.CompoundPermutationIter
-
Iteration may be one of these two: 1.
- getNext() - Method in class org.jgrapht.experimental.permutation.IntegerPermutationIter
-
Facade.
- getNextArray() - Method in class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
On first call, returns the source as an array; on any other call
thereafter, a new permutation
- getNextSet() - Method in class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
Wrap result to a Set.
- getOppositeVertex(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
-
Gets the vertex opposite another vertex across an edge.
- getOther(V) - Method in class org.jgrapht.util.VertexPair
-
- getParentMap() - Method in class org.jgrapht.alg.util.UnionFind
-
- getPath() - Method in class org.jgrapht.alg.DijkstraShortestPath
-
Return the path found.
- getPathEdgeList(V) - Method in class org.jgrapht.alg.BellmanFordShortestPath
-
- getPathEdgeList() - Method in class org.jgrapht.alg.DijkstraShortestPath
-
Return the edges making up the path found.
- getPathLength() - Method in class org.jgrapht.alg.DijkstraShortestPath
-
Return the weighted length of the path found.
- getPaths(V) - Method in class org.jgrapht.alg.KShortestPaths
-
Returns the k shortest simple paths in increasing order of weight.
- getPathVertexList(GraphPath<V, E>) - Static method in class org.jgrapht.Graphs
-
Gets the list of vertices visited by a path.
- getPermAsArray() - Method in class org.jgrapht.experimental.permutation.CompoundPermutationIter
-
Creates and returns a new array which consists of the eq.
- getRankMap() - Method in class org.jgrapht.alg.util.UnionFind
-
- getRepresentative() - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
Returns an arbitrary object from the group.
- getResult(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.BrownBacktrackColoring
-
- getResult(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ExactAlgorithm
-
- getSecond() - Method in class org.jgrapht.util.VertexPair
-
- getSeenData(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Access the data stored for a seen vertex.
- getSeparators() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Get the clique minimal separators.
- getShortestPath(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
Get the shortest path between two vertices.
- getShortestPathLength(V) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
Get the weighted length of the shortest path known to the given vertex.
- getShortestPaths(V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
Get shortest paths from a vertex to all other vertices in the graph.
- getShortestPaths() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
Get all shortest paths in the graph.
- getShortestPathsCount() - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
- getSinkPartition() - Method in class org.jgrapht.alg.MinSourceSinkCut
-
Returns the min cut partition containing the sink
- getSize() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
-
- getSource() - Method in class org.jgrapht.graph.DefaultEdge
-
Retrieves the source of this edge.
- getSourcePartition() - Method in class org.jgrapht.alg.MinSourceSinkCut
-
- getSpanningTreeCost() - Method in class org.jgrapht.alg.KruskalMinimumSpanningTree
-
Deprecated.
- getSpanningTreeEdge(V) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
Get the spanning tree edge reaching a vertex which has been seen already
in this traversal.
- getStack() - Method in class org.jgrapht.traverse.DepthFirstIterator
-
Retrieves the LIFO stack of vertices which have been encountered but not
yet visited (WHITE).
- getStartVertex() - Method in class org.jgrapht.graph.GraphPathImpl
-
- getStartVertex() - Method in class org.jgrapht.graph.SimpleGraphPath
-
- getStartVertex() - Method in interface org.jgrapht.GraphPath
-
Returns the start vertex in the path.
- getTarget() - Method in class org.jgrapht.graph.DefaultEdge
-
Retrieves the target of this edge.
- getTopologicalIndex(V) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
-
get the topological index of the given vertex.
- getTopologicalIndex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
-
- getTopoOrderMapping() - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMappingFactory
-
- getTopoOrderMapping() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
-
- getType() - Method in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Returns the event type.
- getType() - Method in class org.jgrapht.event.GraphChangeEvent
-
Returns the event type.
- getUnmodifiableIncomingEdges() - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
-
A lazy build of unmodifiable incoming edge set.
- getUnmodifiableOutgoingEdges() - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
-
A lazy build of unmodifiable outgoing edge set.
- getUpperBound(Map<V, Object>) - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm
-
- getUpperBound(Map<V, Object>) - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
-
- getValue() - Method in class org.jgrapht.util.ModifiableInteger
-
- getVertex() - Method in class org.jgrapht.event.GraphVertexChangeEvent
-
Returns the vertex that this event is related to.
- getVertex() - Method in class org.jgrapht.event.VertexTraversalEvent
-
Returns the traversed vertex.
- getVertex(Integer) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
-
get the vertex at the given topological index.
- getVertex(Integer) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
-
- getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.experimental.isomorphism.IsomorphismRelation
-
- getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
-
- getVertexCorrespondence(V, boolean) - Method in interface org.jgrapht.GraphMapping
-
Gets the mapped value where the key is vertex
- getVertexList() - Method in class org.jgrapht.graph.SimpleGraphPath
-
- getVertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- getVertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- getVisited(int) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited
-
has the given topological index been visited?
- getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
-
- getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
-
- getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
-
- getVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
-
- getWeight() - Method in class org.jgrapht.graph.DefaultWeightedEdge
-
Retrieves the weight of this edge.
- getWeight() - Method in class org.jgrapht.graph.GraphPathImpl
-
- getWeight() - Method in class org.jgrapht.graph.SimpleGraphPath
-
- getWeight() - Method in interface org.jgrapht.GraphPath
-
Returns the weight assigned to the path.
- graph - Variable in class org.jgrapht.alg.BellmanFordShortestPath
-
Graph on which shortest paths are searched.
- Graph<V,E> - Interface in org.jgrapht
-
The root interface in the graph hierarchy.
- graph - Variable in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
- GRAPH_TYPE_ARBITRARY - Static variable in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- GRAPH_TYPE_MULTIGRAPH - Static variable in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- GRAPH_TYPE_PLANAR - Static variable in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- GRAPH_TYPE_TREE - Static variable in class org.jgrapht.experimental.isomorphism.AdaptiveIsomorphismInspectorFactory
-
- GraphChangeEvent - Class in org.jgrapht.event
-
An event which indicates that a graph has changed.
- GraphChangeEvent(Object, int) - Constructor for class org.jgrapht.event.GraphChangeEvent
-
Creates a new graph change event.
- GraphDelegator<V,E> - Class in org.jgrapht.graph
-
A graph backed by the the graph specified at the constructor, which delegates
all its methods to the backing graph.
- GraphDelegator(Graph<V, E>) - Constructor for class org.jgrapht.graph.GraphDelegator
-
Constructor for GraphDelegator.
- GraphEdgeChangeEvent<V,E> - Class in org.jgrapht.event
-
An event which indicates that a graph edge has changed, or is about to
change.
- GraphEdgeChangeEvent(Object, int, E) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent
-
Deprecated.
Use new constructor which takes vertex parameters.
- GraphEdgeChangeEvent(Object, int, E, V, V) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent
-
Constructor for GraphEdgeChangeEvent.
- GraphGenerator<V,E,T> - Interface in org.jgrapht.generate
-
GraphGenerator defines an interface for generating new graph structures.
- GraphHelper - Class in org.jgrapht
-
- GraphHelper() - Constructor for class org.jgrapht.GraphHelper
-
Deprecated.
- GraphIsomorphismInspector<E> - Interface in org.jgrapht.experimental.isomorphism
-
Isomorphism Overview
- GraphIterator<V,E> - Interface in org.jgrapht.traverse
-
A graph iterator.
- GraphListener<V,E> - Interface in org.jgrapht.event
-
A listener that is notified when the graph changes.
- GraphMapping<V,E> - Interface in org.jgrapht
-
GraphMapping represents a bidirectional mapping between two graphs (called
graph1 and graph2), which allows the caller to obtain the matching vertex or
edge in either direction, from graph1 to graph2, or from graph2 to graph1.
- GraphOrdering<V,E> - Class in org.jgrapht.experimental.isomorphism
-
Holds graph information as int labels only.
- GraphOrdering(Graph<V, E>) - Constructor for class org.jgrapht.experimental.isomorphism.GraphOrdering
-
Creates a new labels graph according to the regular graph.
- GraphOrdering(Graph<V, E>, Set<V>, Set<E>) - Constructor for class org.jgrapht.experimental.isomorphism.GraphOrdering
-
Creates a new labels graph according to the regular graph.
- GraphPath<V,E> - Interface in org.jgrapht
-
- GraphPathImpl<V,E> - Class in org.jgrapht.graph
-
GraphPathImpl is a default implementation of
GraphPath.
- GraphPathImpl(Graph<V, E>, V, V, List<E>, double) - Constructor for class org.jgrapht.graph.GraphPathImpl
-
- GraphReader<V,E> - Class in org.jgrapht.experimental
-
- GraphReader(Reader) - Constructor for class org.jgrapht.experimental.GraphReader
-
Construct a new GraphReader.
- GraphReader(Reader, double) - Constructor for class org.jgrapht.experimental.GraphReader
-
Construct a new GraphReader.
- Graphs - Class in org.jgrapht
-
A collection of utilities to assist with graph manipulation.
- Graphs() - Constructor for class org.jgrapht.Graphs
-
- GraphSquare<V,E> - Class in org.jgrapht.experimental
-
DOCUMENT ME!
- GraphSquare(Graph<V, E>, boolean) - Constructor for class org.jgrapht.experimental.GraphSquare
-
Constructor for GraphSquare.
- GraphTests<V,E> - Class in org.jgrapht.experimental
-
- GraphUnion<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph
-
Read-only union of two graphs: G1 and G2.
- GraphUnion(G, G, WeightCombiner) - Constructor for class org.jgrapht.graph.GraphUnion
-
- GraphUnion(G, G) - Constructor for class org.jgrapht.graph.GraphUnion
-
- GraphVertexChangeEvent<V> - Class in org.jgrapht.event
-
An event which indicates that a graph vertex has changed, or is about to
change.
- GraphVertexChangeEvent(Object, int, V) - Constructor for class org.jgrapht.event.GraphVertexChangeEvent
-
Creates a new GraphVertexChangeEvent object.
- GreedyColoring<V,E> - Class in org.jgrapht.experimental.alg.color
-
- GreedyColoring(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.color.GreedyColoring
-
- GreedyColoring(Graph<V, E>, int) - Constructor for class org.jgrapht.experimental.alg.color.GreedyColoring
-
- GridGraphGenerator<V,E> - Class in org.jgrapht.generate
-
- GridGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GridGraphGenerator
-
Creates a new GridGraphGenerator object with rows x cols dimension.
- incomingEdgesOf(V) - Method in interface org.jgrapht.DirectedGraph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedGraphUnion
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- increment() - Method in class org.jgrapht.util.ModifiableInteger
-
Adds one to the value of this modifiable integer.
- inDegree - Variable in class org.jgrapht.experimental.isomorphism.VertexDegreeEquivalenceComparator.InOutDegrees
-
- inDegreeOf(V) - Method in interface org.jgrapht.DirectedGraph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.DirectedGraphUnion
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.DirectedSubgraph
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- inDegreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- insert(FibonacciHeapNode<T>, double) - Method in class org.jgrapht.util.FibonacciHeap
-
Inserts a new data element into the heap.
- INSTANCE - Static variable in class org.jgrapht.alg.TransitiveClosure
-
Singleton instance.
- IntArrayGraphAlgorithm<V,E> - Class in org.jgrapht.experimental.alg
-
- IntArrayGraphAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.experimental.alg.IntArrayGraphAlgorithm
-
- IntegerPermutationIter - Class in org.jgrapht.experimental.permutation
-
Iterates through permutations of N elements.
- IntegerPermutationIter(int) - Constructor for class org.jgrapht.experimental.permutation.IntegerPermutationIter
-
Creates an array of size N with elements 1,2,...,n-1 Useful for
describing regular permutations.
- IntegerPermutationIter(int[]) - Constructor for class org.jgrapht.experimental.permutation.IntegerPermutationIter
-
Uses a predefined array (sorted), for example:
[3,1,1,2,1]-->[1,1,1,2,3]; note that there are much less than 5!
premutations here, because of the repetitive 1s.
- intValue() - Method in class org.jgrapht.util.ModifiableInteger
-
- isAllowingLoops() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns true if and only if self-loops are allowed in this
graph.
- isAllowingMultipleEdges() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns true if and only if multiple edges are allowed in
this graph.
- isBiconnected() - Method in class org.jgrapht.alg.BiconnectivityInspector
-
Returns true if the graph is biconnected (no cutpoint),
false otherwise.
- isBipartite(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
-
- isChordal() - Method in class org.jgrapht.alg.CliqueMinimalSeparatorDecomposition
-
Check if the graph is chordal.
- isComplete(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
-
- isConnected(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
-
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Returns true if there are no more uniterated vertices in the
currently iterated connected component; false otherwise.
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.DepthFirstIterator
-
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
-
- isCrossComponentTraversal() - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Test whether this iterator is set to traverse the graph across connected
components.
- isCrossComponentTraversal() - Method in interface org.jgrapht.traverse.GraphIterator
-
Test whether this iterator is set to traverse the grpah across connected
components.
- isCutpoint(V) - Method in class org.jgrapht.alg.BlockCutpointGraph
-
Returns true if the vertex is a cutpoint, false
otherwise.
- isEdgeMasked(E) - Method in interface org.jgrapht.graph.MaskFunctor
-
Returns true if the edge is masked, false
otherwise.
- isEmpty(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
-
- isEmpty() - Method in class org.jgrapht.util.FibonacciHeap
-
Tests if the Fibonacci heap is empty or not.
- isEnumerationStartedEmpty() - Method in class org.jgrapht.util.PrefetchIterator
-
Tests whether the enumeration started as an empty one.
- isEulerian(UndirectedGraph<V, E>) - Static method in class org.jgrapht.alg.EulerianCircuit
-
This method will check whether the graph passed in is Eulerian or not.
- isExact() - Method in interface org.jgrapht.experimental.alg.ApproximationAlgorithm
-
- isExact() - Method in class org.jgrapht.experimental.alg.color.GreedyColoring
-
- isGraphConnected() - Method in class org.jgrapht.alg.ConnectivityInspector
-
Test if the inspected graph is connected.
- isIn(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
-
- isIsomorphic() - Method in interface org.jgrapht.experimental.isomorphism.GraphIsomorphismInspector
-
- isNumberOfEdgesValid(Graph<VV, EE>, int) - Method in class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
-
checks if the numOfEdges is smaller than the Max edges according to
the following table:
- isNumberOfEdgesValid(Graph<VV, EE>, int) - Method in interface org.jgrapht.generate.RandomGraphGenerator.EdgeTopologyFactory
-
Checks if the graph can contain the givven numberOfEdges according to
the graph type restrictions.
- IsomorphismRelation<V,E> - Class in org.jgrapht.experimental.isomorphism
-
Holds an isomorphism relation for two graphs.
- IsomorphismRelation(List<V>, List<V>, Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.experimental.isomorphism.IsomorphismRelation
-
- isReuseEvents() - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Tests whether the reuseEvents flag is set.
- isReuseEvents() - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
- isReuseEvents() - Method in interface org.jgrapht.traverse.GraphIterator
-
Tests whether the reuseEvents flag is set.
- isSeenVertex(Object) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Determines whether a vertex has been seen yet by this traversal.
- isStronglyConnected() - Method in class org.jgrapht.alg.StrongConnectivityInspector
-
Returns true if the graph of this
StronglyConnectivityInspector instance is strongly connected.
- isTree(Graph<V, E>) - Static method in class org.jgrapht.experimental.GraphTests
-
- isVertexMasked(V) - Method in interface org.jgrapht.graph.MaskFunctor
-
Returns true if the vertex is masked, false
otherwise.
- iterator() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
iterator will traverse the vertices in topological order, meaning that
for a directed graph G = (V,E), if there exists a path from vertex va to
vertex vb then va is guaranteed to come before vertex vb in the iteration
order.
- RandomGraphGenerator<V,E> - Class in org.jgrapht.generate
-
This Generator creates a random-topology graph of a specified number of
vertexes and edges.
- RandomGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.RandomGraphGenerator
-
- RandomGraphGenerator.DefaultEdgeTopologyFactory<VV,EE> - Class in org.jgrapht.generate
-
Default implementation of the EdgeTopologyFactory interface.
- RandomGraphGenerator.DefaultEdgeTopologyFactory() - Constructor for class org.jgrapht.generate.RandomGraphGenerator.DefaultEdgeTopologyFactory
-
- RandomGraphGenerator.EdgeTopologyFactory<VV,EE> - Interface in org.jgrapht.generate
-
This class is used to generate the edge topology for a graph.
- RandomGraphHelper - Class in org.jgrapht.experimental
-
- randomizer - Variable in class org.jgrapht.generate.RandomGraphGenerator
-
- range(int, int) - Static method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
-
- remove() - Method in class org.jgrapht.experimental.permutation.CompoundPermutationIter
-
UNIMPLEMENTED.
- remove() - Method in class org.jgrapht.experimental.permutation.IntegerPermutationIter
-
UNIMPLEMENTED.
- remove() - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Unsupported.
- remove() - Method in interface org.jgrapht.traverse.GraphIterator
-
Unsupported.
- remove() - Method in class org.jgrapht.util.PrefetchIterator
-
Always throws UnsupportedOperationException.
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.experimental.GraphSquare
-
- removeAllEdges(V, V) - Method in class org.jgrapht.experimental.GraphSquare
-
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.AbstractGraph
-
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractGraph
-
- removeAllEdges(E[]) - Method in class org.jgrapht.graph.AbstractGraph
-
Removes all the edges in this graph that are also contained in the
specified edge array.
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.MaskSubgraph
-
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- removeAllEdges(Collection<? extends E>) - Method in interface org.jgrapht.Graph
-
Removes all the edges in this graph that are also contained in the
specified edge collection.
- removeAllEdges(V, V) - Method in interface org.jgrapht.Graph
-
Removes all the edges going from the specified source vertex to the
specified target vertex, and returns a set of all removed edges.
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
- removeAllVertices() - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
-
remove all vertices from the topological ordering
- removeAllVertices() - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
-
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.experimental.GraphSquare
-
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.AbstractGraph
-
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.MaskSubgraph
-
- removeAllVertices(Collection<? extends V>) - Method in interface org.jgrapht.Graph
-
Removes all the vertices in this graph that are also contained in the
specified vertex collection.
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- removeEdge(E) - Method in class org.jgrapht.experimental.GraphSquare
-
- removeEdge(V, V) - Method in class org.jgrapht.experimental.GraphSquare
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- removeEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Removes an edge going from source vertex to target vertex from the graph
being built, if such vertices and such edge exist in the graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- removeEdge(E) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- removeEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- removeEdge(E) - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- removeEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- removeEdge(V, V) - Method in interface org.jgrapht.Graph
-
Removes an edge going from source vertex to target vertex, if such
vertices and such edge exist in this graph.
- removeEdge(E) - Method in interface org.jgrapht.Graph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.Subgraph
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.Subgraph
-
- removeEdge(E) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- removeEdge(V, V) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedSpecifics
-
- removeEdgeFromTouchingVertices(E) - Method in class org.jgrapht.graph.AbstractBaseGraph.UndirectedSpecifics
-
- removeGraphListener(GraphListener<V, E>) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- removeGraphListener(GraphListener<V, E>) - Method in interface org.jgrapht.ListenableGraph
-
Removes the specified graph listener from this graph, if present.
- removeIncomingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
-
.
- removeMin() - Method in class org.jgrapht.util.FibonacciHeap
-
Removes the smallest element from the heap.
- removeOutgoingEdge(EE) - Method in class org.jgrapht.graph.AbstractBaseGraph.DirectedEdgeContainer
-
.
- removeTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Removes the specified traversal listener from this iterator.
- removeTraversalListener(TraversalListener<V, E>) - Method in interface org.jgrapht.traverse.GraphIterator
-
Removes the specified traversal listener from this iterator.
- removeVertex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph
-
- removeVertex(V) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoOrderMapping
-
remove the given vertex from the topological ordering
- removeVertex(V) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.TopoVertexMap
-
- removeVertex(V) - Method in class org.jgrapht.experimental.GraphSquare
-
- removeVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- removeVertex(V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Removes vertex from the graph being built, if such vertex exist
in graph.
- removeVertex(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- removeVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
-
- removeVertex(V) - Method in class org.jgrapht.graph.GraphUnion
-
Throws UnsupportedOperationException, because
GraphUnion is read-only.
- removeVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
- removeVertex(V) - Method in interface org.jgrapht.Graph
-
Removes the specified vertex from this graph including all its touching
edges if present.
- removeVertex(V) - Method in class org.jgrapht.graph.Subgraph
-
- removeVertex(V) - Method in class org.jgrapht.graph.UnmodifiableGraph
-
- removeVertexSetListener(VertexSetListener<V>) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
- removeVertexSetListener(VertexSetListener<V>) - Method in interface org.jgrapht.ListenableGraph
-
Removes the specified vertex set listener from this graph, if present.
- removeVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Removes each vertex of vertices from the graph being built, if
such vertices exist in graph.
- 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.
- ScaleFreeGraphGenerator<V,E> - Class in org.jgrapht.generate
-
- ScaleFreeGraphGenerator(int) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Constructs a new ScaleFreeGraphGenerator.
- ScaleFreeGraphGenerator(int, long) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Constructs a new ScaleFreeGraphGenerator using fixed
seed for the random generator.
- second(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
- SECOND - Static variable in interface org.jgrapht.util.WeightCombiner
-
Second weight.
- self() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
- self() - Method in class org.jgrapht.graph.builder.DirectedGraphBuilder
-
- self() - Method in class org.jgrapht.graph.builder.DirectedWeightedGraphBuilder
-
- self() - Method in class org.jgrapht.graph.builder.UndirectedGraphBuilder
-
- self() - Method in class org.jgrapht.graph.builder.UndirectedWeightedGraphBuilder
-
- SENTINEL - Static variable in class org.jgrapht.traverse.DepthFirstIterator
-
Sentinel object.
- setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Sets the cross component traversal flag - indicates whether to traverse
the graph across connected components.
- setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
- setEdgeSetFactory(EdgeSetFactory<V, E>) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsWeightedGraph
-
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.GraphDelegator
-
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.Subgraph
-
- setEdgeWeight(E, double) - Method in interface org.jgrapht.WeightedGraph
-
Assigns a weight to an edge.
- setGraph(DirectedGraph<V, E>) - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Sets the graph on which the simple cycle search algorithm is executed by
this object.
- setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
-
Sets the graph on which the simple cycle search algorithm is executed by
this object.
- setGraph(UndirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.PatonCycleBase
-
Sets the graph on which the cycle base search algorithm is executed by
this object.
- setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Sets the graph on which the simple cycle search algorithm is executed by
this object.
- setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Sets the graph on which the simple cycle search algorithm is executed by
this object.
- setGraph(DirectedGraph<V, E>) - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Sets the graph on which the simple cycle search algorithm is executed by
this object.
- setGraph(UndirectedGraph<V, E>) - Method in interface org.jgrapht.alg.cycle.UndirectedCycleBase
-
Sets the graph on which the cycle base search algorithm is executed by
this object.
- setReuseEvents(boolean) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
If the reuseEvents flag is set to true this
class will reuse previously fired events and will not create a new object
for each event.
- setReuseEvents(boolean) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
- setReuseEvents(boolean) - Method in interface org.jgrapht.traverse.GraphIterator
-
Sets a value the reuseEvents flag.
- setValue(int) - Method in class org.jgrapht.util.ModifiableInteger
-
Sets a new value for this modifiable integer.
- setVisited(int) - Method in interface org.jgrapht.experimental.dag.DirectedAcyclicGraph.Visited
-
mark the given topological index as visited
- setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayImpl
-
- setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedArrayListImpl
-
- setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedBitSetImpl
-
- setVisited(int) - Method in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.VisitedHashSetImpl
-
- shortestDistance(V, V) - Method in class org.jgrapht.alg.FloydWarshallShortestPaths
-
Get the length of a shortest path.
- SimpleDirectedGraph<V,E> - Class in org.jgrapht.graph
-
A simple directed graph.
- SimpleDirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleDirectedGraph
-
Creates a new simple directed graph.
- SimpleDirectedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleDirectedGraph
-
Creates a new simple directed graph with the specified edge factory.
- SimpleDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
-
A simple directed weighted graph.
- SimpleDirectedWeightedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Creates a new simple directed weighted graph with the specified edge
factory.
- SimpleDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Creates a new simple directed weighted graph.
- SimpleGraph<V,E> - Class in org.jgrapht.graph
-
A simple graph.
- SimpleGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleGraph
-
Creates a new simple graph with the specified edge factory.
- SimpleGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleGraph
-
Creates a new simple graph.
- SimpleGraphPath<V,E> - Class in org.jgrapht.graph
-
A vertex-based representation of a simple path.
- SimpleGraphPath(SimpleGraph<V, E>, List<V>, double) - Constructor for class org.jgrapht.graph.SimpleGraphPath
-
- SimpleWeightedBipartiteGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate
-
- SimpleWeightedBipartiteGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
- SimpleWeightedGraph<V,E> - Class in org.jgrapht.graph
-
A simple weighted graph.
- SimpleWeightedGraph(EdgeFactory<V, E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
-
Creates a new simple weighted graph with the specified edge factory.
- SimpleWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
-
Creates a new simple weighted graph.
- SimpleWeightedGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate
-
- SimpleWeightedGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
-
- size() - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
- size() - Method in class org.jgrapht.util.FibonacciHeap
-
Returns the size of the heap which is measured in the number of elements
contained in the heap.
- SMALLEST_DEGREE_LAST_ORDER - Static variable in class org.jgrapht.experimental.alg.color.GreedyColoring
-
- StarGraphGenerator<V,E> - Class in org.jgrapht.generate
-
- StarGraphGenerator(int) - Constructor for class org.jgrapht.generate.StarGraphGenerator
-
Creates a new StarGraphGenerator object.
- start - Variable in class org.jgrapht.experimental.dag.DirectedAcyclicGraph.Region
-
- START_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the first vertex generated.
- startVertex - Variable in class org.jgrapht.alg.BellmanFordShortestPath
-
Start vertex.
- StoerWagnerMinimumCut<V,E> - Class in org.jgrapht.alg
-
- StoerWagnerMinimumCut(UndirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut
-
Will compute the minimum cut in graph.
- StoerWagnerMinimumCut.VertexAndWeight - Class in org.jgrapht.alg
-
Class for weighted vertices
- StoerWagnerMinimumCut.VertexAndWeight(Set<V>, double, boolean) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
- StrongConnectivityInspector<V,E> - Class in org.jgrapht.alg
-
Complements the
ConnectivityInspector class with
the capability to compute the strongly connected components of a directed
graph.
- StrongConnectivityInspector(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.StrongConnectivityInspector
-
The constructor of the StrongConnectivityInspector class.
- stronglyConnectedSets() - Method in class org.jgrapht.alg.StrongConnectivityInspector
-
Computes a
List of
Sets, where each set contains vertices
which together form a strongly connected component within the given
graph.
- stronglyConnectedSubgraphs() - Method in class org.jgrapht.alg.StrongConnectivityInspector
-
- Subgraph<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph
-
A subgraph is a graph that has a subset of vertices and a subset of edges
with respect to some base graph.
- Subgraph(G, Set<V>, Set<E>) - Constructor for class org.jgrapht.graph.Subgraph
-
Creates a new Subgraph.
- Subgraph(G, Set<V>) - Constructor for class org.jgrapht.graph.Subgraph
-
Creates a new induced Subgraph.
- successorListOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
-
Returns the set of vertices which are the successors of a specified
vertex.
- successorListOf(DirectedGraph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Returns a list of vertices that are the direct successors of a specified
vertex.
- successorsOf(V) - Method in class org.jgrapht.alg.DirectedNeighborIndex
-
Returns the set of vertices which are the successors of a specified
vertex.
- SUM - Static variable in interface org.jgrapht.util.WeightCombiner
-
Sum of weights.
- SzwarcfiterLauerSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
-
Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's
algorithm.
- SzwarcfiterLauerSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Create a simple cycle finder with an unspecified graph.
- SzwarcfiterLauerSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Create a simple cycle finder for the specified graph.
- TarjanLowestCommonAncestor<V,E> - Class in org.jgrapht.alg
-
Used to calculate Tarjan's Lowest Common Ancestors Algorithm
- TarjanLowestCommonAncestor(Graph<V, E>) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor
-
Create an instance with a reference to the graph that we will find LCAs
for
- TarjanLowestCommonAncestor.LcaRequestResponse<V> - Class in org.jgrapht.alg
-
- TarjanLowestCommonAncestor.LcaRequestResponse(V, V) - Constructor for class org.jgrapht.alg.TarjanLowestCommonAncestor.LcaRequestResponse
-
- TarjanSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
-
Find all simple cycles of a directed graph using the Tarjan's algorithm.
- TarjanSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Create a simple cycle finder with an unspecified graph.
- TarjanSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Create a simple cycle finder for the specified graph.
- testIncidence(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
-
Tests whether an edge is incident to a vertex.
- TiernanSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
-
Find all simple cycles of a directed graph using the Tiernan's algorithm.
- TiernanSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Create a simple cycle finder with an unspecified graph.
- TiernanSimpleCycles(DirectedGraph<V, E>) - Constructor for class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Create a simple cycle finder for the specified graph.
- toArray() - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
Returns the elements of the group.
- toInteger() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns an Integer object representing this
ModifiableInteger's value.
- TopologicalOrderIterator<V,E> - Class in org.jgrapht.traverse
-
Implements topological order traversal for a directed acyclic graph.
- TopologicalOrderIterator(DirectedGraph<V, E>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
-
Creates a new topological order iterator over the directed graph
specified, with arbitrary tie-breaking in case of partial order.
- TopologicalOrderIterator(DirectedGraph<V, E>, Queue<V>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
-
Creates a new topological order iterator over the directed graph
specified, with a user-supplied queue implementation to allow customized
control over tie-breaking in case of partial order.
- toString() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
- toString() - Method in class org.jgrapht.experimental.equivalence.EquivalenceSet
-
- toString() - Method in class org.jgrapht.experimental.isomorphism.GraphOrdering
-
This is the format example:
- toString() - Method in class org.jgrapht.experimental.isomorphism.IsomorphismRelation
-
- toString() - Method in class org.jgrapht.experimental.permutation.CollectionPermutationIter
-
- toString(int[]) - Method in class org.jgrapht.experimental.permutation.IntegerPermutationIter
-
Utility method to convert the array into a string examples: [] [0]
[0,1][1,0]
- toString() - Method in class org.jgrapht.graph.AbstractGraph
-
Returns a string of the parenthesized pair (V, E) representing this
G=(V,E) graph.
- toString() - Method in class org.jgrapht.graph.AsUndirectedGraph
-
- toString() - Method in class org.jgrapht.graph.DefaultEdge
-
- toString() - Method in class org.jgrapht.graph.EdgeReversedGraph
-
- toString() - Method in class org.jgrapht.graph.GraphDelegator
-
- toString() - Method in class org.jgrapht.graph.GraphPathImpl
-
- toString() - Method in class org.jgrapht.util.FibonacciHeap
-
Creates a String representation of this Fibonacci heap.
- toString() - Method in class org.jgrapht.util.FibonacciHeapNode
-
Return the string representation of this object.
- toString() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns a String object representing this
ModifiableInteger's value.
- toString() - Method in class org.jgrapht.util.VertexPair
-
- toStringFromSets(Collection<? extends V>, Collection<? extends E>, boolean) - Method in class org.jgrapht.graph.AbstractGraph
-
Helper for subclass implementations of toString( ).
- TransitiveClosure - Class in org.jgrapht.alg
-
Constructs the transitive closure of the input graph.
- TraversalListener<V,E> - Interface in org.jgrapht.event
-
A listener on graph iterator or on a graph traverser.
- TraversalListenerAdapter<V,E> - Class in org.jgrapht.event
-
An empty do-nothing implementation of the
TraversalListener interface
used for subclasses.
- TraversalListenerAdapter() - Constructor for class org.jgrapht.event.TraversalListenerAdapter
-
- type - Variable in class org.jgrapht.event.GraphChangeEvent
-
The type of graph change this event indicates.
- TypeUtil<T> - Class in org.jgrapht.util
-
TypeUtil isolates type-unsafety so that code which uses it for legitimate
reasons can stay warning-free.
- TypeUtil() - Constructor for class org.jgrapht.util.TypeUtil
-