A B C D E F G H I J K L M N O P Q R S T U V W X Y
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- AbstractBaseGraph<V,E> - Class in org.jgrapht.graph
-
The most general implementation of the
Graph
interface. - AbstractBaseGraph(Supplier<V>, Supplier<E>, GraphType) - Constructor for class org.jgrapht.graph.AbstractBaseGraph
-
Construct a new graph.
- AbstractBaseGraph(Supplier<V>, Supplier<E>, GraphType, GraphSpecificsStrategy<V, E>) - Constructor for class org.jgrapht.graph.AbstractBaseGraph
-
Construct a new graph.
- AbstractCapacitatedMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
This is an abstract class for capacitated minimum spanning tree algorithms.
- AbstractCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>) - Constructor for class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
Construct a new abstract capacitated minimum spanning tree algorithm.
- AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation - Class in org.jgrapht.alg.spanning
-
This class represents a solution instance by managing the labels and the partition mapping.
- AbstractFundamentalCycleBasis<V,E> - Class in org.jgrapht.alg.cycle
-
A base implementation for the computation of a fundamental cycle basis of a graph.
- AbstractFundamentalCycleBasis(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
-
Constructor
- 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(Graph<V, E>) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator
-
Create a new iterator
- active - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- add(int, E) - Method in class org.jgrapht.util.DoublyLinkedList
- add(E) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- add(E, V, V) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Add a new edge
- add(E, V, V) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Add a new edge.
- add(E, V, V) - Method in class org.jgrapht.graph.UniformIntrusiveEdgesSpecifics
- add(E, V, V) - Method in class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
- add(Point2D, Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Add 2-dimensional vectors
- addAll(Collection<? extends E>) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- addAllEdges(Graph<? super V, ? super E>, Graph<V, E>, Collection<? extends E>) - Static method in class org.jgrapht.Graphs
-
Adds a subset of the edges of the specified source graph to the specified destination graph.
- addAllVertices(List<Integer>, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Add multiple vertices in the vertex cover.
- addAllVertices(Graph<? super V, ? super E>, Collection<? extends V>) - Static method in class org.jgrapht.Graphs
-
Adds all of the specified vertices to the destination graph.
- addEdge(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Add a vertex edge
- addEdge(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, E) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Add an edge to the index.
- addEdge(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
-
Creates a new edge and adds it to the specified graph similarly to the
Graph.addEdge(Object, Object)
method. - addEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in interface org.jgrapht.Graph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsSubgraph
-
Add an edge to the subgraph.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- addEdge(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds an edge to the graph being built.
- addEdge(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
- addEdge(V, V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- addEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V, double) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds an weighted edge to the graph being built.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in interface org.jgrapht.Graph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AsGraphUnion
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AsSubgraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- addEdge(V, V, E) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds the specified edge to the graph being built.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.DefaultListenableGraph
- addEdge(V, V, E) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.EdgeReversedGraph
- addEdge(V, V, E) - Method in class org.jgrapht.graph.GraphDelegator
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.ParanoidGraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E, double) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds the specified weighted edge to the graph being built.
- addEdgeChain(V, V, V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds a chain of edges to the graph being built.
- addEdgeToTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Adds the specified edge to the edge containers of its source and target vertices.
- addEdgeToTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- addEdgeToTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- addEdgeToTouchingVertices(V, V, E) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Adds the specified edge to the edge containers of its source and target vertices.
- addEdgeToTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
- addEdgeToTouchingVerticesIfAbsent(V, V, E) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
- addEdgeToTouchingVerticesIfAbsent(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- addEdgeToTouchingVerticesIfAbsent(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- addEdgeToTouchingVerticesIfAbsent(V, V, E) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Adds the specified edge to the edge containers of its source and target vertices only if the edge is not already in the graph.
- addEdgeToTouchingVerticesIfAbsent(V, V, E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
- addEdgeWithVertices(Graph<V, E>, Graph<V, E>, E) - Static method in class org.jgrapht.Graphs
-
Adds the specified edge to the graph, including its vertices if not already included.
- addEdgeWithVertices(Graph<V, E>, V, V) - Static method in class org.jgrapht.Graphs
-
Adds the specified source and target vertices to the graph, if not already included, and creates a new edge and adds it to the specified graph similarly to the
Graph.addEdge(Object, Object)
method. - addEdgeWithVertices(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
-
Adds the specified source and target vertices to the graph, if not already included, and creates a new weighted edge and adds it to the specified graph similarly to the
Graph.addEdge(Object, Object)
method. - addElement(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Adds a new element to the data structure in its own set.
- addElementBeforeNode(DoublyLinkedList.ListNode<E>, E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified element before the specified
successor
in this list. - addElementFirst(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified element at the front of this list.
- addElementLast(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified element at the end of this list.
- addFirst(E) - Method in class org.jgrapht.util.DoublyLinkedList
- 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(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 digraph to the specified destination digraph, reversing all of the edges.
- addIncomingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
Add an incoming edge.
- addIncomingEdges(Graph<V, E>, V, Iterable<V>) - Static method in class org.jgrapht.Graphs
-
Add edges from multiple source vertices to one target vertex.
- addLast(E) - Method in class org.jgrapht.util.DoublyLinkedList
- addListener(BiConsumer<V, Point2D>) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
-
Add a new listener.
- addNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Add a neighbor.
- addNode(int, DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
at the specified position in this list. - addNodeBefore(DoublyLinkedList.ListNode<E>, DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
before the specifiedsuccessor
in this list. - addNodeFirst(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
at the front of this list. - addNodeLast(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
at the end of this list. - addOutgoingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
Add an outgoing edge.
- addOutgoingEdges(Graph<V, E>, V, Iterable<V>) - Static method in class org.jgrapht.Graphs
-
Add edges from one source vertex to multiple target vertices.
- addToIndex(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
-
Add an edge to the index.
- addToIndex(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
-
Add an edge to the index.
- addTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
- addTraversalListener(TraversalListener<V, E>) - Method in interface org.jgrapht.traverse.GraphIterator
-
Adds the specified traversal listener to this iterator.
- addVertex() - Method in class org.jgrapht.graph.AbstractBaseGraph
- addVertex() - Method in interface org.jgrapht.Graph
-
Creates a new vertex in this graph and returns it.
- addVertex() - Method in class org.jgrapht.graph.AsGraphUnion
-
Creates a new vertex in this graph and returns it.
- addVertex() - Method in class org.jgrapht.graph.AsSubgraph
- addVertex() - Method in class org.jgrapht.graph.DirectedAcyclicGraph
- addVertex() - Method in class org.jgrapht.graph.GraphDelegator
-
Creates a new vertex in this graph and returns it.
- addVertex() - Method in class org.jgrapht.graph.MaskSubgraph
-
Creates a new vertex in this graph and returns it.
- addVertex(int, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Add a vertex in the vertex cover.
- addVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in interface org.jgrapht.Graph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Adds the specified vertex to this subgraph.
- addVertex(V) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- 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.concurrent.AsSynchronizedGraph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
- addVertex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
- addVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.ParanoidGraph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Adds a vertex.
- addVertex(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Adds a vertex.
- addVertex(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Adds a vertex.
- addVertexSetListener(VertexSetListener<V>) - Method in class org.jgrapht.graph.DefaultListenableGraph
- addVertexSetListener(VertexSetListener<V>) - Method in interface org.jgrapht.ListenableGraph
-
Adds the specified vertex set listener to this graph, if not already present.
- addVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds each vertex of
vertices
to the graph being built. - adjEdgesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- admissibleHeuristic - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- AHUForestIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted forests.
- AHUForestIsomorphismInspector(Graph<V, E>, Set<V>, Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Construct a new AHU rooted forest isomorphism inspector.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
Implementation of an algorithm for the capacitated minimum spanning tree problem using a cyclic exchange neighborhood, based on Ravindra K.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V, E>, Graph<V, E>, V, double, Map<V, Double>, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm with the proposed initial solution.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V, E>, Graph<V, E>, V, double, Map<V, Double>, int, boolean, boolean, boolean, boolean, int, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm with the proposed initial solution.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>, int, boolean, int, boolean, boolean, boolean, int, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>, int, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm.
- AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E> - Class in org.jgrapht.alg.cycle
-
Implementation of an algorithm for the local augmentation problem for the cyclic exchange neighborhood, i.e.
- AhujaOrlinSharmaCyclicExchangeLocalAugmentation(Graph<V, E>, int, Map<V, Integer>, boolean) - Constructor for class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Constructs an algorithm with given inputs
- AHURootedTreeIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted trees.
- AHURootedTreeIsomorphismInspector(Graph<V, E>, V, Graph<V, E>, V) - Constructor for class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Construct a new AHU rooted tree isomorphism inspector.
- AHUUnrootedTreeIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two unrooted trees.
- AHUUnrootedTreeIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Construct a new AHU unrooted tree isomorphism inspector.
- AliasMethodSampler - Class in org.jgrapht.alg.util
-
The alias method for sampling from a discrete probability distribution.
- AliasMethodSampler(double[]) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- AliasMethodSampler(double[], long) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- AliasMethodSampler(double[], Random) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- AliasMethodSampler(double[], Random, double) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- ALL_OPTIONS - Static variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
All possible options
- AllDirectedPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
A Dijkstra-like algorithm to find all paths between two sets of nodes in a directed graph, with options to search only simple paths and to limit the path length.
- AllDirectedPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Create a new instance.
- allowCycles(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether the graph will allow cycles.
- allowingMultipleEdges(boolean) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set whether the graph will allow multiple (parallel) edges between the same two vertices.
- allowingSelfLoops(boolean) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set whether the graph will allow self loops (edges with same source and target vertices).
- allowMultipleEdges(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether to allow multiple edges.
- allowSelfLoops(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether to allow self-loops.
- AlphaCentrality<V,E> - Class in org.jgrapht.alg.scoring
-
AlphaCentrality implementation.
- AlphaCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double, double) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double, double, int) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double, double, int, double) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double, ToDoubleFunction<V>) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double, ToDoubleFunction<V>, int) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- AlphaCentrality(Graph<V, E>, double, ToDoubleFunction<V>, int, double) - Constructor for class org.jgrapht.alg.scoring.AlphaCentrality
-
Create and execute an instance of AlphaCentrality.
- ALTAdmissibleHeuristic<V,E> - Class in org.jgrapht.alg.shortestpath
-
An admissible heuristic for the A* algorithm using a set of landmarks and the triangle inequality.
- ALTAdmissibleHeuristic(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
-
Constructs a new
AStarAdmissibleHeuristic
using a set of landmarks. - AlwaysEqualComparator<T> - Class in org.jgrapht.alg.util
-
A default implementation for a check on equality (that always holds)
- AlwaysEqualComparator() - Constructor for class org.jgrapht.alg.util.AlwaysEqualComparator
- append(DoublyLinkedList<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Appends the
movedList
to the end of this list. - apply(E) - Method in class org.jgrapht.graph.DefaultEdgeFunction
-
Get the function value for an edge.
- ArrayUnenforcedSet<E> - Class in org.jgrapht.util
-
Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness property in the data structure itself.
- ArrayUnenforcedSet() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs a new empty set
- ArrayUnenforcedSet(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs an empty set with the specified initial capacity.
- ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs a set containing the elements of the specified collection.
- ArrayUnenforcedSetEdgeSetFactory<V,E> - Class in org.jgrapht.graph.specifics
-
An edge set factory which creates
ArrayUnenforcedSet
of size 1, suitable for small degree vertices. - ArrayUnenforcedSetEdgeSetFactory() - Constructor for class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
- ASCENDING - org.jgrapht.alg.util.VertexDegreeComparator.Order
- asDirected() - Method in class org.jgrapht.graph.DefaultGraphType
- asDirected() - Method in interface org.jgrapht.GraphType
-
Create a directed variant of the current graph type.
- AsGraphUnion<V,E> - Class in org.jgrapht.graph
-
Read-only union of two graphs.
- AsGraphUnion(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.graph.AsGraphUnion
-
Construct a new graph union.
- AsGraphUnion(Graph<V, E>, Graph<V, E>, WeightCombiner) - Constructor for class org.jgrapht.graph.AsGraphUnion
-
Construct a new graph union.
- asMixed() - Method in class org.jgrapht.graph.DefaultGraphType
- asMixed() - Method in interface org.jgrapht.GraphType
-
Create a mixed variant of the current graph type.
- asModifiable() - Method in class org.jgrapht.graph.DefaultGraphType
- asModifiable() - Method in interface org.jgrapht.GraphType
-
Create a modifiable variant of the current graph type.
- assertCorrectSourceAndTarget(V, V) - Method in class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
-
Checks that
source
andtarget
are not null and are present in thegraph
. - assertVertexExist(V) - Method in class org.jgrapht.graph.AbstractGraph
-
Ensures that the specified vertex exists in this graph, or else throws exception.
- AsSubgraph<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.
- AsSubgraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsSubgraph
-
Creates a new induced Subgraph with all vertices included.
- AsSubgraph(Graph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.AsSubgraph
-
Creates a new induced subgraph.
- AsSubgraph(Graph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.AsSubgraph
-
Creates a new subgraph.
- AsSynchronizedGraph<V,E> - Class in org.jgrapht.graph.concurrent
-
Create a synchronized (thread-safe) Graph backed by the specified Graph.
- AsSynchronizedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Constructor for AsSynchronizedGraph with default settings (cache disabled, non-fair mode, and copyless mode disabled).
- AsSynchronizedGraph.Builder<V,E> - Class in org.jgrapht.graph.concurrent
-
A builder for
AsSynchronizedGraph
. - AStarAdmissibleHeuristic<V> - Interface in org.jgrapht.alg.interfaces
-
Interface for an admissible heuristic used in A* search.
- AStarShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
A* shortest path.
- AStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Create a new instance of the A* shortest path algorithm.
- AStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>, Supplier<AddressableHeap<Double, V>>) - Constructor for class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Create a new instance of the A* shortest path algorithm.
- asUndirected() - Method in class org.jgrapht.graph.DefaultGraphType
- asUndirected() - Method in interface org.jgrapht.GraphType
-
Create an undirected variant of the current graph type.
- AsUndirectedGraph<V,E> - Class in org.jgrapht.graph
-
An undirected view of the backing directed graph specified in the constructor.
- AsUndirectedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUndirectedGraph
-
Constructor for AsUndirectedGraph.
- asUnmodifiable() - Method in class org.jgrapht.graph.DefaultGraphType
- asUnmodifiable() - Method in interface org.jgrapht.GraphType
-
Create an unmodifiable variant of the current graph type.
- AsUnmodifiableGraph<V,E> - Class in org.jgrapht.graph
-
An unmodifiable view of the backing graph specified in the constructor.
- AsUnmodifiableGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUnmodifiableGraph
-
Creates a new unmodifiable graph based on the specified backing graph.
- asUnweighted() - Method in class org.jgrapht.graph.DefaultGraphType
- asUnweighted() - Method in interface org.jgrapht.GraphType
-
Create an unweighted variant of the current graph type.
- AsUnweightedGraph<V,E> - Class in org.jgrapht.graph
-
Provides an unweighted view on a graph.
- AsUnweightedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUnweightedGraph
-
Constructor for AsUnweightedGraph.
- asWeighted() - Method in class org.jgrapht.graph.DefaultGraphType
- asWeighted() - Method in interface org.jgrapht.GraphType
-
Create a weighted variant of the current graph type.
- AsWeightedGraph<V,E> - Class in org.jgrapht.graph
-
Provides a weighted view of a graph.
- AsWeightedGraph(Graph<V, E>, Function<E, Double>, boolean, boolean) - Constructor for class org.jgrapht.graph.AsWeightedGraph
-
Constructor for AsWeightedGraph which uses a weight function to compute edge weights.
- AsWeightedGraph(Graph<V, E>, Map<E, Double>) - Constructor for class org.jgrapht.graph.AsWeightedGraph
-
Constructor for AsWeightedGraph where the weights are provided through a map.
- AsWeightedGraph(Graph<V, E>, Map<E, Double>, boolean) - Constructor for class org.jgrapht.graph.AsWeightedGraph
-
Constructor for AsWeightedGraph which allows weight write propagation to be requested explicitly.
- attractiveForce(double) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the attractive force.
B
- backingSet - Variable in class org.jgrapht.util.WeightedUnmodifiableSet
- BarabasiAlbertForestGenerator<V,E> - Class in org.jgrapht.generate
-
Barabási-Albert growth and preferential attachment forest generator.
- BarabasiAlbertForestGenerator(int, int) - Constructor for class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Constructor
- BarabasiAlbertForestGenerator(int, int, long) - Constructor for class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Constructor
- BarabasiAlbertForestGenerator(int, int, Random) - Constructor for class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Constructor
- BarabasiAlbertGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Barabási-Albert growth and preferential attachment graph generator.
- BarabasiAlbertGraphGenerator(int, int, int) - Constructor for class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Constructor
- BarabasiAlbertGraphGenerator(int, int, int, long) - Constructor for class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Constructor
- BarabasiAlbertGraphGenerator(int, int, int, Random) - Constructor for class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Constructor
- BarYehudaEvenTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover
-
Implementation of the 2-opt algorithm for a minimum weighted vertex cover by R.
- BarYehudaEvenTwoApproxVCImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
-
Constructs a new BarYehudaEvenTwoApproxVCImpl instance where all vertices have uniform weights.
- BarYehudaEvenTwoApproxVCImpl(Graph<V, E>, Map<V, Double>) - Constructor for class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
-
Constructs a new BarYehudaEvenTwoApproxVCImpl instance
- base - Variable in class org.jgrapht.graph.AsSubgraph
- base - Variable in class org.jgrapht.graph.MaskSubgraph
- BaseBidirectionalShortestPathAlgorithm<V,E> - Class in org.jgrapht.alg.shortestpath
-
Base class for the bidirectional shortest path algorithms.
- BaseBidirectionalShortestPathAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm
-
Constructs a new instance of the algorithm for a given graph.
- BaseIntrusiveEdgesSpecifics<V,E,IE extends org.jgrapht.graph.IntrusiveEdge> - Class in org.jgrapht.graph
-
A base implementation for the intrusive edges specifics.
- BaseIntrusiveEdgesSpecifics(Map<E, IE>) - Constructor for class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Constructor
- BaseManyToManyShortestPathsImpl(Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
-
Constructs an instance for the given
sources
andtargets
. - baseType - Variable in class org.jgrapht.graph.AsSubgraph
- baseType - Variable in class org.jgrapht.graph.MaskSubgraph
- BEFORE_EDGE_ADDED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Before edge added event.
- BEFORE_EDGE_REMOVED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Before edge removed event.
- BEFORE_VERTEX_ADDED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
-
Before vertex added event.
- BEFORE_VERTEX_REMOVED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
-
Before vertex removed event.
- BellmanFordShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
The Bellman-Ford algorithm.
- BellmanFordShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Construct a new instance.
- BellmanFordShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Construct a new instance.
- BellmanFordShortestPath(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Construct a new instance.
- BergeGraphInspector<V,E> - Class in org.jgrapht.alg.cycle
-
Tests whether a graph is perfect.
- BergeGraphInspector() - Constructor for class org.jgrapht.alg.cycle.BergeGraphInspector
- bestCut - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut
- bestCutWeight - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut
- bestSolution - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
representation of the solution
- BetweennessCentrality<V,E> - Class in org.jgrapht.alg.scoring
-
Betweenness centrality.
- BetweennessCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.BetweennessCentrality
-
Construct a new instance.
- BetweennessCentrality(Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.scoring.BetweennessCentrality
-
Construct a new instance.
- BFSShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
The BFS Shortest Path algorithm.
- BFSShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Construct a new instance.
- BhandariKDisjointShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of Bhandari algorithm for finding $K$ edge-disjoint shortest paths.
- BhandariKDisjointShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths
-
Creates a new instance of the algorithm.
- BiconnectivityInspector<V,E> - Class in org.jgrapht.alg.connectivity
-
Allows obtaining various connectivity aspects of a graph.
- BiconnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Constructs a new BiconnectivityInspector
- bidiakisCubeGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- BidirectionalAStarShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
A bidirectional version of A* algorithm.
- BidirectionalAStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Constructs a new instance of the algorithm for a given graph and heuristic.
- BidirectionalAStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>, Supplier<AddressableHeap<Double, V>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Constructs a new instance of the algorithm for a given graph, heuristic and heap supplier.
- BidirectionalDijkstraShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
A bidirectional version of Dijkstra's algorithm.
- BidirectionalDijkstraShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BidirectionalDijkstraShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BidirectionalDijkstraShortestPath(Graph<V, E>, double, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BidirectionalDijkstraShortestPath(Graph<V, E>, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BinaryLiftingLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Algorithm for computing lowest common ancestors in rooted trees and forests using the binary lifting method.
- BinaryLiftingLCAFinder(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Construct a new instance of the algorithm.
- BinaryLiftingLCAFinder(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Construct a new instance of the algorithm.
- BipartitePartitioning<V,E> - Class in org.jgrapht.alg.partition
-
Algorithm for computing bipartite partitions thus checking whether a graph is bipartite or not.
- BipartitePartitioning(Graph<V, E>) - Constructor for class org.jgrapht.alg.partition.BipartitePartitioning
-
Constructs a new bipartite partitioning.
- bitSetCover - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
- BitSetCover(int, int) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Construct a new empty vertex cover as a BitSet.
- BitSetCover(RecursiveExactVCImpl.BitSetCover) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Copy constructor
- BLACK - org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has been returned via iterator, and we're done with all of its out-edges.
- blanusaFirstSnarkGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- blanusaSecondSnarkGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- BlockCutpointGraph<V,E> - Class in org.jgrapht.alg.connectivity
-
A Block-Cutpoint graph (also known as a block-cut tree).
- BlockCutpointGraph(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Constructs a Block-Cutpoint graph
- BlossomVOptions - Class in org.jgrapht.alg.matching.blossom.v5
-
BlossomVOptions that define the strategies to use during the algorithm for updating duals and initializing the matching
- BlossomVOptions() - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Constructs a default set of options for the algorithm
- BlossomVOptions(BlossomVOptions.InitializationType) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Constructs a new options instance with a
initializationType
- BlossomVOptions(BlossomVOptions.InitializationType, BlossomVOptions.DualUpdateStrategy, boolean, boolean) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Constructs a custom set of options for the algorithm
- BlossomVOptions.DualUpdateStrategy - Enum in org.jgrapht.alg.matching.blossom.v5
-
Enum for choosing dual updates strategy
- BlossomVOptions.InitializationType - Enum in org.jgrapht.alg.matching.blossom.v5
-
Enum for types of matching initialization
- BoruvkaMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
Borůvka's algorithm for the computation of a minimum spanning tree.
- BoruvkaMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree
-
Construct a new instance of the algorithm.
- Box2D - Class in org.jgrapht.alg.drawing.model
-
A 2-dimensional box (rectangle).
- Box2D(double[], double[]) - Constructor for class org.jgrapht.alg.drawing.model.Box2D
-
Create a new box
- Box2D(double, double) - Constructor for class org.jgrapht.alg.drawing.model.Box2D
-
Create a new box
- Box2D(double, double, double, double) - Constructor for class org.jgrapht.alg.drawing.model.Box2D
-
Create a new box
- Boxes - Class in org.jgrapht.alg.drawing.model
-
A collection of utilities to assist with boxes manipulation.
- Boxes() - Constructor for class org.jgrapht.alg.drawing.model.Boxes
- BoyerMyrvoldPlanarityInspector<V,E> - Class in org.jgrapht.alg.planar
-
An implementation of the Boyer-Myrvold planarity testing algorithm.
- BoyerMyrvoldPlanarityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Creates new instance of the planarity testing algorithm for the
graph
. - BreadthFirstIterator<V,E> - Class in org.jgrapht.traverse
-
A breadth-first iterator for a directed or undirected graph.
- BreadthFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.BreadthFirstIterator
-
Creates a new breadth-first iterator for the specified graph.
- BreadthFirstIterator(Graph<V, E>, Iterable<V>) - Constructor for class org.jgrapht.traverse.BreadthFirstIterator
-
Creates a new breadth-first iterator for the specified graph.
- BreadthFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.BreadthFirstIterator
-
Creates a new breadth-first iterator for the specified graph.
- brinkmannGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- BronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Bron-Kerbosch maximal clique enumeration algorithm.
- BronKerboschCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.BronKerboschCliqueFinder
-
Constructs a new clique finder.
- BronKerboschCliqueFinder(Graph<V, E>, long, TimeUnit) - Constructor for class org.jgrapht.alg.clique.BronKerboschCliqueFinder
-
Constructs a new clique finder.
- BrownBacktrackColoring<V,E> - Class in org.jgrapht.alg.color
-
Brown graph coloring algorithm.
- BrownBacktrackColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.BrownBacktrackColoring
-
Construct a new Brown backtracking algorithm.
- buckyBallGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- build() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Build the graph.
- build() - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Build the type.
- build(Graph<V, E>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Build the AsSynchronizedGraph.
- buildAsUnmodifiable() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Build an unmodifiable version graph.
- Builder() - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Construct a new Builder with non-fair mode, cache disabled, and copyless mode disabled.
- Builder() - Constructor for class org.jgrapht.graph.DefaultGraphType.Builder
-
Construct a new Builder.
- Builder(boolean, boolean) - Constructor for class org.jgrapht.graph.DefaultGraphType.Builder
-
Construct a new Builder.
- Builder(AsSynchronizedGraph<V, E>) - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Construct a new Builder matching the settings of an existing graph.
- Builder(GraphType) - Constructor for class org.jgrapht.graph.DefaultGraphType.Builder
-
Construct a new Builder.
- buildGraph() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the actual graph.
- buildGraphBuilder() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the graph and acquire a
GraphBuilder
in order to add vertices and edges. - buildType() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the graph type.
- buildWalk() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Build final walk
- bullGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- butterflyGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
C
- cacheDisable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph without caching.
- cacheEnable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with caching.
- calculateAttractiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the repulsive forces between vertices connected with edges.
- calculateDensest() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Algorithm to compute max density subgraph Performs binary search on the initial interval lower-upper until interval is smaller than epsilon In case no solution is found because epsilon is too big, the computation continues until a (first) solution is found, thereby avoiding to return an empty graph.
- calculateDensest() - Method in interface org.jgrapht.alg.interfaces.MaximumDensitySubgraphAlgorithm
-
Calculate a maximum density subgraph
- calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - calculateMinCut() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Calculates the minimum cut in the graph, that is, the minimum cut over all $s-t$ pairs.
- calculateMinCut(Set<V>, boolean) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Calculates the minimum odd cut.
- calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- calculateMinCut(V, V) - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
-
Computes a minimum capacity $s-t$ cut.
- calculateRepulsiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the repulsive forces between vertices
- calculateRepulsiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
- calculateResultingSpanningTree() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Calculates the resulting spanning tree based on this solution representation.
- calculateShortestPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths
- calculateShortestPath(V, V) - Method in class org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths
- calculateSourcePartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Calculate the set of reachable vertices from $s$ in the residual graph.
- cameFrom - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- CAP_INF - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
A capacity which is considered to be infinite.
- CapacitatedSpanningTreeAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a capacitated (minimum) spanning tree of a given connected graph with a designated root vertex.
- CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E> - Interface in org.jgrapht.alg.interfaces
-
A spanning tree.
- CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the spanning tree interface.
- CapacitatedSpanningTreeImpl(Map<V, Integer>, Map<Integer, Pair<Set<V>, Double>>, Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
-
Construct a new capacitated spanning tree.
- CapacitatedSpanningTreeSolutionRepresentation() - Constructor for class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Constructs a new solution representation for the CMST problem.
- CapacitatedSpanningTreeSolutionRepresentation(Map<V, Integer>, Map<Integer, Pair<Set<V>, Double>>) - Constructor for class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Constructs a new solution representation for the CMST problem based on
labels
andpartition
. - capacity - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the maximal capacity for each subtree.
- CapacityScalingMinimumCostFlow<V,E> - Class in org.jgrapht.alg.flow.mincost
-
This class computes a solution to a minimum cost flow problem using the successive shortest path algorithm with capacity scaling.
- CapacityScalingMinimumCostFlow() - Constructor for class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Constructs a new instance of the algorithm which uses default scaling factor.
- CapacityScalingMinimumCostFlow(int) - Constructor for class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Constructs a new instance of the algorithm with custom
scalingFactor
. - CENTER_VERTEX - Static variable in class org.jgrapht.generate.StarGraphGenerator
- checkGraph(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Checks that graph is undirected, complete, and non-empty
- ChinesePostman<V,E> - Class in org.jgrapht.alg.cycle
-
This class solves the Chinese Postman Problem (CPP), also known as the Route Inspection Problem.
- ChinesePostman() - Constructor for class org.jgrapht.alg.cycle.ChinesePostman
- CHManyToManyShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Efficient algorithm for the many-to-many shortest paths problem based on contraction hierarchy.
- CHManyToManyShortestPaths(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
contractionHierarchy
. - CHManyToManyShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
graph
. - ChordalGraphColoring<V,E> - Class in org.jgrapht.alg.color
-
Calculates a minimum vertex coloring for a chordal graph.
- ChordalGraphColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.ChordalGraphColoring
-
Creates a new ChordalGraphColoring instance.
- ChordalGraphColoring(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.color.ChordalGraphColoring
-
Creates a new ChordalGraphColoring instance.
- ChordalGraphIndependentSetFinder<V,E> - Class in org.jgrapht.alg.independentset
-
Calculates a maximum cardinality independent set in a chordal graph.
- ChordalGraphIndependentSetFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Creates a new ChordalGraphIndependentSetFinder instance.
- ChordalGraphIndependentSetFinder(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Creates a new ChordalGraphIndependentSetFinder instance.
- ChordalGraphMaxCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Calculates a maximum cardinality clique in a chordal graph.
- ChordalGraphMaxCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Creates a new ChordalGraphMaxCliqueFinder instance.
- ChordalGraphMaxCliqueFinder(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Creates a new ChordalGraphMaxCliqueFinder instance.
- ChordalGraphMinimalVertexSeparatorFinder<V,E> - Class in org.jgrapht.alg.cycle
-
Allows obtaining a mapping of all minimal vertex separators of a graph to their multiplicities
- ChordalGraphMinimalVertexSeparatorFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Creates new
ChordalGraphMinimalVertexSeparatorFinder
instance. - ChordalityInspector<V,E> - Class in org.jgrapht.alg.cycle
-
Tests whether a graph is chordal.
- ChordalityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.ChordalityInspector
-
Creates a chordality inspector for
graph
, which usesMaximumCardinalityIterator
as a default iterator. - ChordalityInspector(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.cycle.ChordalityInspector
-
Creates a chordality inspector for
graph
, which uses an iterator defined by the second parameter as an internal iterator. - ChordalityInspector.IterationOrder - Enum in org.jgrapht.alg.cycle
-
Specifies internal iterator type.
- ChristofidesThreeHalvesApproxMetricTSP<V,E> - Class in org.jgrapht.alg.tour
-
A $3/2$-approximation algorithm for the metric TSP problem.
- ChristofidesThreeHalvesApproxMetricTSP() - Constructor for class org.jgrapht.alg.tour.ChristofidesThreeHalvesApproxMetricTSP
-
Empty constructor
- chvatalGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- circularIterator(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns a
DoublyLinkedList.NodeIterator
that starts at the firstDoublyLinkedList.ListNode
of this list that is equal to the specifiedfirstElement
, iterates in forward direction over the end of this list until the first node. - CircularLayoutAlgorithm2D<V,E> - Class in org.jgrapht.alg.drawing
-
Circular layout.
- CircularLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
-
Create a new layout algorithm
- CircularLayoutAlgorithm2D(double) - Constructor for class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
-
Create a new layout algorithm
- CircularLayoutAlgorithm2D(double, Comparator<V>) - Constructor for class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
-
Create a new layout algorithm.
- ClarksonTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover
-
Implementation of the 2-opt algorithm for a minimum weighted vertex cover by Clarkson, Kenneth L.
- ClarksonTwoApproxVCImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
-
Constructs a new ClarksonTwoApproxVCImpl instance where all vertices have uniform weights.
- ClarksonTwoApproxVCImpl(Graph<V, E>, Map<V, Double>) - Constructor for class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
-
Constructs a new ClarksonTwoApproxVCImpl instance
- clawGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- cleanup() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Release any memory held.
- cleanUp() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Cleans up the solution representation by removing all empty sets from the partition.
- clear() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Empty the queue.
- clear() - Method in class org.jgrapht.util.DoublyLinkedList
- clear() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- clearCopyless() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph which returns collection copies.
- clearPathLimit() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
This is the default behaviour of the algorithm.
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- clearVisited(int) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy
-
Clear the visited state of the given topological index.
- clebschGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- CliqueAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Algorithm to compute a (weighted) Clique in a graph.
- CliqueAlgorithm.Clique<V> - Interface in org.jgrapht.alg.interfaces
-
A Clique
- CliqueAlgorithm.CliqueImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of a (weighted) clique
- CliqueImpl(Set<V>) - Constructor for class org.jgrapht.alg.interfaces.CliqueAlgorithm.CliqueImpl
- CliqueImpl(Set<V>, double) - Constructor for class org.jgrapht.alg.interfaces.CliqueAlgorithm.CliqueImpl
- CliqueMinimalSeparatorDecomposition<V,E> - Class in org.jgrapht.alg.clique
-
Clique Minimal Separator Decomposition using MCS-M+ and Atoms algorithm as described in Berry et al.
- CliqueMinimalSeparatorDecomposition(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Setup a clique minimal separator decomposition on undirected graph
g
. - clone() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns a shallow copy of this solution representation instance.
- clone() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.DefaultListenableGraph
- closeDirectedAcyclicGraph(DirectedAcyclicGraph<V, E>) - Method in class org.jgrapht.alg.TransitiveClosure
-
Computes the transitive closure of a directed acyclic graph in $O(nm)$
- closedList - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- ClosenessCentrality<V,E> - Class in org.jgrapht.alg.scoring
-
Closeness centrality.
- ClosenessCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.ClosenessCentrality
-
Construct a new instance.
- ClosenessCentrality(Graph<V, E>, boolean, boolean) - Constructor for class org.jgrapht.alg.scoring.ClosenessCentrality
-
Construct a new instance.
- 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>, Iterable<V>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, Iterable<V>, double) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, Iterable<V>, double, Supplier<AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V, E>>>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, V, double, Supplier<AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V, E>>>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClusteringAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a graph vertex clustering.
- ClusteringAlgorithm.Clustering<V> - Interface in org.jgrapht.alg.interfaces
-
A clustering.
- ClusteringAlgorithm.ClusteringImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the clustering interface.
- ClusteringCoefficient<V,E> - Class in org.jgrapht.alg.scoring
-
Clustering coefficient.
- ClusteringCoefficient(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Construct a new instance
- ClusteringImpl(List<Set<V>>) - Constructor for class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
-
Construct a new clustering.
- collect() - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Collect a map of all vertices locations.
- CollectionUtil - Class in org.jgrapht.util
-
Utility class to create
Collection
instances. - ColoringImpl(Map<V, Integer>, int) - Constructor for class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
-
Construct a new vertex coloring.
- ColorRefinementAlgorithm<V,E> - Class in org.jgrapht.alg.color
-
Color refinement algorithm that finds the coarsest stable coloring of a graph based on a given
alpha
coloring as described in the following paper: C. - ColorRefinementAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Construct a new coloring algorithm.
- ColorRefinementAlgorithm(Graph<V, E>, VertexColoringAlgorithm.Coloring<V>) - Constructor for class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Construct a new coloring algorithm.
- ColorRefinementIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
Implementation of the color refinement algorithm isomorphism test using its feature of detecting isomorphism between two graphs as described in C.
- ColorRefinementIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Constructor for a isomorphism inspector based on color refinement.
- combine(double, double) - Method in interface org.jgrapht.util.WeightCombiner
-
Combines two weights.
- comparator - Variable in class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
- comparator - Variable in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
- comparator - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- comparator - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- comparator - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
- compare(Double, Double) - Method in class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Compares two floating point values.
- compare(T, T) - Method in class org.jgrapht.alg.util.AlwaysEqualComparator
- compare(V, V) - Method in class org.jgrapht.alg.util.VertexDegreeComparator
-
Compare the degrees of
v1
andv2
, taking into account whether ascending or descending order is used. - compareTo(StoerWagnerMinimumCut.VertexAndWeight) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
compareTo that sorts in reverse order because we need extract-max and queue provides extract-min.
- compareTo(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
- compareTo(ModifiableInteger) - Method in class org.jgrapht.util.ModifiableInteger
-
Compares two
ModifiableInteger
objects numerically. - ComplementGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generator which produces the complement graph of a given input graph.
- ComplementGraphGenerator(Graph<V, E>) - Constructor for class org.jgrapht.generate.ComplementGraphGenerator
-
Complement Graph Generator
- ComplementGraphGenerator(Graph<V, E>, boolean) - Constructor for class org.jgrapht.generate.ComplementGraphGenerator
-
Complement Graph Generator.
- CompleteBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a complete bipartite graph of any size.
- CompleteBipartiteGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.CompleteBipartiteGraphGenerator
-
Creates a new CompleteBipartiteGraphGenerator object.
- CompleteBipartiteGraphGenerator(Set<V>, Set<V>) - 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() - Constructor for class org.jgrapht.generate.CompleteGraphGenerator
-
Construct a new CompleteGraphGenerator.
- CompleteGraphGenerator(int) - Constructor for class org.jgrapht.generate.CompleteGraphGenerator
-
Construct a new CompleteGraphGenerator.
- compose(IsomorphicGraphMapping<V, E>) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Computes the composition of two isomorphisms.
- composeFlow() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Create a map which specifies for each edge in the input map the amount of flow that flows through it
- compute() - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Compute the centrality index
- compute() - Method in class org.jgrapht.alg.scoring.HarmonicCentrality
- computeContractionHierarchy() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes contraction hierarchy for
graph
. - computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
- computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
- computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
- computePartialCycle() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Computes a partial cycle assuming that all vertices have an even degree.
- computeSpanningForest() - Method in class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
-
Compute a spanning forest of the graph.
- computeSpanningForest() - Method in class org.jgrapht.alg.cycle.QueueBFSFundamentalCycleBasis
-
Compute a spanning forest of the graph using a straightforward BFS implementation.
- computeSpanningForest() - Method in class org.jgrapht.alg.cycle.StackBFSFundamentalCycleBasis
-
Compute a spanning forest of the graph using a stack (LIFO) based BFS implementation.
- concat(GraphWalk<V, E>, Function<GraphWalk<V, E>, Double>) - Method in class org.jgrapht.graph.GraphWalk
-
Concatenates the specified GraphWalk to the end of this GraphWalk.
- 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.connectivity.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.connectivity.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.connectivity
-
Allows obtaining various connectivity aspects of a graph.
- ConnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.ConnectivityInspector
-
Creates a connectivity inspector for the specified graph.
- contains(Object) - Method in class org.jgrapht.util.UnmodifiableUnionSet
- contains(Object) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- containsAll(Collection<?>) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- containsEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns
true
if this graph contains the specified edge. - containsEdge(E) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns
true
if this graph contains the specified edge. - containsEdge(E) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns
true
if this graph contains the specified edge. - containsEdge(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Check if an edge exists
- containsEdge(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns
true
if this graph contains the specified edge. - containsEdge(E) - Method in interface org.jgrapht.Graph
-
Returns
true
if this graph contains the specified edge. - containsEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns
true
if this graph contains the specified edge. - containsEdge(E) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Check if an edge exists
- containsEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns
true
if this graph contains the specified edge. - containsEdge(V, V) - Method in class org.jgrapht.graph.AbstractGraph
- containsEdge(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns
true
if and only if this graph contains an edge going from the source vertex to the target vertex. - 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. - containsNode(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns true if this
DoublyLinkedList
contains the specifiedDoublyLinkedList.ListNode
. - containsPoint(Box2D, Point2D) - Static method in class org.jgrapht.alg.drawing.model.Boxes
-
Test whether a box contains a point.
- containsPoint(Box2D, Point2D, Comparator<Double>) - Static method in class org.jgrapht.alg.drawing.model.Boxes
-
Test whether a box contains a point.
- containsVertex(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns
true
if this graph contains the specified vertex. - containsVertex(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns
true
if this graph contains the specified vertex. - containsVertex(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns
true
if this graph contains the specified vertex. - containsVertex(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns
true
if this graph contains the specified vertex. - containsVertex(V) - Method in interface org.jgrapht.Graph
-
Returns
true
if this graph contains the specified vertex. - containsVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns
true
if this graph contains the specified vertex. - containsVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns
true
if this graph contains the specified vertex. - ContractionHierarchyBidirectionalDijkstra<V,E> - Class in org.jgrapht.alg.shortestpath
-
Implementation of the hierarchical query algorithm based on the bidirectional Dijkstra search.
- ContractionHierarchyBidirectionalDijkstra(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Constructs a new instance of the algorithm for a given
hierarchy
. - ContractionHierarchyBidirectionalDijkstra(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>, double, Supplier<AddressableHeap<Double, Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Constructs a new instance of the algorithm for the given
hierarchy
,radius
andheapSupplier
. - ContractionHierarchyBidirectionalDijkstra(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Constructs a new instance of the algorithm for a given
graph
. - ContractionHierarchyPrecomputation<V,E> - Class in org.jgrapht.alg.shortestpath
-
Parallel implementation of the contraction hierarchy route planning precomputation technique.
- ContractionHierarchyPrecomputation(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
. - ContractionHierarchyPrecomputation(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
andparallelism
. - ContractionHierarchyPrecomputation(Graph<V, E>, int, Supplier<Random>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
,parallelism
andrandomSupplier
. - ContractionHierarchyPrecomputation(Graph<V, E>, int, Supplier<Random>, Supplier<AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
,parallelism
,randomSupplier
andshortcutsSearchHeapSupplier
. - ContractionHierarchyPrecomputation(Graph<V, E>, Supplier<Random>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
andrandomSupplier
. - ContractionHierarchyPrecomputation.ContractionEdge<E1> - Class in org.jgrapht.alg.shortestpath
-
Edge for building the contraction hierarchy.
- ContractionHierarchyPrecomputation.ContractionHierarchy<V,E> - Class in org.jgrapht.alg.shortestpath
-
Return type of this algorithm.
- ContractionHierarchyPrecomputation.ContractionVertex<V1> - Class in org.jgrapht.alg.shortestpath
-
Vertex for building the contraction hierarchy, which contains an original vertex from
graph
. - convertToLineGraph(Graph<E, EE>) - Method in class org.jgrapht.alg.transform.LineGraphConverter
-
Constructs a line graph $L(G)$ of the input graph $G(V,E)$.
- convertToLineGraph(Graph<E, EE>, BiFunction<E, E, Double>) - Method in class org.jgrapht.alg.transform.LineGraphConverter
-
Constructs a line graph of the input graph.
- coordinates - Variable in class org.jgrapht.alg.drawing.model.Box2D
-
The coordinates of the lower corner
- copy() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Copy a vertex cover.
- Coreness<V,E> - Class in org.jgrapht.alg.scoring
-
Computes the coreness of each vertex in an undirected graph.
- Coreness(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.Coreness
-
Constructor
- CORNER_VERTEX - Static variable in class org.jgrapht.generate.GridGraphGenerator
-
Role for the vertices at the corners.
- COST_INF - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
A cost which is considered to be infinite.
- countSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Count the number of simple cycles.
- coxeterGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- create() - Method in interface org.jgrapht.alg.util.extension.ExtensionFactory
-
Factory method which creates a new object which extends Extension
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultUndirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.Multigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.Pseudograph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultUndirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.Multigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.Pseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.WeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.WeightedPseudograph
-
Create a builder for this kind of graph.
- createDefaultEdgeSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a default edge supplier.
- createDefaultWeightedEdgeSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a default weighted edge supplier.
- createEdgeSet(V) - Method in interface org.jgrapht.graph.EdgeSetFactory
-
Create a new edge set for a particular vertex.
- createEdgeSet(V) - Method in class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
-
Create a new edge set for a particular vertex.
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Creates an edge given an edge supplier and adds it to the edge containers of its source and target vertices only if the graph does not contain other edges with the same source and target vertices.
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
- createEdgeTraversalEvent(E) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Create an edge traversal event.
- createExtension() - Method in class org.jgrapht.alg.util.extension.ExtensionManager
-
Creates and returns an extension object.
- createIntegerSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create an integer supplier which returns a sequence starting from zero.
- createIntegerSupplier(int) - Static method in class org.jgrapht.util.SupplierUtil
-
Create an integer supplier which returns a sequence starting from a specific numbers.
- createLongSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a long supplier which returns a sequence starting from zero.
- createLongSupplier(long) - Static method in class org.jgrapht.util.SupplierUtil
-
Create a long supplier which returns a sequence starting from a specific numbers.
- createPath(BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V, E>, BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V, E>, double, V, V, V) - Method in class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm
-
Builds shortest path between
source
andsink
based on the information provided by search frontiers and common vertex. - createRandomUUIDStringSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a string supplier which returns random UUIDs.
- createStringSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a string supplier which returns unique strings.
- createStringSupplier(int) - Static method in class org.jgrapht.util.SupplierUtil
-
Create a string supplier which returns unique strings.
- createSupplier(Class<? extends T>) - Static method in class org.jgrapht.util.SupplierUtil
-
Create a supplier from a class which calls the default constructor.
- createVertexTraversalEvent(V) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Create a vertex traversal event.
- CrossComponentIterator<V,E,D> - Class in org.jgrapht.traverse
-
Provides a cross-connected-component traversal functionality for iterator subclasses.
- CrossComponentIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- CrossComponentIterator(Graph<V, E>, Iterable<V>) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- CrossComponentIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- crossComponentTraversal - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- CUT_OFF - Static variable in class org.jgrapht.util.RadixSort
- cutEdges - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- CycleBasisAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Allows to derive an undirected cycle basis of a given graph.
- CycleBasisAlgorithm.CycleBasis<V,E> - Interface in org.jgrapht.alg.interfaces
-
An undirected cycle basis.
- CycleBasisAlgorithm.CycleBasisImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the undirected cycle basis interface.
- CycleBasisImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Construct a new instance.
- CycleBasisImpl(Graph<V, E>, Set<List<E>>, int, double) - Constructor for class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Construct a new instance.
- CycleDetector<V,E> - Class in org.jgrapht.alg.cycle
-
Performs cycle detection on a graph.
- CycleDetector(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.CycleDetector
-
Creates a cycle detector for the specified graph.
- Cycles - Class in org.jgrapht.alg.cycle
-
Collection of helper methods related to cycles.
- Cycles() - Constructor for class org.jgrapht.alg.cycle.Cycles
D
- dag() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed acyclic graph.
- DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.AlphaCentrality
-
Damping factor default value.
- DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Damping factor default value.
- decompose(MatchingAlgorithm.Matching<V, E>, boolean) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
-
Perform the decomposition, using a pre-calculated bipartite matching
- decrement() - Method in class org.jgrapht.util.ModifiableInteger
-
Subtracts one from the value of this modifiable integer.
- DEFAULT_EDGE_SUPPLIER - Static variable in class org.jgrapht.util.SupplierUtil
-
Supplier for
DefaultEdge
. - DEFAULT_EDGE_WEIGHT - Static variable in interface org.jgrapht.Graph
-
The default weight for an edge.
- DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Default tolerance.
- DEFAULT_EPSILON - Static variable in interface org.jgrapht.alg.interfaces.MatchingAlgorithm
-
Default tolerance used by algorithms comparing floating point values.
- DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Default tolerance used by the comparator.
- DEFAULT_ITERATIONS - Static variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Default number of iterations
- DEFAULT_NORMALIZATION_FACTOR - Static variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Default normalization factor when calculating optimal distance
- DEFAULT_OPTIONS - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default options
- DEFAULT_SCALING_FACTOR - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Default scaling factor
- DEFAULT_THETA_FACTOR - Static variable in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Default $\theta$ value for approximation using the Barnes-Hut technique
- DEFAULT_USE_HEURISTICS - Static variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Default value on whether to use extra heuristics to improve the result.
- DEFAULT_WEIGHTED_EDGE_SUPPLIER - Static variable in class org.jgrapht.util.SupplierUtil
-
Supplier for
DefaultWeightedEdge
. - DefaultDirectedGraph<V,E> - Class in org.jgrapht.graph
-
The default implementation of a directed graph.
- DefaultDirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultDirectedGraph
-
Creates a new graph.
- DefaultDirectedGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DefaultDirectedGraph
-
Creates a new graph.
- DefaultDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
-
The default implementation of a directed weighted graph.
- DefaultDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Creates a new graph.
- DefaultDirectedWeightedGraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Creates a new graph.
- DefaultEdge - Class in org.jgrapht.graph
-
A default implementation for edges in a
Graph
. - DefaultEdge() - Constructor for class org.jgrapht.graph.DefaultEdge
- DefaultEdgeFunction<E,T> - Class in org.jgrapht.graph
-
Default implementation of an edge function which uses a map to store values.
- DefaultEdgeFunction(T) - Constructor for class org.jgrapht.graph.DefaultEdgeFunction
-
Create a new function
- DefaultEdgeFunction(T, Map<E, T>) - Constructor for class org.jgrapht.graph.DefaultEdgeFunction
-
Create a new function
- 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.
- DefaultGraphSpecificsStrategy<V,E> - Class in org.jgrapht.graph
-
A default lookup specifics strategy implementation.
- DefaultGraphSpecificsStrategy() - Constructor for class org.jgrapht.graph.DefaultGraphSpecificsStrategy
- DefaultGraphType - Class in org.jgrapht.graph
-
Default implementation of the graph type.
- DefaultGraphType.Builder - Class in org.jgrapht.graph
-
A builder for
DefaultGraphType
. - 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 byVertexSetListener
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.
- DefaultManyToManyShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Naive algorithm for many-to-many shortest paths problem using.
- DefaultManyToManyShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
-
Constructs a new instance of the algorithm for a given
graph
. - DefaultManyToManyShortestPaths(Graph<V, E>, Function<Graph<V, E>, ShortestPathAlgorithm<V, E>>) - Constructor for class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
-
Constructs a new instance of the algorithm for a given
graph
andfunction
. - DefaultUndirectedGraph<V,E> - Class in org.jgrapht.graph
-
The default implementation of an undirected graph.
- DefaultUndirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultUndirectedGraph
-
Creates a new graph.
- DefaultUndirectedGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DefaultUndirectedGraph
-
Creates a new graph.
- DefaultUndirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
-
The default implementation of an undirected weighted graph.
- DefaultUndirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Creates a new graph.
- DefaultUndirectedWeightedGraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Creates a new graph.
- defaultValue - Variable in class org.jgrapht.graph.DefaultEdgeFunction
- DefaultWeightedEdge - Class in org.jgrapht.graph
-
A default implementation for edges in a weighted graph.
- DefaultWeightedEdge() - Constructor for class org.jgrapht.graph.DefaultWeightedEdge
- DegeneracyBronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Bron-Kerbosch maximal clique enumeration algorithm with pivot and degeneracy ordering.
- DegeneracyBronKerboschCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.DegeneracyBronKerboschCliqueFinder
-
Constructs a new clique finder.
- DegeneracyBronKerboschCliqueFinder(Graph<V, E>, long, TimeUnit) - Constructor for class org.jgrapht.alg.clique.DegeneracyBronKerboschCliqueFinder
-
Constructs a new clique finder.
- DegeneracyOrderingIterator<V,E> - Class in org.jgrapht.traverse
-
A degeneracy ordering iterator.
- DegeneracyOrderingIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.DegeneracyOrderingIterator
-
Constructor
- degree - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
degree of this vertex
- degreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in interface org.jgrapht.Graph
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns the degree of the specified vertex.
- degreeOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns the degree of the specified vertex.
- DeltaSteppingShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
Parallel implementation of a single-source shortest path algorithm: the delta-stepping algorithm.
- DeltaSteppingShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DeltaSteppingShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph and delta.
- DeltaSteppingShortestPath(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph, delta, parallelism.
- DeltaSteppingShortestPath(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph and parallelism.
- demands - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the demand function over all vertices.
- DenseEdmondsMaximumCardinalityMatching<V,E> - Class in org.jgrapht.alg.matching
-
This implementation of Edmonds' blossom algorithm computes maximum cardinality matchings in undirected graphs.
- DenseEdmondsMaximumCardinalityMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Constructs a new instance of the algorithm.
- DenseEdmondsMaximumCardinalityMatching(Graph<V, E>, MatchingAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Constructs a new instance of the algorithm.
- DepthFirstIterator<V,E> - Class in org.jgrapht.traverse
-
A depth-first iterator for a directed or 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>, Iterable<V>) - 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.
- DepthFirstIterator.VisitColor - Enum in org.jgrapht.traverse
-
Standard vertex visit state enumeration.
- desarguesGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DESCENDING - org.jgrapht.alg.util.VertexDegreeComparator.Order
- descendingIterator() - Method in class org.jgrapht.util.DoublyLinkedList
- detectCycles() - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Performs yes/no cycle detection on the entire graph.
- detectCyclesContainingVertex(V) - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Performs yes/no cycle detection on an individual vertex.
- dfs(DinicMFImpl.VertexExtension, double) - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Finds a blocking flow in the network.
- diamondGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DijkstraManyToManyShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Naive algorithm for many-to-many shortest paths problem using
DijkstraClosestFirstIterator
. - DijkstraManyToManyShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
graph
. - DijkstraShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of Dijkstra's shortest path algorithm using a pairing heap by default.
- DijkstraShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DijkstraShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DijkstraShortestPath(Graph<V, E>, double, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DijkstraShortestPath(Graph<V, E>, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- dinic() - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Runs Dinic algorithm with scaling.
- DinicMFImpl<V,E> - Class in org.jgrapht.alg.flow
-
Implementation of <a href = "https://en.wikipedia.org/wiki/Dinic%27s_algorithm">Dinic algorithm</a> with scaling for <a href = "https://en.wikipedia.org/wiki/Maximum_flow_problem"maximum"maximum flow problem</a>.
- DinicMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.DinicMFImpl
-
Constructor.
- DinicMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.DinicMFImpl
-
Constructor.
- directed() - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder for a directed graph.
- directed() - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set the type as directed.
- DirectedAcyclicGraph<V,E> - Class in org.jgrapht.graph
-
A directed acyclic graph (DAG).
- DirectedAcyclicGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, boolean, boolean) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, DirectedAcyclicGraph.VisitedStrategyFactory, DirectedAcyclicGraph.TopoOrderMap<V>, boolean) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, DirectedAcyclicGraph.VisitedStrategyFactory, DirectedAcyclicGraph.TopoOrderMap<V>, boolean, boolean) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph.Region - Class in org.jgrapht.graph
-
An inclusive range of indices: [start, finish].
- DirectedAcyclicGraph.TopoOrderMap<V> - Interface in org.jgrapht.graph
-
An interface for storing the topological ordering.
- DirectedAcyclicGraph.TopoVertexBiMap<V> - Class in org.jgrapht.graph
-
A dual map implementation of the topological order map.
- DirectedAcyclicGraph.TopoVertexMap - Class in org.jgrapht.graph
-
An implementation of the topological order map which for performance and flexibility uses an ArrayList for topological index to vertex mapping, and a HashMap for vertex to topological index mapping.
- DirectedAcyclicGraph.VisitedArrayImpl - Class in org.jgrapht.graph
-
A visited strategy using an array.
- DirectedAcyclicGraph.VisitedArrayListImpl - Class in org.jgrapht.graph
-
A visited strategy using an
ArrayList
. - DirectedAcyclicGraph.VisitedBitSetImpl - Class in org.jgrapht.graph
-
A visited strategy which uses a
BitSet
. - DirectedAcyclicGraph.VisitedHashSetImpl - Class in org.jgrapht.graph
-
A visited strategy using a
HashSet
. - DirectedAcyclicGraph.VisitedStrategy - Interface in org.jgrapht.graph
-
A strategy for marking vertices as visited.
- DirectedAcyclicGraph.VisitedStrategyFactory - Interface in org.jgrapht.graph
-
A visited strategy factory.
- DirectedEdgeContainer<V,E> - Class in org.jgrapht.graph.specifics
-
A container for vertex edges.
- directedGraph - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- directedMultigraph() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed multigraph type.
- 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 graph.
- DirectedMultigraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DirectedMultigraph
-
Creates a new graph.
- directedPseudograph() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed pseudograph type.
- DirectedPseudograph<V,E> - Class in org.jgrapht.graph
-
A directed pseudograph.
- DirectedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph
-
Creates a new graph.
- DirectedPseudograph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DirectedPseudograph
-
Creates a new graph.
- DirectedScaleFreeGraphGenerator<V,E> - Class in org.jgrapht.generate
-
A generator for directed scale-free graphs.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Constructs a Generator.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, long) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Constructs a Generator using a seed for the random number generator.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, long, boolean, boolean) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Constructs a Generator using a seed for the random number generator and sets the two relaxation options
allowingMultipleEdges
andallowingSelfLoops
. - DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, Random) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Construct a new generator using the provided random number generator.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, Random, boolean, boolean) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Construct a new generator using the provided random number generator and sets the two relaxation options
allowingMultipleEdges
andallowingSelfLoops
. - directedSimple() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed simple graph type.
- DirectedSimpleCycles<V,E> - Interface in org.jgrapht.alg.cycle
-
A common interface for classes implementing algorithms for enumeration of the simple cycles of a directed graph.
- DirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics
-
Plain implementation of DirectedSpecifics.
- DirectedSpecifics(Graph<V, E>, Map<V, DirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.DirectedSpecifics
-
Construct a new directed specifics.
- 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 graph.
- DirectedWeightedMultigraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
-
Creates a new graph.
- 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 weighted graph.
- DirectedWeightedPseudograph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
-
Creates a new weighted graph.
- dodecahedronGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- doubleStarSnarkGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- doubleValue() - Method in class org.jgrapht.util.ModifiableInteger
- DoublyLinkedList<E> - Class in org.jgrapht.util
-
DoublyLinkedList
implements a doubly linkedList
data structure, that exposes itsListNodes
where the data is stored in. - DoublyLinkedList() - Constructor for class org.jgrapht.util.DoublyLinkedList
- DoublyLinkedList.ListNode<V> - Interface in org.jgrapht.util
-
Container for the elements stored in a
DoublyLinkedList
. - DoublyLinkedList.ListNodeIterator<E> - Interface in org.jgrapht.util
- DoublyLinkedList.NodeIterator<E> - Interface in org.jgrapht.util
- doyleGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
-
Generate the Doyle Graph
- drawableArea - Variable in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- DualSolution(Graph<V, E>, Map<Set<V>, Double>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
-
Constructs a new solution for the dual linear program
- DulmageMendelsohnDecomposition<V,E> - Class in org.jgrapht.alg.decomposition
-
This class computes a Dulmage-Mendelsohn Decomposition of a bipartite graph.
- DulmageMendelsohnDecomposition(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
-
Construct the algorithm for a given bipartite graph $G=(V_1,V_2,E)$ and it's partitions $V_1$ and $V_2$, where $V_1\cap V_2=\emptyset$.
- DulmageMendelsohnDecomposition.Decomposition<V,E> - Class in org.jgrapht.alg.decomposition
-
The output of a decomposition operation
- dürerGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DUTCHWINDMILL - org.jgrapht.generate.WindmillGraphsGenerator.Mode
E
- e - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- 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.
- EDGE_WEIGHT_UPDATED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge weight updated event.
- edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.util.NeighborCache
- edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
-
Notifies that an edge has been added to the graph.
- EdgeBasedTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover
-
Finds a 2-approximation for a minimum vertex cover A vertex cover is a set of vertices that touches all the edges in the graph.
- EdgeBasedTwoApproxVCImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl
-
Constructs a new EdgeBasedTwoApproxVCImpl instance
- edgeClass(Class<E1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the edge class.
- edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- edgeCount() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Get number of vertex edges
- edgeExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- edgeList - Variable in class org.jgrapht.graph.GraphWalk
- edgeMap - Variable in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- edgeMask - Variable in class org.jgrapht.graph.MaskSubgraph
- EdgeNode(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode, E, HierholzerEulerianCycle.EdgeNode, HierholzerEulerianCycle.EdgeNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
-
Create EdgeNode
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.util.NeighborCache
- 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(Graph<V, E>) - Constructor for class org.jgrapht.graph.EdgeReversedGraph
-
Creates a new EdgeReversedGraph.
- edges - Variable in class org.jgrapht.graph.MaskSubgraph
- edgeSet - Variable in class org.jgrapht.graph.AsSubgraph
- edgeSet() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.AsSubgraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in interface org.jgrapht.Graph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of the edges contained in this graph.
- edgeSetFactory - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
- edgeSetFactory - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
- EdgeSetFactory<V,E> - Interface in org.jgrapht.graph
-
A factory for edge sets.
- edgeSetToTour(Set<E>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Transform from a Set representation to a graph path.
- edgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns a set of all edges touching the specified vertex.
- edgeSource - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The source vertex of the edge that this event is related to.
- edgeSupplier(Supplier<E1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the edge supplier.
- edgeTarget - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The target vertex of the edge that this event is related to.
- EdgeTraversalEvent<E> - Class in org.jgrapht.event
-
A traversal event for a graph edge.
- EdgeTraversalEvent(Object, E) - Constructor for class org.jgrapht.event.EdgeTraversalEvent
-
Creates a new EdgeTraversalEvent.
- edgeTraversed(EdgeTraversalEvent<E>) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform the listener that the specified edge have been visited during the graph traversal.
- edgeTraversed(EdgeTraversalEvent<E>) - Method in class org.jgrapht.event.TraversalListenerAdapter
- edgeWeight - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The weight of the edge that this event is related to.
- edgeWeightUpdated(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
-
Notifies that an edge weight has been updated.
- EdmondsKarpMFImpl<V,E> - Class in org.jgrapht.alg.flow
-
This class computes a maximum flow in a flow network using Edmonds-Karp algorithm.
- EdmondsKarpMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
Constructs
MaximumFlow
instance to work with a copy ofnetwork
. - EdmondsKarpMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
Constructs
MaximumFlow
instance to work with a copy ofnetwork
. - element() - Method in class org.jgrapht.util.DoublyLinkedList
- ellinghamHorton54Graph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- ellinghamHorton78Graph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- EmbeddingImpl(Graph<V, E>, Map<V, List<E>>) - Constructor for class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Creates new embedding of the
graph
- EmptyGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates an empty graph of any size.
- EmptyGraphGenerator(int) - Constructor for class org.jgrapht.generate.EmptyGraphGenerator
-
Construct a new EmptyGraphGenerator.
- emptyWalk(Graph<V, E>) - Static method in class org.jgrapht.graph.GraphWalk
-
Convenience method which creates an empty walk.
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Update data structures the first time we see a vertex.
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.DepthFirstIterator
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.RandomWalkIterator
-
Update data structures every time we see a vertex.
- 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
- END_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the last vertex generated.
- endVertex - Variable in class org.jgrapht.graph.GraphWalk
- enqueue(int) - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Add an element to the queue.
- EppsteinKShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
Implementation of the Eppstein`s algorithm for finding $k$ shortest path between two vertices in a graph.
- EppsteinKShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinKShortestPath
-
Constructs the algorithm instance for the given
graph
. - EppsteinShortestPathIterator<V,E> - Class in org.jgrapht.alg.shortestpath
-
Iterator over the shortest paths (not required to be simple) between two vertices in a graph sorted by weight.
- EppsteinShortestPathIterator(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Constructs an instance of the algorithm for the given
graph
,source
andsink
. - EPS - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default epsilon used in the algorithm
- equals(Object) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- equals(Object) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- equals(Object) - Method in class org.jgrapht.alg.drawing.model.Box2D
- equals(Object) - Method in class org.jgrapht.alg.drawing.model.Point2D
- equals(Object) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- equals(Object) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
- equals(Object) - Method in class org.jgrapht.alg.util.Pair
- equals(Object) - Method in class org.jgrapht.alg.util.Triple
- equals(Object) - Method in class org.jgrapht.alg.util.UnorderedPair
- equals(Object) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
- equals(Object) - Method in class org.jgrapht.graph.AbstractGraph
-
Indicates whether some other object is "equal to" this graph.
- equals(Object) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Indicates whether some other object is "equal to" this graph.
- equals(Object) - Method in class org.jgrapht.graph.GraphWalk
- 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.WeightedUnmodifiableSet
- equals(Point2D, Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Compare two points for equality using tolerance 1e-9.
- erreraGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- EsauWilliamsCapacitatedMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
Implementation of a randomized version of the Esau-Williams heuristic, a greedy randomized adaptive search heuristic (GRASP) for the capacitated minimum spanning tree (CMST) problem.
- EsauWilliamsCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>, int) - Constructor for class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Constructs an Esau-Williams GRASP algorithm instance.
- EulerianCycleAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Computes an Eulerian cycle of an Eulerian graph.
- eulerianHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- EulerTourRMQLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Algorithm for computing lowest common ancestors in rooted trees and forests based on Berkman, Omer; Vishkin, Uzi (1993), "Recursive Star-Tree Parallel Data Structure", SIAM Journal on Computing, 22 (2): 221–242, doi:10.1137/0222017.
- EulerTourRMQLCAFinder(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Construct a new instance of the algorithm.
- EulerTourRMQLCAFinder(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Construct a new instance of the algorithm.
- EXOGENOUS_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.AlphaCentrality
-
Exogenous factor default value.
- Extension - Interface in org.jgrapht.alg.util.extension
-
Class which represents an abstract extension/encapsulation object.
- ExtensionFactory<B extends Extension> - Interface in org.jgrapht.alg.util.extension
-
Factory class which creates extension/encapsulation objects
- ExtensionManager<T,B extends Extension> - Class in org.jgrapht.alg.util.extension
-
Convenience class to manage extensions/encapsulations.
- ExtensionManager(ExtensionFactory<B>) - Constructor for class org.jgrapht.alg.util.extension.ExtensionManager
-
Create a new extension manager.
F
- factorial(int) - Static method in class org.jgrapht.util.MathUtil
-
Calculate the factorial of $n$.
- FastLookupDirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics
-
Fast implementation of DirectedSpecifics.
- FastLookupDirectedSpecifics(Graph<V, E>, Map<V, DirectedEdgeContainer<V, E>>, Map<Pair<V, V>, Set<E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
-
Construct a new fast lookup directed specifics.
- FastLookupGraphSpecificsStrategy<V,E> - Class in org.jgrapht.graph
-
The fast lookup specifics strategy implementation.
- FastLookupGraphSpecificsStrategy() - Constructor for class org.jgrapht.graph.FastLookupGraphSpecificsStrategy
- FastLookupUndirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics
-
Fast implementation of UndirectedSpecifics.
- FastLookupUndirectedSpecifics(Graph<V, E>, Map<V, UndirectedEdgeContainer<V, E>>, Map<Pair<V, V>, Set<E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
-
Construct a new fast lookup undirected specifics.
- find(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the representative element of the set that element is in.
- findCliques(Set<V>, Set<V>, Set<V>, long) - Method in class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Recursive implementation of the Bron-Kerbosch with pivot.
- findCycles() - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Finds the vertex set for the subgraph of all cycles.
- findCyclesContainingVertex(V) - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Finds the vertex set for the subgraph of all cycles which contain a particular vertex.
- findPathBetween(Graph<Integer, E>, Integer, Integer) - Static method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Find a path between two vertices.
- findSimpleCycles() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Find the simple cycles of the graph.
- 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, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified edge was added.
- fireEdgeRemoved(E, V, V, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified edge was removed.
- fireEdgeTraversed(EdgeTraversalEvent<E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified edge was visited.
- fireEdgeWeightUpdated(E, V, V, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the weight of an edge has changed.
- fireVertexAdded(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified vertex was added.
- fireVertexFinished(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified vertex was finished.
- fireVertexRemoved(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified vertex was removed.
- fireVertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified vertex was visited.
- first - Variable in class org.jgrapht.alg.util.Pair
-
The first pair element
- first - Variable in class org.jgrapht.alg.util.Triple
-
The first element
- first - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
- first(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
Set the first partition of the generator.
- FIRST - Static variable in interface org.jgrapht.util.WeightCombiner
-
First weight.
- fixed - Variable in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- FixedSizeIntegerQueue - Class in org.jgrapht.alg.util
-
Primitive but efficient implementation of a fixed size queue for integers.
- FixedSizeIntegerQueue(int) - Constructor for class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Create a queue of fixed size.
- floatValue() - Method in class org.jgrapht.util.ModifiableInteger
- FlowAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Interface for flow algorithms
- FlowAlgorithm.Flow<E> - Interface in org.jgrapht.alg.interfaces
-
Represents a flow.
- FlowAlgorithm.FlowImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of
FlowAlgorithm.Flow
- FlowImpl(Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.FlowAlgorithm.FlowImpl
-
Constructs a new flow
- FloydWarshallShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
The Floyd-Warshall algorithm.
- FloydWarshallShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.
- folkmanGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- forGraph(Graph<V, E>) - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder which will create the same graph type as the parameter graph.
- forGraphType(GraphType) - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder which will create a graph with the same type as the one provided.
- FRACTIONAL - org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- franklinGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- FRLayoutAlgorithm2D<V,E> - Class in org.jgrapht.alg.drawing
-
Fruchterman and Reingold Force-Directed Placement Algorithm.
- FRLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int, double) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int, double, BiFunction<LayoutModel2D<V>, Integer, FRLayoutAlgorithm2D.TemperatureModel>, Random) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int, double, Random) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D.InverseLinearTemperatureModel - Class in org.jgrapht.alg.drawing
-
An inverse linear temperature model.
- FRLayoutAlgorithm2D.TemperatureModel - Interface in org.jgrapht.alg.drawing
-
A general interface for a temperature model.
- fruchtGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
G
- g - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- g - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
The graph
- GabowStrongConnectivityInspector<V,E> - Class in org.jgrapht.alg.connectivity
-
Computes the strongly connected components of a directed graph.
- GabowStrongConnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
-
Constructor
- generalizedPetersenGraph(int, int) - Static method in class org.jgrapht.generate.NamedGraphGenerator
- GeneralizedPetersenGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generator for Generalized Petersen Graphs The Generalized Petersen graphs $GP(n,k)$ are a family of cubic graphs formed by connecting the vertices of a regular polygon (cycle graph $C_n$) to the corresponding vertices of a star polygon ${n,k}$.
- GeneralizedPetersenGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Constructs a GeneralizedPetersenGraphGenerator used to generate a Generalized Petersen graphs $GP(n,k)$.
- generateBidiakisCubeGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Bidiakis cube Graph.
- generateBlanusaFirstSnarkGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the First Blanusa Snark Graph.
- generateBlanusaSecondSnarkGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Second Blanusa Snark Graph.
- generateBrinkmannGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Brinkmann Graph.
- generateBuckyBallGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Bucky ball Graph.
- generateBullGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Bull Graph.
- generateButterflyGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Butterfly Graph.
- generateChvatalGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Chvatal Graph.
- generateClawGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Claw Graph.
- generateClebschGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Clebsch Graph.
- generateCoxeterGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Coxeter Graph.
- generateDesarguesGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Desargues Graph.
- generateDiamondGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Diamond Graph.
- generateDodecahedronGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Dodecahedron Graph.
- generateDoubleStarSnarkGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Double Star Snark Graph.
- generateDoyleGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Doyle Graph.
- generateDürerGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Dürer Graph.
- generateEllinghamHorton54Graph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Ellingham-Horton 54 Graph.
- generateEllinghamHorton78Graph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Ellingham-Horton 78 Graph.
- generateErreraGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Errera Graph.
- generateFolkmanGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Folkman Graph.
- generateFranklinGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Franklin Graph.
- generateFruchtGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Frucht Graph.
- generateGoldnerHararyGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Goldner-Harary Graph.
- generateGossetGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Gosset Graph.
- generateGraph(Graph<V, E>) - Method in interface org.jgrapht.generate.GraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, List<V>>) - Method in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Generates the Generalized Petersen Graph
- generateGraph(Graph<V, E>, Map<String, T>) - Method in interface org.jgrapht.generate.GraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Generates an instance.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Generates an instance.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.ComplementGraphGenerator
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
-
Construct a complete bipartite graph
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Generates an instance of the
Graph
. - generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.EmptyGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Generates a random bipartite graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnmRandomGraphGenerator
-
Generates a random graph based on the $G(n, M)$ model
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Generates a random bipartite graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnpRandomGraphGenerator
-
Generates a random graph based on the $G(n, p)$ model.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GridGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.HyperCubeGraphGenerator
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
-
Generates a small-world graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.LinearGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
-
Generates an instance.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Generate an $l$-planted partition graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.PruferTreeGenerator
-
Generates a tree.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.RandomRegularGraphGenerator
-
Generate a random regular graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.RingGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Generates scale-free network with
size
passed to the constructor. - generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.StarGraphGenerator
-
Generates a star graph with the designated order from the constructor
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.WattsStrogatzGraphGenerator
-
Generates a small-world graph based on the Watts-Strogatz model.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.WheelGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.WindmillGraphsGenerator
- generateGrötzschGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Grötzsch Graph.
- generateHeawoodGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Heawood Graph.
- generateHerschelGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Herschel Graph.
- generateHoffmanGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Hoffman Graph.
- generateKittellGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Kittell Graph.
- generateKlein3RegularGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Klein 3-regular Graph.
- generateKlein7RegularGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Klein 7-regular Graph.
- generateKrackhardtKiteGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Krackhardt kite Graph.
- generateMöbiusKantorGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Möbius-Kantor Graph.
- generateMoserSpindleGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Moser spindle Graph.
- generateNauruGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Nauru Graph.
- generatePappusGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Pappus Graph.
- generatePetersenGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Petersen Graph.
- generatePoussinGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Poussin Graph.
- generateSchläfliGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Schläfli Graph.
- generateThomsenGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Thomsen Graph.
- generateTietzeGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Tietze Graph.
- generateTutteGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Tutte Graph.
- get(int) - Method in class org.jgrapht.util.DoublyLinkedList
- get(E) - Method in class org.jgrapht.graph.DefaultEdgeFunction
-
Get the function value for an edge.
- get(V) - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Get the last location of a particular vertex in the model.
- get(V) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- get(V) - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AsGraphUnion
-
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.AsSubgraph
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
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.concurrent.AsSynchronizedGraph
-
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.EdgeReversedGraph
- getAllEdges(V, V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- getAllEdges(V, V) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- getAllEdges(V, V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(V, V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllPaths(Set<V>, Set<V>, boolean, Integer) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Calculate (and return) all paths from the source vertices to the target vertices.
- getAllPaths(V, V, boolean, Integer) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Calculate (and return) all paths from the source vertex to the target vertex.
- getAncestors(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Get the ancestors of a vertex.
- getArcCapacityLowerBounds() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns a function which specifies the minimum capacity of an arc.
- getArcCapacityLowerBounds() - Method in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Returns a function which specifies the minimum capacity of an arc.
- getArcCapacityUpperBounds() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns a function which specifies the maximum capacity of an arc.
- getArcCapacityUpperBounds() - Method in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Returns a function which specifies the maximum capacity of an arc.
- getAtoms() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the atoms generated by the decomposition.
- getAugmentTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getAverageClusteringCoefficient() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Computes the average clustering coefficient.
- getBackwardMapping() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get an unmodifiable version of the backward mapping function.
- getBatchLCA(List<Pair<V, V>>) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return a list of LCAs for a batch of queries
- getBatchLCA(List<Pair<V, V>>) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
-
Return a list of LCAs for a batch of queries
- getBatchLCASet(List<Pair<V, V>>) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return a list of computed sets of LCAs for a batch of queries
- getBlock(V) - Method in class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Returns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected component) containing the vertex.
- getBlocks() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns all blocks (biconnected components) in the graph.
- getBlocks() - Method in class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Returns all blocks (biconnected components) in the graph
- getBlocks(V) - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns a set of blocks (biconnected components) containing the specified vertex.
- getBridges() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns the graph's bridges.
- getCapacitatedSpanningTree() - Method in interface org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm
-
Computes a capacitated spanning tree.
- getCapacitatedSpanningTree() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
- getCapacitatedSpanningTree() - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
- getCapacitatedSpanningTree() - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Computes a capacitated spanning tree.
- getCertificate() - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Returns the certificate in the form of a hole or anti-hole in the inspected graph, when the
BergeGraphInspector.isBerge(org.jgrapht.Graph<V, E>, boolean)
method is previously called withcomputeCertificate=true
. - getCertificate() - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Computes and returns the certificate in the form of a hole or anti-hole in the inspected
graph
. - getChromaticNumber() - Method in class org.jgrapht.alg.color.BrownBacktrackColoring
-
Returns the chromatic number of the input graph
- getClique() - Method in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Returns a maximum cardinality clique of the inspected
graph
. - getClique() - Method in interface org.jgrapht.alg.interfaces.CliqueAlgorithm
-
Computes a clique.
- getClustering() - Method in class org.jgrapht.alg.clustering.KSpanningTreeClustering
- getClustering() - Method in interface org.jgrapht.alg.interfaces.ClusteringAlgorithm
-
Computes a clustering.
- getClusters() - Method in interface org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering
-
Get the clusters.
- getClusters() - Method in class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
- getColorClasses() - Method in interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring
-
Get the color classes.
- getColorClasses() - Method in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
-
Get the color classes.
- getColoring() - Method in class org.jgrapht.alg.color.BrownBacktrackColoring
- getColoring() - Method in class org.jgrapht.alg.color.ChordalGraphColoring
-
Returns a minimum vertex coloring of the inspected
graph
. - getColoring() - Method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Calculates a canonical surjective k-coloring of the given graph such that the classes of the coloring form the coarsest stable partition that refines alpha.
- getColoring() - Method in class org.jgrapht.alg.color.GreedyColoring
-
Computes a vertex coloring.
- getColoring() - Method in class org.jgrapht.alg.color.SaturationDegreeColoring
-
Computes a vertex coloring.
- getColoring() - Method in interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm
-
Computes a vertex coloring.
- getColors() - Method in interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring
-
Get the color map.
- getColors() - Method in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
-
Get the color map.
- getCommunities() - Method in class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Get the community structure of the graph.
- getComponent(V) - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Returns the component id of vertex $v$ in the internal DFS tree/forest.
- getComponentArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal component array.
- getCondensation() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Compute the condensation of the given graph.
- getConnectedComponent(V) - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns the connected component containing the given vertex.
- getConnectedComponents() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns all connected components in the graph.
- getContractionGraph() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns contracted graph.
- getContractionMapping() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns mapping of the vertices in the original graph to the vertices in the contracted graph.
- getCost() - Method in interface org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlow
-
Returns the cost of the flow
- getCost() - Method in class org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlowImpl
-
Returns the cost of the flow
- getCostEstimate(V, V) - Method in interface org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic
-
An admissible "heuristic estimate" of the distance from $x$, the sourceVertex, to the goal (usually denoted $h(x)$).
- getCostEstimate(V, V) - Method in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
-
An admissible heuristic estimate from a source vertex to a target vertex.
- getCPPSolution(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.ChinesePostman
-
Solves the Chinese Postman Problem on the given graph.
- getCurrentSink() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Returns current sink vertex, or
null
if there was nocalculateMaximumFlow
calls. - getCurrentSource() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Returns current source vertex, or
null
if there was nocalculateMaximumFlow
calls. - getCutCapacity() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- getCutCapacity() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- getCutCapacity() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
-
Returns the capacity of the cut obtained after the last invocation of
MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
- getCutEdges() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- getCutEdges() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- getCutEdges() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Returns the set of edges which run from the source partition to the sink partition, in the $s-t$ cut obtained after the last invocation of
PadbergRaoOddMinimumCutset.calculateMinCut(Set, boolean)
- getCutEdges() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
-
Returns the set of edges which run from $S$ to $T$, in the $s-t$ cut obtained after the last invocation of
MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
In case of a directed graph, only the edges with their tail in $S$ and their head in $T$ are returned. - getCutpoints() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns the cutpoints (articulation points) of the graph.
- getCutpoints() - Method in class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Returns the cutpoints of the initial graph.
- getCycle() - Method in exception org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Get the actual negative cycle, or null if not provided.
- getCycleBasis() - Method in class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
-
Return a list of cycles forming an undirected cycle basis of a graph.
- getCycleBasis() - Method in class org.jgrapht.alg.cycle.PatonCycleBase
-
Return an undirected cycle basis of a graph.
- getCycleBasis() - Method in interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm
-
Return a list of cycles forming an undirected cycle basis of a graph.
- getCycles() - Method in interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis
-
Return the set of cycles of the cycle basis.
- getCycles() - Method in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Return the set of cycles of the cycle basis.
- getCyclesAsGraphPaths() - Method in interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis
-
Return the set of cycles of the cycle basis.
- getCyclesAsGraphPaths() - Method in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Return the set of cycles of the cycle basis.
- getDecomposition(boolean) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
-
Perform the decomposition, using the Hopcroft-Karp maximum-cardinality matching algorithm to perform the matching.
- getDegeneracy() - Method in class org.jgrapht.alg.scoring.Coreness
-
Compute the degeneracy of a graph.
- getDegree() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Returns the degree of the vertex
- getDelegate() - Method in class org.jgrapht.graph.GraphDelegator
-
Return the backing graph (the delegate).
- getDensity() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Computes density of a maximum density subgraph.
- getDensity() - Method in interface org.jgrapht.alg.interfaces.MaximumDensitySubgraphAlgorithm
-
Computes density of a maximum density subgraph.
- getDepth(V) - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Returns the depth of vertex $v$ in the internal DFS tree/forest.
- getDepth(V) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
Returns the depth of vertex $v$ in the search tree.
- getDepthArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal depth array.
- getDescendants(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Get the descendants of a vertex.
- getDiameter() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the diameter of the graph.
- getDiameter(Graph<V, E>) - Static method in class org.jgrapht.GraphMetrics
-
Compute the diameter of the graph.
- getDistanceAndPredecessorMap() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Get the internal map used for representing the paths.
- getDrawableArea() - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Get the drawable area of the model.
- getDrawableArea() - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- getDrawableArea() - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- getDualSolution() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Returns solution to the dual linear program formulated on the network.
- getDualSolution() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Returns the computed solution to the dual linear program with respect to the weighted perfect matching linear program formulation.
- getDualUpdatesTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getDualUpdateStrategy() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Returns dual updates strategy
- getDualVariables() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
-
The mapping from sets of vertices of odd cardinality to their dual variables, which represents a solution to the dual linear program
- getEdge() - Method in class org.jgrapht.event.EdgeTraversalEvent
-
Returns the traversed edge.
- getEdge() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the edge that this event is related to.
- getEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.AsGraphUnion
-
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.AsSubgraph
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
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.concurrent.AsSynchronizedGraph
-
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.EdgeReversedGraph
- getEdge(V, V) - Method in interface org.jgrapht.Graph
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- getEdge(V, V) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- getEdge(V, V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(V, V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdgeContainer(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Get the edge container for specified vertex.
- getEdgeContainer(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Get the edge container for a specified vertex.
- getEdgeCorrespondence(E, boolean) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- getEdgeCorrespondence(E, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
- getEdgeCorrespondence(E, boolean) - Method in interface org.jgrapht.GraphMapping
-
Gets the mapped value where the key is
edge
- getEdgeList() - Method in class org.jgrapht.graph.GraphWalk
- getEdgeList() - Method in interface org.jgrapht.GraphPath
-
Returns the edges making up the path.
- getEdges() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- getEdges() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Get the edges of the matching.
- getEdges() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
-
Get the edges of the matching.
- getEdges() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree
-
Set of edges of the spanning tree.
- getEdges() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- getEdges() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition
-
Set of edges of the path decomposition.
- getEdges() - Method in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- getEdgesAround(V) - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.Embedding
-
Returns the clockwise order of edges incident to the
vertex
- getEdgesAround(V) - Method in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Returns the clockwise order of edges incident to the
vertex
- getEdgeSet() - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Get the edge set.
- getEdgeSet() - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Get the edge set
- getEdgeSetFactory() - Method in interface org.jgrapht.graph.GraphSpecificsStrategy
-
Get an edge set factory.
- getEdgeSource() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the source vertex that this event is related to.
- getEdgeSource(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Get the source of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.EdgeReversedGraph
- getEdgeSource(E) - Method in interface org.jgrapht.Graph
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns the source vertex of an edge.
- getEdgeSource(E) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Get the source vertex of an edge.
- getEdgeSource(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns the source vertex of an edge.
- getEdgeSupplier() - Method in class org.jgrapht.graph.AbstractBaseGraph
- getEdgeSupplier() - Method in class org.jgrapht.graph.AsGraphUnion
-
Return the edge supplier that the graph uses whenever it needs to create new edges.
- getEdgeSupplier() - Method in class org.jgrapht.graph.AsSubgraph
-
Return the edge supplier that the graph uses whenever it needs to create new edges.
- getEdgeSupplier() - Method in interface org.jgrapht.Graph
-
Return the edge supplier that the graph uses whenever it needs to create new edges.
- getEdgeSupplier() - Method in class org.jgrapht.graph.GraphDelegator
-
Return the edge supplier that the graph uses whenever it needs to create new edges.
- getEdgeSupplier() - Method in class org.jgrapht.graph.MaskSubgraph
-
Return the edge supplier that the graph uses whenever it needs to create new edges.
- getEdgeTarget() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the target vertex that this event is related to.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Get the target of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.EdgeReversedGraph
- getEdgeTarget(E) - Method in interface org.jgrapht.Graph
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns the target vertex of an edge.
- getEdgeTarget(E) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Get the target vertex of an edge.
- getEdgeTarget(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns the target vertex of an edge.
- getEdgeWeight() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the weight of the edge that this event is related to.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsUnweightedGraph
- getEdgeWeight(E) - Method in class org.jgrapht.graph.AsWeightedGraph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Get the weight of an edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in interface org.jgrapht.Graph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Get the weight of an edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns the weight assigned to a given edge.
- getEdgeWeight(E) - Method in class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
- getEdgeWeightFromSourceToVertex(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
-
Getter for network weights of edges su for u in V
- getEdgeWeightFromSourceToVertex(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Getter for network weights of edges su for u in V
- getEdgeWeightFromSourceToVertex(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
- getEdgeWeightFromSourceToVertex(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
- getEdgeWeightFromVertexToSink(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
-
Getter for network weights of edges ut for u in V
- getEdgeWeightFromVertexToSink(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Getter for network weights of edges ut for u in V
- getEdgeWeightFromVertexToSink(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
- getEdgeWeightFromVertexToSink(V) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
- getEmbedding() - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm
-
Computes combinatorial embedding of the input
graph
. - getEmbedding() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Computes combinatorial embedding of the input
graph
. - getEndVertex() - Method in class org.jgrapht.graph.GraphWalk
- getEndVertex() - Method in interface org.jgrapht.GraphPath
-
Returns the end vertex in the path.
- getEntireGraphVertexIterator() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Lazily instantiates
entireGraphVertexIterator
. - getEquivalentFlowTree() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Returns the Equivalent Flow Tree as an actual tree (graph).
- getError() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Computes the error in the solution to the dual linear program.
- getError() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes the error in the solution to the dual linear program.
- getEulerianCycle(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Compute an Eulerian cycle of a graph.
- getEulerianCycle(Graph<V, E>) - Method in interface org.jgrapht.alg.interfaces.EulerianCycleAlgorithm
-
Compute an Eulerian cycle of a graph.
- getExpandNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getExpandTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getExtension(T) - Method in class org.jgrapht.alg.util.extension.ExtensionManager
-
Creates a new singleton extension object for original t if no such object exists, returns the old one otherwise.
- getFillEdges() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the fill edges generated by the triangulation.
- getFinish() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Get the end of the region (inclusive).
- getFirst() - Method in class org.jgrapht.alg.util.Pair
-
Get the first element of the pair
- getFirst() - Method in class org.jgrapht.alg.util.Triple
-
Get the first element
- getFirst() - Method in class org.jgrapht.util.DoublyLinkedList
- getFirstHop(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Returns the first hop, i.e., the second node on the shortest path from $a$ to $b$.
- getFirstNode() - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the first
node
of this list. - getFirstNodeInPathArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal firstNodeInPath array.
- getFirstPartition() - Method in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Returns the first partition of vertices in the bipartite graph.
- getFirstPartition() - Method in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Returns the first partition of vertices in the bipartite graph.
- getFlow() - Method in interface org.jgrapht.alg.interfaces.FlowAlgorithm
-
Result object of a flow algorithm
- getFlow(E) - Method in interface org.jgrapht.alg.interfaces.FlowAlgorithm.Flow
-
Returns the flow on the
edge
- getFlowCost(MinimumCostFlowProblem<V, E>) - Method in interface org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm
-
Returns the objective value (cost) of a solution to the minimum cost flow problem.
- getFlowDirection(E) - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Unsupported operation
- getFlowDirection(E) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Unsupported operation
- getFlowDirection(E) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Returns the direction of the flow on an edge $(u,v)$.
- getFlowDirection(E) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
For the specified
edge
$(u, v)$ returns vertex $v$ if the flow goes from $u$ to $v$, or returns vertex $u$ otherwise. - getFlowDirection(E) - Method in interface org.jgrapht.alg.interfaces.FlowAlgorithm
-
For the specified
edge
$(u, v)$ returns vertex $v$ if the flow goes from $u$ to $v$, or returns vertex $u$ otherwise. - getFlowMap() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Unsupported operation
- getFlowMap() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Unsupported operation
- getFlowMap() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Returns maximum flow, that was calculated during last
calculateMaximumFlow
call, ornull
, if there was nocalculateMaximumFlow
calls. - getFlowMap() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Returns mapping from edge to flow value through this particular edge
- getFlowMap() - Method in interface org.jgrapht.alg.interfaces.FlowAlgorithm.Flow
-
Returns a mapping from the network flow edges to the corresponding flow values.
- getFlowMap() - Method in class org.jgrapht.alg.interfaces.FlowAlgorithm.FlowImpl
-
Returns a mapping from the network flow edges to the corresponding flow values.
- getFlowMap() - Method in interface org.jgrapht.alg.interfaces.FlowAlgorithm
-
Returns a read-only mapping from edges to the corresponding flow values.
- getForwardMapping() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get an unmodifiable version of the forward mapping function.
- getFullComponentCount() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get a map to know for each separator how many components it produces.
- getGenerators() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the generators of the separators of the triangulated graph, i.e.
- getGirth(Graph<V, E>) - Static method in class org.jgrapht.GraphMetrics
-
Compute the girth of the graph.
- getGlobalClusteringCoefficient() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Computes the global clustering coefficient.
- getGomoryHuTree() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Returns the Gomory-Hu Tree as an actual tree (graph).
- getGraph() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the original graph.
- getGraph() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Get the graph
- getGraph() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Get the graph
- getGraph() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Get the graph
- getGraph() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Get the graph
- getGraph() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns the flow network
- getGraph() - Method in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Returns the flow network
- getGraph() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Returns the graph over which this matching is defined.
- getGraph() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- getGraph() - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.Embedding
-
Returns the underlying
graph
- getGraph() - Method in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Returns the underlying
graph
- getGraph() - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Return the underlying graph.
- getGraph() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
- getGraph() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns the underlying graph of this contraction hierarchy.
- getGraph() - Method in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
- getGraph() - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in class org.jgrapht.graph.GraphWalk
- getGraph() - Method in interface org.jgrapht.GraphPath
-
Returns the graph over which this path is defined.
- getGraph() - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Get the graph being traversed.
- getGraphCenter() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the graph center.
- getGraphCenter() - Method in class org.jgrapht.alg.shortestpath.TreeMeasurer
-
Compute the graph center.
- getGraphPeriphery() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the graph periphery.
- getGraphPseudoPeriphery() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the graph pseudo-periphery.
- getGrowNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getGrowTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getHeavyEdges() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Set of heavy edges.
- getHeight() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the height
- getHole() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
A graph which is not chordal, must contain a hole (chordless cycle on 4 or more vertices).
- getIndependentSet() - Method in class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Returns a maximum cardinality independent set of the inspected
graph
. - getIndependentSet() - Method in interface org.jgrapht.alg.interfaces.IndependentSetAlgorithm
-
Computes an independent set; all vertices are considered to have equal weight.
- getIndexList() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the index list, a mapping from unique integers to vertices.
- getIndexList() - Method in class org.jgrapht.util.VertexToIntegerMapping
-
Get the
indexList
, a mapping from integers to vertices (i.e. - getInitializationType() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Returns initialization type
- getInternalState() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Return the internal representation of the data.
- getIntrusiveEdge(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Get the intrusive edge of an edge.
- getIntrusiveEdge(E) - Method in class org.jgrapht.graph.UniformIntrusiveEdgesSpecifics
- getIntrusiveEdge(E) - Method in class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.graph.DefaultGraphSpecificsStrategy
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.graph.FastLookupGraphSpecificsStrategy
- getIntrusiveEdgesSpecificsFactory() - Method in interface org.jgrapht.graph.GraphSpecificsStrategy
-
Get a function which creates the intrusive edges specifics.
- getIterationOrder() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Returns the type of iterator used in this
ChordalityInspector
- getKuratowskiSubdivision() - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm
-
Extracts a Kuratowski subdivision from the
graph
. - getKuratowskiSubdivision() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Extracts a Kuratowski subdivision from the
graph
. - getLabel(V) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the label of the subset that contains
vertex
. - getLabels() - Method in interface org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree
-
Return the set of labels of the underlying partition of the capacitated spanning tree.
- getLabels() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- getLabels() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns all labels of all subsets.
- getLast() - Method in class org.jgrapht.util.DoublyLinkedList
- getLastHop(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Returns the last hop, i.e., the second to last node on the shortest path from $a$ to $b$.
- getLastNode() - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the last
node
of this list. - getLCA(V, V) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.NaiveLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
-
Return the LCA of a and b
- getLCASet(V, V) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return the computed set of LCAs of a and b
- getLCASet(V, V) - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLCASet(V, V) - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLCASet(V, V) - Method in class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLCASet(V, V) - Method in class org.jgrapht.alg.lca.NaiveLCAFinder
-
Return the computed set of LCAs of a and b
- getLCASet(V, V) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLength() - Method in interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis
-
Get the length of the cycle basis.
- getLength() - Method in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Get the length of the cycle basis.
- getLength() - Method in class org.jgrapht.graph.GraphWalk
- getLength() - Method in interface org.jgrapht.GraphPath
-
Returns the length of the path, measured in the number of edges.
- getLightEdges() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Set of light edges.
- getLocalAugmentationCycle() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Calculates a valid subset-disjoint negative cycle.
- getLock() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Get the read/write lock used to synchronize all access to this graph.
- getManyToManyPaths(Set<V>, Set<V>) - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm
-
Computes shortest paths from all vertices in
sources
to all vertices intargets
. - getManyToManyPaths(Set<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Computes shortest paths from all vertices in
sources
to all vertices intargets
. - getManyToManyPaths(Set<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
- getManyToManyPaths(Set<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths
-
Computes shortest paths from all vertices in
sources
to all vertices intargets
. - getMapping() - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Get an isomorphism between the input forests or
null
if none exists. - getMapping() - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Get an isomorphism between the input trees or
null
if none exists. - getMapping() - Method in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Get an isomorphism between the input trees or
null
if none exists. - getMappingDomain() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get the active domain of the isomorphism.
- getMappingRange() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get the range of the isomorphism.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
- getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
- getMatching() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm
-
Compute a matching for a given graph.
- getMatching() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Computes and returns a matching of maximum or minimum weight in the
initialGraph
depending on the goal of the algorithm. - getMatching() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes and returns a weighted perfect matching in the
graph
. - getMatching() - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Returns a matching of maximum cardinality.
- getMatching() - Method in class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching
-
Get a matching that is a $\frac{1}{2}$-approximation of the maximum cardinality matching.
- getMatching() - Method in class org.jgrapht.alg.matching.GreedyWeightedMatching
-
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
- getMatching() - Method in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- getMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
-
Compute a matching for a given graph.
- getMatching() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Compute a matching for a given graph.
- getMatching() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
- getMatching() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
- getMatchingWeight() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Get the weight of the matching.
- getMaxFailures() - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Returns the maximum allowed number of consecutive failed attempts to add an edge.
- getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.DinicMFImpl
- getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Unsupported operation
- getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Unsupported operation
- getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- getMaximumFlow(V, V) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - getMaximumFlowValue() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Returns maximum flow value, that was calculated during last
calculateMaximumFlow
call. - getMaximumFlowValue(V, V) - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Returns the Maximum flow between source and sink.
- getMaximumFlowValue(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Returns the Maximum flow between source and sink.
- getMaximumFlowValue(V, V) - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - getMaxX() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the maximum x coordinate
- getMaxY() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the maximum y coordinate
- getMeo() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the minimal elimination ordering produced by the triangulation.
- getMinimalSeparators() - Method in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Computes a set of all minimal separators of the
graph
and returns it. - getMinimalSeparatorsWithMultiplicities() - Method in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Computes a mapping of all minimal vertex separators of the
graph
and returns it. - getMinimalTriangulation() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the minimal triangulation of the graph.
- getMinimumCostFlow(MinimumCostFlowProblem<V, E>) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Calculates feasible flow of minimum cost for the minimum cost flow problem.
- getMinimumCostFlow(MinimumCostFlowProblem<V, E>) - Method in interface org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm
-
Calculates feasible flow of minimum cost for the minimum cost flow problem.
- getMinX() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the minimum x coordinate
- getMinY() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the minimum y coordinate
- getNextFreeLabel() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the next free label in the label map respectively partition
- getNode(int) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the
node
at the specified position in this list. - getNodeSupply() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns a function which defines the supply and demand of each node in thet network.
- getNodeSupply() - Method in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Returns a function which defines the supply and demand of each node in thet network.
- getNumberClusters() - Method in interface org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering
-
Get the number of clusters.
- getNumberClusters() - Method in class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
- getNumberColors() - Method in interface org.jgrapht.alg.interfaces.VertexColoringAlgorithm.Coloring
-
Get the number of colors.
- getNumberColors() - Method in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
-
Get the number of colors.
- getNumberOfExpandedNodes() - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Returns how many nodes have been expanded in the A* search procedure in its last invocation.
- getNumberOfTriangles(Graph<V, E>) - Static method in class org.jgrapht.GraphMetrics
-
An $O(|E|^{3/2})$ algorithm for counting the number of non-trivial triangles in an undirected graph.
- getNumberPartitions() - Method in interface org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning
-
Get the number of partitions.
- getNumberPartitions() - Method in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
-
Get the number of partitions.
- getNumDimensions() - Method in class org.jgrapht.alg.drawing.model.Point2D
-
Get the number of dimensions of the point
- getOddSetCover() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
-
Get an odd set cover which proves the optimality of the computed matching.
- getOppositeVertex(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Compute the opposite end-point of an end-point of an edge.
- getOppositeVertex(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
-
Gets the vertex opposite another vertex across an edge.
- getParent(V) - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Returns the parent of vertex $v$ in the internal DFS tree/forest.
- getParent(V) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
Returns the parent node of vertex $v$ in the BFS search tree, or null if $v$ is the root node.
- getParentArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal parent array.
- getParentMap() - Method in class org.jgrapht.alg.util.UnionFind
- getPartition() - Method in interface org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree
-
Return the label-to-partition map of the underlying partition of capacitated spanning tree.
- getPartition() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- getPartition(int) - Method in interface org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning
-
Get the index-th partition (0-based).
- getPartition(int) - Method in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
-
Get the index-th partition (0-based).
- getPartition1DominatedSet() - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
-
Gets the subset dominated by partition1.
- getPartition2DominatedSet() - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
-
Gets the subset dominated by partition2.
- getPartitioning() - Method in interface org.jgrapht.alg.interfaces.PartitioningAlgorithm
-
Computes a vertex partitioning.
- getPartitioning() - Method in class org.jgrapht.alg.partition.BipartitePartitioning
-
Computes a vertex partitioning.
- getPartitions() - Method in interface org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning
-
Get the partitions.
- getPartitionSet(Integer) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the set of vertices that are in the subset with label
label
. - getPartitionWeight(Integer) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the sum of the weights of all vertices that are in the subset with label
label
. - getPath(Integer, Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
- getPath(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Return the path from the source vertex to the sink vertex.
- getPath(V) - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Return the path from the source vertex to the sink vertex.
- getPath(V) - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Return the path from the source vertex to the sink vertex.
- getPath(V, V) - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
-
Return the path from the
source
vertex to thetarget
vertex. - getPath(V, V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Get a shortest path from a source vertex to a sink vertex.
- getPathArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal path array.
- getPathDecomposition() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Computes a path decomposition.
- getPathDecomposition() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm
-
Computes a path decomposition.
- getPaths() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition
-
Set of disjoint paths of the decomposition
- getPaths() - Method in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- getPaths(Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
-
Return the path from the source vertex to the sink vertex.
- getPaths(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
- getPaths(V, V) - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm
-
Get a shortest path from a source vertex to a sink vertex.
- getPaths(V, V) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
- getPaths(V, V, int) - Method in interface org.jgrapht.alg.interfaces.KShortestPathAlgorithm
-
Get a list of k-shortest paths from a source vertex to a sink vertex.
- getPaths(V, V, int) - Method in class org.jgrapht.alg.shortestpath.EppsteinKShortestPath
-
Computes
k
shortest paths betweensource
andsink
. - getPaths(V, V, int) - Method in class org.jgrapht.alg.shortestpath.KShortestSimplePaths
-
Returns a list of the $k$ shortest simple paths in increasing order of weight.
- getPaths(V, V, int) - Method in class org.jgrapht.alg.shortestpath.YenKShortestPath
-
Computes
k
shortest loopless paths betweensource
andsink
. - getPathWeight(V, V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPerfectEliminationOrder() - Method in class org.jgrapht.alg.color.ChordalGraphColoring
-
Returns the perfect elimination order used to create the coloring (if one exists).
- getPerfectEliminationOrder() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Returns a perfect elimination order if one exists.
- getPerfectMatchedSets() - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
-
Gets the remaining subset, or subsets in the fine decomposition.
- getPositionInPathArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal positionInPath array.
- getPotentials() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Get the vertex potentials.
- getRadius() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the radius of the graph.
- getRadius(Graph<V, E>) - Static method in class org.jgrapht.GraphMetrics
-
Compute the radius of the graph.
- getRankMap() - Method in class org.jgrapht.alg.util.UnionFind
- getRatio() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Returns the ratio between the vertex' weight and its degree
- getSavedComparisons() - Method in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Get the total number of saved comparisons due to the Barnes-Hut technique.
- getScores() - Method in interface org.jgrapht.alg.interfaces.VertexScoringAlgorithm
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.AlphaCentrality
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.BetweennessCentrality
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Get a map with the local clustering coefficients of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.Coreness
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.PageRank
-
Get a map with the scores of all vertices
- getSecond() - Method in class org.jgrapht.alg.util.Pair
-
Get the second element of the pair
- getSecond() - Method in class org.jgrapht.alg.util.Triple
-
Get the second element
- getSecondPartition() - Method in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Returns the second partitions of vertices in the bipartite graph.
- getSecondPartition() - Method in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Returns the second partitions of vertices in the bipartite graph.
- getSeenData(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Access the data stored for a seen vertex.
- getSeparators() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the clique minimal separators.
- getShortestPathAlgorithm() - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Get the shortest path algorithm for the paths computation.
- getShortestPathLength(V) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
Get the weighted length of the shortest path known to the given vertex.
- getShortestPathsCount() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get the total number of shortest paths.
- getShrinkNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getShrinkTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getSingletonTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Creates a tour for a graph with 1 vertex
- getSinkPartition() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- getSinkPartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- getSinkPartition() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Returns partition $V-W$ of the cut obtained after the last invocation of
PadbergRaoOddMinimumCutset.calculateMinCut(Set, boolean)
- getSinkPartition() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
-
Returns the sink partition $T$, $t \in T$, of the cut obtained after the last invocation of
MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
- getSize() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Get the size of the region.
- getSizeSubtree(V) - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Returns the size of vertex $v$'s subtree in the internal DFS tree/forest.
- getSizeSubtreeArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal sizeSubtree array.
- getSolution() - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Calculates a partition representation of the capacitated spanning tree.
- getSource() - Method in class org.jgrapht.graph.DefaultEdge
-
Retrieves the source of this edge.
- getSource() - Method in class org.jgrapht.graph.DefaultWeightedEdge
-
Retrieves the source of this edge.
- getSourcePartition() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- getSourcePartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- getSourcePartition() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Returns partition $W$ of the cut obtained after the last invocation of
PadbergRaoOddMinimumCutset.calculateMinCut(Set, boolean)
- getSourcePartition() - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
-
Returns the source partition $S$, $s \in S$, of the cut obtained after the last invocation of
MinimumSTCutAlgorithm.calculateMinCut(Object, Object)
- getSources() - Method in class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
- getSources() - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
-
Returns the set of source vertices for which this many-to-many shortest paths were computed.
- getSourceVertex() - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
-
Returns the single source vertex.
- getSourceVertex() - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Returns the single source vertex.
- getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
- getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Returns the single source vertex.
- getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Returns the single source vertex.
- getSpanner() - Method in interface org.jgrapht.alg.interfaces.SpannerAlgorithm
-
Computes a graph spanner.
- getSpanner() - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
- getSpanningTree() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm
-
Computes a spanning tree.
- getSpanningTree() - Method in class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree
-
Computes a spanning tree.
- getSpanningTree() - Method in class org.jgrapht.alg.spanning.KruskalMinimumSpanningTree
-
Computes a spanning tree.
- getSpanningTree() - Method in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree
-
Computes a spanning tree.
- getSpanningTreeEdge(V) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
Returns the edge connecting vertex $v$ to its parent in the spanning tree formed by the BFS search, or null if $v$ is a root node.
- 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.
- getSpecificsFactory() - Method in class org.jgrapht.graph.DefaultGraphSpecificsStrategy
- getSpecificsFactory() - Method in class org.jgrapht.graph.FastLookupGraphSpecificsStrategy
- getSpecificsFactory() - Method in interface org.jgrapht.graph.GraphSpecificsStrategy
-
Get a function which creates the specifics.
- getStack() - Method in class org.jgrapht.traverse.DepthFirstIterator
-
Retrieves the LIFO stack of vertices which have been encountered but not yet visited (WHITE).
- getStart() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Get the start of the region.
- getStartVertex() - Method in class org.jgrapht.graph.GraphWalk
- getStartVertex() - Method in interface org.jgrapht.GraphPath
-
Returns the start vertex in the path.
- getStatistics() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Returns the statistics describing the performance characteristics of the algorithm.
- getStronglyConnectedComponents() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Computes a list of subgraphs of the given graph.
- getTarget() - Method in class org.jgrapht.graph.DefaultEdge
-
Retrieves the target of this edge.
- getTarget() - Method in class org.jgrapht.graph.DefaultWeightedEdge
-
Retrieves the target of this edge.
- getTargets() - Method in class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
- getTargets() - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
-
Returns the set of target vertices for which this many-to-many shortest paths were computed.
- getThird() - Method in class org.jgrapht.alg.util.Triple
-
Get the third element
- getTopologicalIndex(V) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Get the topological index of the given vertex.
- getTopologicalIndex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- getTopologicalIndex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- getTour(Graph<V, E>) - Method in interface org.jgrapht.alg.interfaces.HamiltonianCycleAlgorithm
-
Computes a tour.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.ChristofidesThreeHalvesApproxMetricTSP
-
Computes a $3/2$-approximate tour.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.GreedyHeuristicTSP
-
Computes a tour using the greedy heuristic.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HeldKarpTSP
-
Computes a minimum-cost Hamiltonian tour.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Computes a tour using the nearest insertion heuristic.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Computes a tour using the nearest neighbour heuristic.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.PalmerHamiltonianCycle
-
Computes a Hamiltonian tour.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.RandomTourTSP
-
Computes a tour using the greedy heuristic.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.TwoApproxMetricTSP
-
Computes a 2-approximate tour.
- getTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Computes a 2-approximate tour.
- getType() - Method in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Returns the event type.
- getType() - Method in class org.jgrapht.event.GraphChangeEvent
-
Returns the event type.
- getType() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.AsGraphUnion
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.AsSubgraph
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.AsUnmodifiableGraph
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.AsUnweightedGraph
- getType() - Method in class org.jgrapht.graph.AsWeightedGraph
- getType() - Method in interface org.jgrapht.Graph
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.GraphDelegator
-
Get the graph type.
- getType() - Method in class org.jgrapht.graph.MaskSubgraph
-
Get the graph type.
- getUnmodifiableIncomingEdges() - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
A lazy build of unmodifiable incoming edge set.
- getUnmodifiableOutgoingEdges() - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
A lazy build of unmodifiable outgoing edge set.
- getUnmodifiableVertexEdges() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
A lazy build of unmodifiable list of vertex edges
- getValue() - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlow
-
Returns value of the maximum-flow for the given network
- getValue() - Method in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
- getValue() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNode
-
Returns the immutable value this
ListNode
contains. - getValue() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns the value of this object, similarly to
ModifiableInteger.intValue()
. - getVertex() - Method in class org.jgrapht.event.GraphVertexChangeEvent
-
Returns the vertex that this event is related to.
- getVertex() - Method in class org.jgrapht.event.VertexTraversalEvent
-
Returns the traversed vertex.
- getVertex(Integer) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Get the vertex at the given topological index.
- getVertex(Integer) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- getVertex(Integer) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
- getVertexCorrespondence(V, boolean) - Method in interface org.jgrapht.GraphMapping
-
Gets the mapped value where the key is
vertex
- getVertexCover() - Method in interface org.jgrapht.alg.interfaces.VertexCoverAlgorithm
-
Computes a vertex cover.
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl
-
Finds a 2-approximation for a minimal vertex cover of the specified graph.
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.GreedyVCImpl
-
Finds a greedy solution to the minimum weighted vertex cover problem.
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
- getVertexEccentricityMap() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the eccentricity of each vertex in the graph.
- getVertexList() - Method in class org.jgrapht.graph.GraphWalk
- getVertexList() - Method in interface org.jgrapht.GraphPath
-
Returns the path as a sequence of vertices.
- getVertexMap() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the vertex map, a mapping from vertices to unique integers.
- getVertexMap() - Method in class org.jgrapht.util.VertexToIntegerMapping
-
Get the
vertexMap
, a mapping from vertices to integers (i.e. - getVertexOrdering() - Method in class org.jgrapht.alg.color.GreedyColoring
-
Get the ordering of the vertices used by the algorithm.
- getVertexOrdering() - Method in class org.jgrapht.alg.color.LargestDegreeFirstColoring
-
Get the ordering of the vertices used by the algorithm.
- getVertexOrdering() - Method in class org.jgrapht.alg.color.RandomGreedyColoring
-
Get the ordering of the vertices used by the algorithm.
- getVertexOrdering() - Method in class org.jgrapht.alg.color.SmallestDegreeLastColoring
-
Get the ordering of the vertices used by the algorithm.
- getVertexScore(V) - Method in interface org.jgrapht.alg.interfaces.VertexScoringAlgorithm
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.AlphaCentrality
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.BetweennessCentrality
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Get a vertex's local clustering coefficient
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.Coreness
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.PageRank
-
Get a vertex score
- getVertexSet() - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Get the vertex set.
- getVertexSet() - Method in interface org.jgrapht.graph.specifics.Specifics
-
Get the vertex set.
- getVertexSet() - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Get the vertex set.
- getVertexSupplier() - Method in class org.jgrapht.graph.AbstractBaseGraph
- getVertexSupplier() - Method in class org.jgrapht.graph.AsGraphUnion
-
Return the vertex supplier that the graph uses whenever it needs to create new vertices.
- getVertexSupplier() - Method in class org.jgrapht.graph.AsSubgraph
-
Return the vertex supplier that the graph uses whenever it needs to create new vertices.
- getVertexSupplier() - Method in interface org.jgrapht.Graph
-
Return the vertex supplier that the graph uses whenever it needs to create new vertices.
- getVertexSupplier() - Method in class org.jgrapht.graph.GraphDelegator
-
Return the vertex supplier that the graph uses whenever it needs to create new vertices.
- getVertexSupplier() - Method in class org.jgrapht.graph.MaskSubgraph
-
Return the vertex supplier that the graph uses whenever it needs to create new vertices.
- getVertexToIntegerMapping(Graph<V, E>) - Static method in class org.jgrapht.Graphs
-
Compute a new mapping from the vertices of a graph to the integer range $[0, n)$ where $n$ is the number of vertices in the graph.
- getVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- getVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- getVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- getVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- getVisited(int) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy
-
Get if the given topological index has been visited.
- getVisitedStrategy(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- getVisitedStrategy(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- getVisitedStrategy(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- getVisitedStrategy(DirectedAcyclicGraph.Region) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- getVisitedStrategy(DirectedAcyclicGraph.Region) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategyFactory
-
Create a new instance of
DirectedAcyclicGraph.VisitedStrategy
. - getWeight() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- getWeight() - Method in interface org.jgrapht.alg.interfaces.CliqueAlgorithm.Clique
-
Returns the weight of the clique.
- getWeight() - Method in interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis
-
Get the weight of the cycle basis.
- getWeight() - Method in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Get the weight of the cycle basis.
- getWeight() - Method in interface org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSet
-
Returns the weight of the independent set.
- getWeight() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Returns the weight of the matching.
- getWeight() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
-
Returns the weight of the matching.
- getWeight() - Method in interface org.jgrapht.alg.interfaces.SpannerAlgorithm.Spanner
-
Returns the weight of the graph spanner.
- getWeight() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree
-
Returns the weight of the spanning tree.
- getWeight() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- getWeight() - Method in interface org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCover
-
Returns the weight of the vertex cover.
- getWeight() - Method in class org.jgrapht.graph.DefaultWeightedEdge
-
Retrieves the weight of this edge.
- getWeight() - Method in class org.jgrapht.graph.GraphWalk
- getWeight() - Method in interface org.jgrapht.GraphPath
-
Returns the weight assigned to the path.
- getWeight() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
-
Returns the weight of the set.
- getWeight(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Return the weight of the path from the source vertex to the sink vertex.
- getWeight(V) - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Return the weight of the path from the source vertex to the sink vertex.
- getWeight(V) - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Return the weight of the path from the source vertex to the sink vertex.
- getWeight(V, V) - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
-
Return the weight of the path from the
source
vertex to thetarget
vertex orDouble.POSITIVE_INFINITY
if there is no such path in the graph. - getWidth() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the width
- getX() - Method in class org.jgrapht.alg.drawing.model.Point2D
-
Get the x coordinate
- getY() - Method in class org.jgrapht.alg.drawing.model.Point2D
-
Get the y coordinate
- GnmRandomBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Create a random bipartite graph based on the $G(n, M)$ Erdős–Rényi model.
- GnmRandomBipartiteGraphGenerator(int, int, int) - Constructor for class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Create a new random bipartite graph generator.
- GnmRandomBipartiteGraphGenerator(int, int, int, long) - Constructor for class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Create a new random bipartite graph generator.
- GnmRandomBipartiteGraphGenerator(int, int, int, Random) - Constructor for class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Create a new random bipartite graph generator.
- GnmRandomGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Create a random graph based on the $G(n, M)$ Erdős–Rényi model.
- GnmRandomGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator
-
Create a new $G(n, M)$ random graph generator.
- GnmRandomGraphGenerator(int, int, long) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator
-
Create a new $G(n, M)$ random graph generator.
- GnmRandomGraphGenerator(int, int, long, boolean, boolean) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator
-
Create a new $G(n, M)$ random graph generator
- GnmRandomGraphGenerator(int, int, Random, boolean, boolean) - Constructor for class org.jgrapht.generate.GnmRandomGraphGenerator
-
Create a new $G(n, M)$ random graph generator
- GnpRandomBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Create a random bipartite graph based on the $G(n, p)$ Erdős–Rényi model.
- GnpRandomBipartiteGraphGenerator(int, int, double) - Constructor for class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Create a new random bipartite graph generator.
- GnpRandomBipartiteGraphGenerator(int, int, double, long) - Constructor for class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Create a new random bipartite graph generator.
- GnpRandomBipartiteGraphGenerator(int, int, double, Random) - Constructor for class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Create a new random bipartite graph generator.
- GnpRandomGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Create a random graph based on the $G(n, p)$ Erdős–Rényi model.
- GnpRandomGraphGenerator(int, double) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator
-
Create a new $G(n, p)$ random graph generator.
- GnpRandomGraphGenerator(int, double, long) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator
-
Create a new $G(n, p)$ random graph generator.
- GnpRandomGraphGenerator(int, double, long, boolean) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator
-
Create a new $G(n, p)$ random graph generator.
- GnpRandomGraphGenerator(int, double, Random, boolean) - Constructor for class org.jgrapht.generate.GnpRandomGraphGenerator
-
Create a new $G(n, p)$ random graph generator.
- GoldbergMaximumDensitySubgraphAlgorithm<V,E> - Class in org.jgrapht.alg.densesubgraph
-
This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
- GoldbergMaximumDensitySubgraphAlgorithm(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
-
Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithm
- GoldbergMaximumDensitySubgraphAlgorithm(Graph<V, E>, V, V, double, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>>) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
-
Constructor
- GoldbergMaximumDensitySubgraphAlgorithmBase<V,E> - Class in org.jgrapht.alg.densesubgraph
-
This abstract base class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
- GoldbergMaximumDensitySubgraphAlgorithmBase(Graph<V, E>, V, V, boolean, double, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>>) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Constructor
- GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight<V extends Pair<?,java.lang.Double>,E> - Class in org.jgrapht.alg.densesubgraph
-
This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
- GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
-
Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithm
- GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight(Graph<V, E>, V, V, double, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>>) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
-
Constructor
- GoldbergMaximumDensitySubgraphAlgorithmNodeWeights<V extends Pair<?,java.lang.Double>,E> - Class in org.jgrapht.alg.densesubgraph
-
This class computes a maximum density subgraph based on the algorithm described by Andrew Vladislav Goldberg in Finding Maximum Density Subgraphs, 1984, University of Berkley.
- GoldbergMaximumDensitySubgraphAlgorithmNodeWeights(Graph<V, E>, V, V, double) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
-
Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithm
- GoldbergMaximumDensitySubgraphAlgorithmNodeWeights(Graph<V, E>, V, V, double, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>>) - Constructor for class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
-
Constructor
- goldnerHararyGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- gossetGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- graph - Variable in class org.jgrapht.alg.color.GreedyColoring
-
The input graph
- graph - Variable in class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
- graph - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- graph - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Underlying graph
- graph - Variable in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
-
The graph
- graph - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
The graph
- graph - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the input graph.
- graph - Variable in class org.jgrapht.graph.builder.AbstractGraphBuilder
- graph - Variable in class org.jgrapht.graph.GraphWalk
- graph - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
- graph - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
- graph - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- Graph<V,E> - Interface in org.jgrapht
-
The root interface in the graph hierarchy.
- graph1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- graph2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- GraphBuilder<V,E,G extends Graph<V,E>> - Class in org.jgrapht.graph.builder
-
A builder class for
Graph
. - GraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.GraphBuilder
-
Creates a builder based on
baseGraph
. - 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
- GraphDelegator(Graph<V, E>, Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.GraphDelegator
- GraphEdgeChangeEvent<V,E> - Class in org.jgrapht.event
-
An event which indicates that a graph edge has changed, or is about to change.
- GraphEdgeChangeEvent(Object, int, E, V, V) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent
-
Constructor for GraphEdgeChangeEvent.
- GraphEdgeChangeEvent(Object, int, E, V, V, double) - Constructor for class org.jgrapht.event.GraphEdgeChangeEvent
-
Constructor for GraphEdgeChangeEvent.
- GraphGenerator<V,E,T> - Interface in org.jgrapht.generate
-
An interface for generating new graph structures.
- GraphIterator<V,E> - Interface in org.jgrapht.traverse
-
A graph iterator.
- GraphListener<V,E> - Interface in org.jgrapht.event
-
A listener that is notified when the graph changes.
- 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.
- GraphMeasurer<V,E> - Class in org.jgrapht.alg.shortestpath
-
Algorithm class which computes a number of distance related metrics.
- GraphMeasurer(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Constructs a new instance of GraphMeasurer.
- GraphMeasurer(Graph<V, E>, ShortestPathAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Constructs a new instance of GraphMeasurer.
- GraphMetrics - Class in org.jgrapht
-
Collection of methods which provide numerical graph information.
- GraphMetrics() - Constructor for class org.jgrapht.GraphMetrics
- GraphPath<V,E> - Interface in org.jgrapht
- Graphs - Class in org.jgrapht
-
A collection of utilities to assist with graph manipulation.
- Graphs() - Constructor for class org.jgrapht.Graphs
- GraphSpecificsStrategy<V,E> - Interface in org.jgrapht.graph
-
A graph specifics construction factory.
- GraphTests - Class in org.jgrapht
-
A collection of utilities to test for various graph properties.
- GraphTests() - Constructor for class org.jgrapht.GraphTests
- GraphType - Interface in org.jgrapht
-
A graph type.
- GraphTypeBuilder<V,E> - Class in org.jgrapht.graph.builder
-
A builder class for the hierarchy of
Graph
s that the library provides. - GraphVertexChangeEvent<V> - Class in org.jgrapht.event
-
An event which indicates that a graph vertex has changed, or is about to change.
- GraphVertexChangeEvent(Object, int, V) - Constructor for class org.jgrapht.event.GraphVertexChangeEvent
-
Creates a new GraphVertexChangeEvent object.
- GraphWalk<V,E> - Class in org.jgrapht.graph
-
A walk in a graph is an alternating sequence of vertices and edges, starting and ending at a vertex, in which each edge is adjacent in the sequence to its two endpoints.
- GraphWalk(Graph<V, E>, List<V>, double) - Constructor for class org.jgrapht.graph.GraphWalk
-
Creates a walk defined by a sequence of vertices.
- GraphWalk(Graph<V, E>, V, V, List<E>, double) - Constructor for class org.jgrapht.graph.GraphWalk
-
Creates a walk defined by a sequence of edges.
- GraphWalk(Graph<V, E>, V, V, List<V>, List<E>, double) - Constructor for class org.jgrapht.graph.GraphWalk
-
Creates a walk defined by both a sequence of edges and a sequence of vertices.
- GRAY - org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has been returned via iterator, but we're not done with all of its out-edges yet.
- GREEDY - org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- GreedyColoring<V,E> - Class in org.jgrapht.alg.color
-
The greedy coloring algorithm.
- GreedyColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.GreedyColoring
-
Construct a new coloring algorithm.
- GreedyHeuristicTSP<V,E> - Class in org.jgrapht.alg.tour
-
The greedy heuristic algorithm for the TSP problem.
- GreedyHeuristicTSP() - Constructor for class org.jgrapht.alg.tour.GreedyHeuristicTSP
- GreedyMaximumCardinalityMatching<V,E> - Class in org.jgrapht.alg.matching
-
The greedy algorithm for computing a maximum cardinality matching.
- GreedyMaximumCardinalityMatching(Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching
-
Creates a new GreedyMaximumCardinalityMatching instance.
- GreedyMultiplicativeSpanner<V,E> - Class in org.jgrapht.alg.spanning
-
Greedy algorithm for $(2k-1)$-multiplicative spanner construction (for any integer k >= 1).
- GreedyMultiplicativeSpanner(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
-
Constructs instance to compute a $(2k-1)$-spanner of an undirected graph.
- GreedyVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover
-
Greedy algorithm to find a vertex cover for a graph.
- GreedyVCImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.vertexcover.GreedyVCImpl
-
Constructs a new GreedyVCImpl instance where all vertices have uniform weights.
- GreedyVCImpl(Graph<V, E>, Map<V, Double>) - Constructor for class org.jgrapht.alg.vertexcover.GreedyVCImpl
-
Constructs a new GreedyVCImpl instance
- GreedyWeightedMatching<V,E> - Class in org.jgrapht.alg.matching
-
The greedy algorithm for computing a maximum weight matching in an arbitrary graph.
- GreedyWeightedMatching(Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.matching.GreedyWeightedMatching
-
Create and execute a new instance of the greedy maximum weight matching algorithm.
- GreedyWeightedMatching(Graph<V, E>, boolean, double) - Constructor for class org.jgrapht.alg.matching.GreedyWeightedMatching
-
Create and execute a new instance of the greedy maximum weight matching algorithm.
- GridGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a bidirectional grid graph of any size.
- GridGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GridGraphGenerator
-
Creates a new GridGraphGenerator object with rows x cols dimension.
- grötzschGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- gScoreMap - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- guess - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- GusfieldEquivalentFlowTree<V,E> - Class in org.jgrapht.alg.flow
-
This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.
- GusfieldEquivalentFlowTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Constructs a new GusfieldEquivalentFlowTree instance.
- GusfieldEquivalentFlowTree(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Constructs a new GusfieldEquivalentFlowTree instance.
- GusfieldEquivalentFlowTree(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Constructs a new GusfieldEquivalentFlowTree instance.
- GusfieldGomoryHuCutTree<V,E> - Class in org.jgrapht.alg.flow
-
This class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield.
- GusfieldGomoryHuCutTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Constructs a new GusfieldEquivalentFlowTree instance.
- GusfieldGomoryHuCutTree(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Constructs a new GusfieldEquivalentFlowTree instance.
- GusfieldGomoryHuCutTree(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Constructs a new GusfieldEquivalentFlowTree instance.
H
- HamiltonianCycleAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm solving the Hamiltonian cycle problem.
- HamiltonianCycleAlgorithmBase<V,E> - Class in org.jgrapht.alg.tour
-
Base class for TSP solver algorithms.
- HamiltonianCycleAlgorithmBase() - Constructor for class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
- HamiltonianCycleImprovementAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm improving the result of solving the Hamiltonian cycle problem.
- HarmonicCentrality<V,E> - Class in org.jgrapht.alg.scoring
-
Harmonic centrality.
- HarmonicCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.HarmonicCentrality
-
Construct a new instance.
- HarmonicCentrality(Graph<V, E>, boolean, boolean) - Constructor for class org.jgrapht.alg.scoring.HarmonicCentrality
-
Construct a new instance.
- hasEdgeCorrespondence(E) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Checks if a edge e from the first graph has a corresponding edge in the second graph
- hasElement(E) - Method in class org.jgrapht.alg.util.Pair
-
Assess if this pair contains an element.
- hasElement(E) - Method in class org.jgrapht.alg.util.Triple
-
Assess if this triple contains an element.
- hashCode() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- hashCode() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- hashCode() - Method in class org.jgrapht.alg.drawing.model.Box2D
- hashCode() - Method in class org.jgrapht.alg.drawing.model.Point2D
- hashCode() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- hashCode() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
- hashCode() - Method in class org.jgrapht.alg.util.Pair
- hashCode() - Method in class org.jgrapht.alg.util.Triple
- hashCode() - Method in class org.jgrapht.alg.util.UnorderedPair
- hashCode() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
- hashCode() - Method in class org.jgrapht.graph.AbstractGraph
-
Returns a hash code value for this graph.
- hashCode() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a hash code value for this graph.
- hashCode() - Method in class org.jgrapht.graph.GraphWalk
- hashCode() - Method in class org.jgrapht.util.ArrayUnenforcedSet
- hashCode() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns a hash code for this
ModifiableInteger
. - hashCode() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- hasMoreElements() - Method in class org.jgrapht.util.PrefetchIterator
- hasMultipleEdges(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Check if a graph has multiple edges (parallel edges), that is, whether the graph contains two or more edges connecting the same pair of vertices.
- hasNext() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
- hasNext() - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
- hasNext() - Method in class org.jgrapht.traverse.CrossComponentIterator
- hasNext() - Method in class org.jgrapht.traverse.DegeneracyOrderingIterator
- hasNext() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Checks whether there exist unvisited vertices.
- hasNext() - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Checks whether there exists unvisited vertex.
- hasNext() - Method in class org.jgrapht.traverse.RandomWalkIterator
- hasNext() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
- hasNext() - Method in class org.jgrapht.util.PrefetchIterator
- hasOreProperty(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Tests whether an undirected graph meets Ore's condition to be Hamiltonian.
- hasSelfLoops(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Check if a graph has self-loops.
- hasVertexCorrespondence(V) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Checks if a vertex $v$ from the first graph has a corresponding vertex in the second graph
- HawickJamesSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
-
Find all simple cycles of a directed graph using the algorithm described by Hawick and James.
- HawickJamesSimpleCycles() - Constructor for class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Create a simple cycle finder with an unspecified graph.
- HawickJamesSimpleCycles(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Create a simple cycle finder for the specified graph.
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- HeavyPathDecomposition<V,E> - Class in org.jgrapht.alg.decomposition
-
Algorithm for computing the heavy path decomposition of a rooted tree/forest.
- HeavyPathDecomposition(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Create an instance with a reference to the forest that we will decompose and to the sets of roots of the forest (one root per tree).
- HeavyPathDecomposition(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Create an instance with a reference to the tree that we will decompose and to the root of the tree.
- HeavyPathDecomposition.InternalState - Class in org.jgrapht.alg.decomposition
-
Internal representation of the data
- HeavyPathLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Algorithm for computing lowest common ancestors in rooted trees and forests based on
HeavyPathDecomposition
. - HeavyPathLCAFinder(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Construct a new instance of the algorithm.
- HeavyPathLCAFinder(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Construct a new instance of the algorithm.
- heawoodGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- HeldKarpTSP<V,E> - Class in org.jgrapht.alg.tour
-
A dynamic programming algorithm for the TSP problem.
- HeldKarpTSP() - Constructor for class org.jgrapht.alg.tour.HeldKarpTSP
-
Construct a new instance
- herschelGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- HierholzerEulerianCycle<V,E> - Class in org.jgrapht.alg.cycle
-
An implementation of Hierholzer's algorithm for finding an Eulerian cycle in Eulerian graphs.
- HierholzerEulerianCycle() - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- HierholzerEulerianCycle.EdgeNode - Class in org.jgrapht.alg.cycle
- HierholzerEulerianCycle.VertexNode - Class in org.jgrapht.alg.cycle
- hoffmanGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- HopcroftKarpMaximumCardinalityBipartiteMatching<V,E> - Class in org.jgrapht.alg.matching
-
Implementation of the well-known Hopcroft Karp algorithm to compute a matching of maximum cardinality in a bipartite graph.
- HopcroftKarpMaximumCardinalityBipartiteMatching(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
-
Constructs a new instance of the Hopcroft Karp bipartite matching algorithm.
- HUB_VERTEX - Static variable in class org.jgrapht.generate.WheelGraphGenerator
-
Role for the hub vertex.
- HyperCubeGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a hyper cube graph of any size.
- HyperCubeGraphGenerator(int) - Constructor for class org.jgrapht.generate.HyperCubeGraphGenerator
-
Creates a new generator
I
- ID - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
unique id, used to guarantee that compareTo never returns 0
- identity(Graph<V, E>) - Static method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Computes an identity automorphism (i.e.
- improveTour(GraphPath<V, E>) - Method in interface org.jgrapht.alg.interfaces.HamiltonianCycleImprovementAlgorithm
-
Improves a tour.
- improveTour(GraphPath<V, E>) - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Try to improve a tour by running the 2-opt heuristic.
- incoming - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Whether to use incoming or outgoing paths
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns a set of all edges incoming into the specified vertex.
- increment() - Method in class org.jgrapht.util.ModifiableInteger
-
Adds one to the value of this modifiable integer.
- inDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- inDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in interface org.jgrapht.Graph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns the "in degree" of the specified vertex.
- IndependentSetAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Algorithm to compute an Independent Set in a graph.
- IndependentSetAlgorithm.IndependentSet<V> - Interface in org.jgrapht.alg.interfaces
-
A (weighted) Independent Set
- IndependentSetAlgorithm.IndependentSetImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of a (weighted) independent set
- IndependentSetImpl(Set<V>) - Constructor for class org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSetImpl
- IndependentSetImpl(Set<V>, double) - Constructor for class org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSetImpl
- IndexedFRLayoutAlgorithm2D<V,E> - Class in org.jgrapht.alg.drawing
-
Fruchterman and Reingold Force-Directed Placement Algorithm using the Barnes-Hut indexing technique with a QuadTree.
- IndexedFRLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Create a new layout algorithm
- IndexedFRLayoutAlgorithm2D(int, double) - Constructor for class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Create a new layout algorithm
- IndexedFRLayoutAlgorithm2D(int, double, double) - Constructor for class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Create a new layout algorithm
- IndexedFRLayoutAlgorithm2D(int, double, double, Random) - Constructor for class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Create a new layout algorithm
- IndexedFRLayoutAlgorithm2D(int, double, double, Random, double) - Constructor for class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Create a new layout algorithm
- indexOfNode(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the index of the specified
node
in this list, or -1 if this list does not contain thenode
. - INFINITY - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default infinity value used in the algorithm
- init(V, V, ExtensionFactory<VE>, ExtensionFactory<MaximumFlowAlgorithmBase.AnnotatedFlowEdge>) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Prepares all data structures to start a new invocation of the Maximum Flow or Minimum Cut algorithms
- initialize(PushRelabelMFImpl.VertexExtension, PushRelabelMFImpl.VertexExtension, Queue<PushRelabelMFImpl.VertexExtension>) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Initialization
- initialize(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Index the graph and create a double-linked list representation suitable for vertex and edge removals in constant time.
- inSameSet(T, T) - Method in class org.jgrapht.alg.util.UnionFind
-
Tests whether two elements are contained in the same set.
- insertLocation - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- INSTANCE - Static variable in class org.jgrapht.alg.TransitiveClosure
-
Singleton instance.
- INSTANCE - Static variable in class org.jgrapht.alg.TransitiveReduction
-
Singleton instance.
- InternalState() - Constructor for class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
- IntrusiveEdgesSpecifics<V,E> - Interface in org.jgrapht.graph
-
An interface for the set of intrusive edges of a graph.
- intValue() - Method in class org.jgrapht.util.ModifiableInteger
- IntVertexDijkstraShortestPath<E> - Class in org.jgrapht.alg.shortestpath
-
Dijkstra Shortest Path implementation specialized for graphs with integer vertices.
- IntVertexDijkstraShortestPath(Graph<Integer, E>) - Constructor for class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- IntVertexDijkstraShortestPath(Graph<Integer, E>, Supplier<AddressableHeap<Double, Integer>>) - Constructor for class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- InverseLinearTemperatureModel(double, double) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D.InverseLinearTemperatureModel
-
Create a new inverse linear temperature model.
- invert() - Method in class org.jgrapht.util.DoublyLinkedList
-
Inverts the list.
- isAllowingCycles() - Method in class org.jgrapht.graph.DefaultGraphType
- isAllowingCycles() - Method in interface org.jgrapht.GraphType
-
Returns
true
if and only if cycles are allowed in this graph. - isAllowingMultipleEdges() - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Returns whether the generated graph may contain multiple (parallel) edges between the same two vertices.
- isAllowingMultipleEdges() - Method in class org.jgrapht.graph.DefaultGraphType
- isAllowingMultipleEdges() - Method in interface org.jgrapht.GraphType
-
Returns
true
if and only if multiple (parallel) edges are allowed in this graph. - isAllowingSelfLoops() - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Returns whether the generated graph may contain multiple (parallel) edges between the same two vertices
- isAllowingSelfLoops() - Method in class org.jgrapht.graph.DefaultGraphType
- isAllowingSelfLoops() - Method in interface org.jgrapht.GraphType
-
Returns
true
if and only if self-loops are allowed in this graph. - isBerge(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Performs the Berge Recognition Algorithm.
- isBerge(Graph<V, E>, boolean) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Performs the Berge Recognition Algorithm.
- isBiconnected() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Tests if the inspected graph is biconnected.
- isBiconnected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Tests if the inspected graph is biconnected.
- isBipartite() - Method in class org.jgrapht.alg.partition.BipartitePartitioning
-
Test whether the input graph is bipartite.
- isBipartite(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is bipartite.
- isBipartitePartition(Graph<V, E>, Set<? extends V>, Set<? extends V>) - Static method in class org.jgrapht.GraphTests
-
Test whether a partition of the vertices into two sets is a bipartite partition.
- isCacheEnable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Return whether a cache will be used for the synchronized graph being built.
- isCacheEnabled() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Return whether the graph uses cache for
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - isCapacitatedSpanningTree(Graph<V, E>, V, double, Map<V, Double>) - Method in interface org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree
-
Tests whether
cmst
is a CMST ongraph
with rootroot
, capacitycapacity
and demand functiondemands
. - isCapacitatedSpanningTree(Graph<V, E>, V, double, Map<V, Double>) - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- isChordal() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Check if the graph is chordal.
- isChordal() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Checks whether the inspected graph is chordal.
- isChordal(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks whether a graph is chordal.
- isComplete(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is complete.
- isConnected() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Test if the inspected graph is connected.
- isConnected() - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
-
Test if the inspected graph is connected.
- isConnected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test if the inspected graph is connected.
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.BreadthFirstIterator
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.ClosestFirstIterator
- isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Returns
true
if there are no more uniterated vertices in the currently iterated connected component;false
otherwise. - isConnectedComponentExhausted() - Method in class org.jgrapht.traverse.DepthFirstIterator
- isConsistent(Graph<V, E>) - Method in interface org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic
-
Returns true if the heuristic is a consistent or monotone heuristic wrt the provided
graph
. - isConsistent(Graph<V, ET>) - Method in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
-
Returns true if the heuristic is a consistent or monotone heuristic wrt the provided
graph
. - isCopyless() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Return whether copyless mode will be used for the synchronized graph being built.
- isCopyless() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Return whether copyless mode is used for collection-returning methods.
- isCrossComponentTraversal() - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Test whether this iterator is set to traverse the graph across connected components.
- isCrossComponentTraversal() - Method in class org.jgrapht.traverse.DegeneracyOrderingIterator
-
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 graph across connected components.
- isCrossComponentTraversal() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Test whether this iterator is set to traverse the graph across connected components.
- isCrossComponentTraversal() - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Test whether this iterator is set to traverse the graph across connected components.
- isCrossComponentTraversal() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
-
Test whether this iterator is set to traverse the graph across connected components.
- isCubic(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Tests whether a graph is cubic.
- isCutpoint(V) - Method in class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Returns
true
if the vertex is a cutpoint,false
otherwise. - isDirected - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- isDirected() - Method in class org.jgrapht.graph.DefaultGraphType
- isDirected() - Method in interface org.jgrapht.GraphType
-
Returns true if all edges of the graph are directed, false otherwise.
- isEmpty() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Check if the queue has any items.
- isEmpty() - Method in class org.jgrapht.graph.GraphWalk
-
Returns true if the path is an empty path, that is, a path with startVertex=endVertex=null and with an empty vertex and edge list.
- isEmpty() - Method in class org.jgrapht.util.DoublyLinkedList
- isEmpty() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- isEmpty(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is empty.
- isEnumerationStartedEmpty() - Method in class org.jgrapht.util.PrefetchIterator
-
Tests whether the enumeration started as an empty one.
- isEqualMapping(GraphMapping<V, E>) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Checks for equality.
- isEulerian(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Test whether a graph is Eulerian.
- isEulerian(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is Eulerian.
- isExhausted() - Method in class org.jgrapht.traverse.RandomWalkIterator
-
Check if this walk is exhausted.
- isFair() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Return whether fair mode will be used for the synchronized graph being built.
- isFair() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Return whether fair mode is used for synchronizing access to this graph.
- isFixed(V) - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Check whether a vertex is a fixed point.
- isFixed(V) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- isFixed(V) - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- isForest(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether an undirected graph is a forest.
- isIn(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Check if index is in the region.
- isInduced - Variable in class org.jgrapht.graph.AsSubgraph
- isK33Subdivision(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks whether the
graph
is a $K_{3,3}$ subdivision. - isK5Subdivision(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks whether the
graph
is a $K_5$ subdivision. - isKuratowskiSubdivision(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks whether the
graph
is a Kuratowski subdivision. - isMatched(V) - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Returns true if vertex v is incident to an edge in this matching.
- isMatched(V) - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
-
Returns true if vertex v is incident to an edge in this matching.
- isMaximumMatching(MatchingAlgorithm.Matching<V, E>) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Checks whether the given matching is of maximum cardinality.
- isMixed() - Method in class org.jgrapht.graph.DefaultGraphType
- isMixed() - Method in interface org.jgrapht.GraphType
-
Returns true if the graph contain both directed and undirected edges, false otherwise.
- isModifiable() - Method in class org.jgrapht.graph.DefaultGraphType
- isModifiable() - Method in interface org.jgrapht.GraphType
-
Returns
true
if the graph is modifiable,false
otherwise. - isMultigraph() - Method in class org.jgrapht.graph.DefaultGraphType
- isMultigraph() - Method in interface org.jgrapht.GraphType
-
Returns
true
if the graph is a multigraph,false
otherwise. - isOddVertexSet(Set<V>, Set<V>) - Static method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Convenience method which test whether the given set contains an odd number of odd-labeled nodes.
- IsomorphicGraphMapping<V,E> - Class in org.jgrapht.alg.isomorphism
-
This class represents a GraphMapping between two (subgraph)isomorphic graphs.
- IsomorphicGraphMapping(Map<V, V>, Map<V, V>, Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Construct a new isomorphic graph mapping.
- IsomorphicGraphMapping(GraphOrdering<V, E>, GraphOrdering<V, E>, int[], int[]) - Constructor for class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Construct a new isomorphic graph mapping
- isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Check if an isomorphism exists.
- isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Check if an isomorphism exists.
- isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Check if an isomorphism exists.
- isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Check if an isomorphism exists.
- isomorphismExists() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector
-
Check if an isomorphism exists.
- isomorphismExists() - Method in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- IsomorphismInspector<V,E> - Interface in org.jgrapht.alg.isomorphism
-
General interface for graph and subgraph isomorphism.
- IsomorphismUndecidableException - Exception in org.jgrapht.alg.isomorphism
-
Implementation of IsomorphismUndecidableException to indicate undecidable isomorphism cases in isomorphism inspectors
- IsomorphismUndecidableException() - Constructor for exception org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with null as its detail message.
- IsomorphismUndecidableException(String) - Constructor for exception org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with the specified detail message.
- IsomorphismUndecidableException(String, Throwable) - Constructor for exception org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with the specified detail message and cause.
- IsomorphismUndecidableException(Throwable) - Constructor for exception org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with the specified cause and a detail message of (cause==null ? null : cause.toString()) (which typically contains the class and detail message of cause).
- isOptimalMatching(Graph<V, E>, Set<E>, Map<V, Integer>) - Static method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
-
Check whether a matching is optimal.
- isOverfull(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is overfull.
- isPerfect() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Returns true if the matching is a perfect matching.
- isPerfect(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is perfect.
- isPerfectEliminationOrder(List<V>) - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Checks whether the vertices in the
vertexOrder
form a perfect elimination order with respect to the inspected graph. - isPlanar() - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm
-
Tests the planarity of the
graph
. - isPlanar() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Tests the planarity of the
graph
. - isPlanar(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is planar.
- isPseudograph() - Method in class org.jgrapht.graph.DefaultGraphType
- isPseudograph() - Method in interface org.jgrapht.GraphType
-
Returns
true
if the graph is a pseudograph,false
otherwise. - isReuseEvents() - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Tests whether the
reuseEvents
flag is set. - isReuseEvents() - Method in class org.jgrapht.traverse.AbstractGraphIterator
- isReuseEvents() - Method in interface org.jgrapht.traverse.GraphIterator
-
Tests whether the
reuseEvents
flag is set. - isSeenVertex(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Determines whether a vertex has been seen yet by this traversal.
- isSimple() - Method in class org.jgrapht.graph.DefaultGraphType
- isSimple() - Method in interface org.jgrapht.GraphType
-
Returns
true
if the graph is simple,false
otherwise. - isSimple(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Check if a graph is simple.
- isSplit(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether an undirected graph is a split graph.
- isStronglyConnected() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Returns true if the graph is strongly connected, false otherwise.
- isStronglyConnected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is strongly connected.
- isTree(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether an undirected graph is a tree.
- isTriangleFree(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Tests whether an undirected graph is triangle-free (i.e.
- isUndirected() - Method in class org.jgrapht.graph.DefaultGraphType
- isUndirected() - Method in interface org.jgrapht.GraphType
-
Returns true if all edges of the graph are undirected, false otherwise.
- isUpdateDualsAfter() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Returns the
BlossomVOptions.updateDualsAfter
flag - isUpdateDualsBefore() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Returns the
BlossomVOptions.updateDualsBefore
flag - isValidIsomorphism() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Determines whether this mapping is indeed a valid isomorphic mapping between the first graph and the second graph.
- isValidPartitioning(PartitioningAlgorithm.Partitioning<V>) - Method in interface org.jgrapht.alg.interfaces.PartitioningAlgorithm
-
Check if the given vertex partitioning is valid.
- isValidPartitioning(PartitioningAlgorithm.Partitioning<V>) - Method in class org.jgrapht.alg.partition.BipartitePartitioning
-
Check if the given vertex partitioning is valid.
- isValidPath(GraphPath<V, E>, E) - Method in interface org.jgrapht.alg.shortestpath.PathValidator
-
Checks if an edge can be added to a previous path element.
- isWeaklyChordal() - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Check whether the inspected
graph
is weakly chordal. - isWeaklyChordal(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks whether a graph is weakly chordal.
- isWeaklyConnected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a directed graph is weakly connected.
- isWeighted() - Method in class org.jgrapht.graph.DefaultGraphType
- isWeighted() - Method in interface org.jgrapht.GraphType
-
Returns
true
if and only if the graph supports edge weights. - iterations - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- iterator() - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Get an iterator with all vertices' locations.
- iterator() - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- iterator() - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- iterator() - Method in class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
- iterator() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Returns an iterator over the edges in the matching.
- iterator() - Method in interface org.jgrapht.alg.interfaces.MaximalCliqueEnumerationAlgorithm
-
Returns an iterator over all maximal cliques.
- iterator() - Method in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
- iterator() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree
-
Returns an iterator over the edges in the spanning tree.
- iterator() - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Returns a topological order iterator.
- iterator() - Method in class org.jgrapht.util.DoublyLinkedList
- iterator() - Method in class org.jgrapht.util.UnmodifiableUnionSet
- iterator() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
J
- JohnsonShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Johnson's all pairs shortest paths algorithm.
- JohnsonShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Construct a new instance.
- JohnsonShortestPaths(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Construct a new instance.
- JohnsonSimpleCycles<V,E> - Class in org.jgrapht.alg.cycle
-
Find all simple cycles of a directed graph using the Johnson's algorithm.
- JohnsonSimpleCycles(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.JohnsonSimpleCycles
-
Create a simple cycle finder for the specified graph.
K
- kittellGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- klein3RegularGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- klein7RegularGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- KleinbergSmallWorldGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Kleinberg's small-world graph generator.
- KleinbergSmallWorldGraphGenerator(int, int, int, int) - Constructor for class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
-
Constructor
- KleinbergSmallWorldGraphGenerator(int, int, int, int, long) - Constructor for class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
-
Constructor
- KleinbergSmallWorldGraphGenerator(int, int, int, int, Random) - Constructor for class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
-
Constructor
- KolmogorovWeightedMatching<V,E> - Class in org.jgrapht.alg.matching.blossom.v5
-
This class computes weighted matchings in general graphs.
- KolmogorovWeightedMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Constructs a new instance of the algorithm using the default options.
- KolmogorovWeightedMatching(Graph<V, E>, BlossomVOptions) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Constructs a new instance of the algorithm with the specified
options
. - KolmogorovWeightedMatching(Graph<V, E>, BlossomVOptions, ObjectiveSense) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Constructs a new instance of the algorithm with the specified
options
. - KolmogorovWeightedMatching(Graph<V, E>, ObjectiveSense) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Constructs a new instance of the algorithm using the default options.
- KolmogorovWeightedPerfectMatching<V,E> - Class in org.jgrapht.alg.matching.blossom.v5
-
This class computes weighted perfect matchings in general graphs using the Blossom V algorithm.
- KolmogorovWeightedPerfectMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Constructs a new instance of the algorithm using the default options.
- KolmogorovWeightedPerfectMatching(Graph<V, E>, BlossomVOptions) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Constructs a new instance of the algorithm with the specified
options
. - KolmogorovWeightedPerfectMatching(Graph<V, E>, BlossomVOptions, ObjectiveSense) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Constructs a new instance of the algorithm with the specified
options
. - KolmogorovWeightedPerfectMatching(Graph<V, E>, ObjectiveSense) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Constructs a new instance of the algorithm using the default options.
- KolmogorovWeightedPerfectMatching.DualSolution<V,E> - Class in org.jgrapht.alg.matching.blossom.v5
-
A solution to the dual linear program formulated on the
graph
- KolmogorovWeightedPerfectMatching.Statistics - Class in org.jgrapht.alg.matching.blossom.v5
-
Describes the performance characteristics of the algorithm and numeric data about the number of performed dual operations during the main phase of the algorithm
- KosarajuStrongConnectivityInspector<V,E> - Class in org.jgrapht.alg.connectivity
-
Computes strongly connected components of a directed graph.
- KosarajuStrongConnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
-
Constructor
- krackhardtKiteGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- KruskalMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
An implementation of Kruskal's minimum spanning tree algorithm.
- KruskalMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.spanning.KruskalMinimumSpanningTree
-
Construct a new instance of the algorithm.
- KShortestPathAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes $k$-shortest paths between vertices.
- KShortestSimplePaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
The algorithm determines the k shortest simple paths in increasing order of weight.
- KShortestSimplePaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.KShortestSimplePaths
-
Constructs an object to compute ranking shortest paths in a graph.
- KShortestSimplePaths(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.shortestpath.KShortestSimplePaths
-
Constructs an object to calculate ranking shortest paths in a graph.
- KShortestSimplePaths(Graph<V, E>, int, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.KShortestSimplePaths
-
Constructs an object to calculate ranking shortest paths in a graph.
- KShortestSimplePaths(Graph<V, E>, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.KShortestSimplePaths
-
Constructs an object to compute ranking shortest paths in a graph.
- KSpanningTreeClustering<V,E> - Class in org.jgrapht.alg.clustering
-
The k spanning tree clustering algorithm.
- KSpanningTreeClustering(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.clustering.KSpanningTreeClustering
-
Create a new clustering algorithm.
- KuhnMunkresMinimalWeightBipartitePerfectMatching<V,E> - Class in org.jgrapht.alg.matching
-
Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres) solving assignment problem also known as hungarian algorithm (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
- KuhnMunkresMinimalWeightBipartitePerfectMatching(Graph<V, E>, Set<? extends V>, Set<? extends V>) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
-
Construct a new instance of the algorithm.
L
- LargestDegreeFirstColoring<V,E> - Class in org.jgrapht.alg.color
-
The largest degree first greedy coloring algorithm.
- LargestDegreeFirstColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.LargestDegreeFirstColoring
-
Construct a new coloring algorithm.
- lastNodeOf(Object) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the last
node
holding the specifiedelement
in this list. - layout(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
- layout(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- layout(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
- layout(Graph<V, E>, LayoutModel2D<V>) - Method in interface org.jgrapht.alg.drawing.LayoutAlgorithm2D
-
Layout a graph.
- layout(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.RandomLayoutAlgorithm2D
- LayoutAlgorithm2D<V,E> - Interface in org.jgrapht.alg.drawing
-
A general interface for a layout 2D algorithm.
- LayoutModel2D<V> - Interface in org.jgrapht.alg.drawing.model
-
A general interface for the 2D layout model.
- lazyRun() - Method in class org.jgrapht.alg.clique.BronKerboschCliqueFinder
-
Lazily execute the enumeration algorithm.
- lazyRun() - Method in class org.jgrapht.alg.clique.DegeneracyBronKerboschCliqueFinder
-
Lazily execute the enumeration algorithm.
- lazyRun() - Method in class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Lazily execute the enumeration algorithm.
- length(Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Compute the length of a vector.
- LEX_BFS - org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
- LexBreadthFirstIterator<V,E> - Class in org.jgrapht.traverse
-
A lexicographical breadth-first iterator for an undirected graph.
- LexBreadthFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.LexBreadthFirstIterator
-
Creates new lexicographical breadth-first iterator for
graph
. - LinearGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a linear graph of any size.
- LinearGraphGenerator(int) - Constructor for class org.jgrapht.generate.LinearGraphGenerator
-
Construct a new LinearGraphGenerator.
- LinearizedChordDiagramGraphGenerator<V,E> - Class in org.jgrapht.generate
-
The linearized chord diagram graph model generator.
- LinearizedChordDiagramGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
-
Constructor
- LinearizedChordDiagramGraphGenerator(int, int, long) - Constructor for class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
-
Constructor
- LinearizedChordDiagramGraphGenerator(int, int, Random) - Constructor for class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
-
Constructor
- LineGraphConverter<V,E,EE> - Class in org.jgrapht.alg.transform
-
Converter which produces the line graph of a given input graph.
- LineGraphConverter(Graph<V, E>) - Constructor for class org.jgrapht.alg.transform.LineGraphConverter
-
Line Graph Converter
- ListenableGraph<V,E> - Interface in org.jgrapht
-
A graph that supports listeners on structural change events.
- ListenableLayoutModel2D<V> - Class in org.jgrapht.alg.drawing.model
-
A layout model wrapper which adds support for listeners.
- ListenableLayoutModel2D(LayoutModel2D<V>) - Constructor for class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
-
Create a new model
- listeners - Variable in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- listIterator() - Method in class org.jgrapht.util.DoublyLinkedList
- listIterator(int) - Method in class org.jgrapht.util.DoublyLinkedList
- listIterator(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns a
DoublyLinkedList.ListNodeIterator
over the elements in this list (in proper sequence) starting with the firstDoublyLinkedList.ListNode
whose value is equal to the specifiedelement
. - ListMultiObjectiveSingleSourcePathsImpl<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
which stores one list of paths per vertex. - ListMultiObjectiveSingleSourcePathsImpl(Graph<V, E>, V, Map<V, List<GraphPath<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
-
Construct a new instance.
- ListSingleSourcePathsImpl<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of
ShortestPathAlgorithm.SingleSourcePaths
which stores one path per vertex. - ListSingleSourcePathsImpl(Graph<V, E>, V, Map<V, GraphPath<V, E>>) - Constructor for class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Construct a new instance.
- log2(int) - Static method in class org.jgrapht.util.MathUtil
-
Calculate the floor of the binary logarithm of $n$.
- longValue() - Method in class org.jgrapht.util.ModifiableInteger
- LowestCommonAncestorAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Algorithm to compute a lowest common ancestor in a tree, forest or DAG.
M
- ManyToManyShortestPathsAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes shortest paths from all sources to all targets.
- ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Base class for many-to-many shortest paths implementations.
- ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V,E> - Interface in org.jgrapht.alg.interfaces
-
A set of paths from all sources vertices to all target vertices.
- map - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
A map which keeps for each target vertex the predecessor edge and the total length of the shortest path.
- map - Variable in class org.jgrapht.graph.DefaultEdgeFunction
- MapLayoutModel2D<V> - Class in org.jgrapht.alg.drawing.model
-
A layout model which uses a hashtable to store the vertices' locations.
- MapLayoutModel2D(Box2D) - Constructor for class org.jgrapht.alg.drawing.model.MapLayoutModel2D
-
Create a new model.
- MartinShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
Martin's algorithm for the multi-objective shortest paths problem.
- MartinShortestPath(Graph<V, E>, Function<E, double[]>) - Constructor for class org.jgrapht.alg.shortestpath.MartinShortestPath
-
Create a new shortest path algorithm
- MaskSubgraph<V,E> - Class in org.jgrapht.graph
-
An unmodifiable subgraph induced by a vertex/edge masking function.
- MaskSubgraph(Graph<V, E>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.MaskSubgraph
-
Creates a new induced subgraph.
- MatchingAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Allows to derive a matching of a given graph.
- MatchingAlgorithm.Matching<V,E> - Interface in org.jgrapht.alg.interfaces
-
A graph matching.
- MatchingAlgorithm.MatchingImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
A default implementation of the matching interface.
- MatchingImpl(Graph<V, E>, Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
-
Construct a new instance
- MathUtil - Class in org.jgrapht.util
-
Math Utilities.
- MathUtil() - Constructor for class org.jgrapht.util.MathUtil
- MAX - Static variable in interface org.jgrapht.util.WeightCombiner
-
Maximum weight.
- MAX_ITERATIONS_DEFAULT - Static variable in class org.jgrapht.alg.scoring.AlphaCentrality
-
Default number of maximum iterations.
- MAX_ITERATIONS_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Default number of maximum iterations.
- maxFlow - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- maxFlowValue - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- maxHops - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
- MaximalCliqueEnumerationAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
A maximal clique enumeration algorithm.
- MAXIMIZE - org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
- MaximumCardinalityIterator<V,E> - Class in org.jgrapht.traverse
-
A maximum cardinality search iterator for an undirected graph.
- MaximumCardinalityIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.MaximumCardinalityIterator
-
Creates a maximum cardinality iterator for the
graph
. - MaximumDensitySubgraphAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Interface for algorithms computing the maximum density subgraph
- MaximumFlowAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Allows to derive maximum-flow from the supplied flow network
- MaximumFlowAlgorithm.MaximumFlow<E> - Interface in org.jgrapht.alg.interfaces
-
A maximum flow
- MaximumFlowAlgorithm.MaximumFlowImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the maximum flow
- MaximumFlowAlgorithmBase<V,E> - Class in org.jgrapht.alg.flow
-
Base class backing algorithms allowing to derive maximum-flow from the supplied flow network
- MaximumFlowAlgorithmBase(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Construct a new maximum flow
- MaximumFlowImpl(Double, Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
-
Create a new maximum flow
- MaximumWeightBipartiteMatching<V,E> - Class in org.jgrapht.alg.matching
-
Maximum weight matching in bipartite graphs.
- MaximumWeightBipartiteMatching(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Constructor.
- MaximumWeightBipartiteMatching(Graph<V, E>, Set<V>, Set<V>, Function<Comparator<BigDecimal>, AddressableHeap<BigDecimal, V>>) - Constructor for class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Constructor.
- MCS - org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
- mergeVertices(Set<V>, Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Merges vertex $t$ into vertex $s$, summing the weights as required.
- MIN - Static variable in interface org.jgrapht.util.WeightCombiner
-
Minimum weight.
- minCut() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Return a set of vertices on one side of the cut
- minCutWeight() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Return the weight of the minimum cut
- MINIMIZE - org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
- MinimumCostFlowAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Allows to calculate minimum cost flow on the specified minimum cost flow problem.
- MinimumCostFlowAlgorithm.MinimumCostFlow<E> - Interface in org.jgrapht.alg.interfaces
-
Represents a minimum cost flow.
- MinimumCostFlowAlgorithm.MinimumCostFlowImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the
MinimumCostFlowAlgorithm.MinimumCostFlow
- MinimumCostFlowImpl(double, Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlowImpl
-
Constructs a new instance of minimum cost flow
- MinimumCostFlowProblem<V,E> - Interface in org.jgrapht.alg.flow.mincost
-
This class represents a minimum cost flow problem.
- MinimumCostFlowProblem.MinimumCostFlowProblemImpl<V,E> - Class in org.jgrapht.alg.flow.mincost
-
Default implementation of a Minimum Cost Flow Problem
- MinimumCostFlowProblemImpl(Graph<V, E>, Function<V, Integer>, Function<E, Integer>) - Constructor for class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Constructs a new minimum cost flow problem without arc capacity lower bounds.
- MinimumCostFlowProblemImpl(Graph<V, E>, Function<V, Integer>, Function<E, Integer>, Function<E, Integer>) - Constructor for class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Constructs a new minimum cost flow problem
- minimumCutPhase(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Implements the MinimumCutPhase function of Stoer and Wagner.
- MinimumSTCutAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Given a weighted graph $G(V,E)$ (directed or undirected).
- mixed() - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder for a mixed graph.
- mixed() - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set the type as mixed.
- mixed() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A mixed graph type.
- möbiusKantorGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- model - Variable in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- modifiable(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether the graph is modifiable.
- ModifiableInteger - Class in org.jgrapht.util
-
The
ModifiableInteger
class wraps a value of the primitive typeint
in an object, similarly toInteger
. - ModifiableInteger() - Constructor for class org.jgrapht.util.ModifiableInteger
-
Deprecated.not really deprecated, just marked so to avoid mistaken use.
- ModifiableInteger(int) - Constructor for class org.jgrapht.util.ModifiableInteger
-
Constructs a newly allocated
ModifiableInteger
object that represents the specifiedint
value. - moserSpindleGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- moveFrom(int, DoublyLinkedList<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Moves all
ListNodes
of the givensourceList
to this list and inserts them all before the node previously at the given position. - moveToFront(HierholzerEulerianCycle.VertexNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Move a vertex as first in the vertex list.
- moveVertex(V, Integer, Integer) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Moves
vertex
from the subset represented byfromLabel
to the subset represented bytoLabel
. - moveVertices(Set<V>, Integer, Integer) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Moves all vertices in
vertices
from the subset represented byfromLabel
to the subset represented bytoLabel
. - MULT - Static variable in interface org.jgrapht.util.WeightCombiner
-
Multiplication of weights.
- multigraph() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A multigraph type.
- Multigraph<V,E> - Class in org.jgrapht.graph
-
A multigraph.
- Multigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.Multigraph
-
Creates a new graph.
- Multigraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.Multigraph
-
Creates a new graph.
- MultiObjectiveShortestPathAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes multi-objective shortest paths between vertices.
- MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E> - Interface in org.jgrapht.alg.interfaces
-
A set of paths starting from a single source vertex.
- MULTIPLE_TREE_CONNECTED_COMPONENTS - org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
- MULTIPLE_TREE_FIXED_DELTA - org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
N
- NaiveLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Find the Lowest Common Ancestor of a directed graph.
- NaiveLCAFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.lca.NaiveLCAFinder
-
Create a new instance of the naive LCA finder.
- NamedGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Collection of commonly used named graphs
- NamedGraphGenerator() - Constructor for class org.jgrapht.generate.NamedGraphGenerator
-
Constructs a new generator for named graphs
- nauruGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- NearestInsertionHeuristicTSP<V,E> - Class in org.jgrapht.alg.tour
-
The nearest insertion heuristic algorithm for the TSP problem.
- NearestInsertionHeuristicTSP() - Constructor for class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Constructor.
- NearestInsertionHeuristicTSP(GraphPath<V, E>) - Constructor for class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Constructor Specifies an existing sub-tour that will be augmented to form a complete tour when
NearestInsertionHeuristicTSP.getTour(org.jgrapht.Graph)
is called - NearestNeighborHeuristicTSP<V,E> - Class in org.jgrapht.alg.tour
-
The nearest neighbour heuristic algorithm for the TSP problem.
- NearestNeighborHeuristicTSP() - Constructor for class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Constructor.
- NearestNeighborHeuristicTSP(long) - Constructor for class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Constructor
- NearestNeighborHeuristicTSP(Random) - Constructor for class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Constructor
- NearestNeighborHeuristicTSP(V) - Constructor for class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Constructor
- negate(Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Given a vector $a$ compute $-a$.
- NegativeCycleDetectedException - Exception in org.jgrapht.alg.shortestpath
-
An exception used to notify about the detection of a negative cycle.
- NegativeCycleDetectedException() - Constructor for exception org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Constructs a new exception with
null
as its detail message. - NegativeCycleDetectedException(String) - Constructor for exception org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Constructs a new exception with the specified detail message.
- NegativeCycleDetectedException(String, GraphPath<?, ?>) - Constructor for exception org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Constructs a new exception with the specified detail message.
- NeighborCache<V,E> - Class in org.jgrapht.alg.util
-
Maintains a cache of each vertex's neighbors.
- NeighborCache(Graph<V, E>) - Constructor for class org.jgrapht.alg.util.NeighborCache
-
Constructor
- neighborListOf(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Returns a list of vertices that are the neighbors of a specified vertex.
- neighborListOf(V) - Method in class org.jgrapht.alg.util.NeighborCache
-
Returns a list of vertices which are adjacent to a specified vertex.
- neighbors - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Map of neighbors, and a count of the number of edges to this neighbor
- neighborSetOf(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Returns a set of vertices that are neighbors of a specified vertex.
- neighborsOf(V) - Method in class org.jgrapht.alg.util.NeighborCache
-
Returns the unique neighbors of the given vertex if it exists in the cache, otherwise it is initialized.
- network - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- newHashMapWithExpectedSize(int) - Static method in class org.jgrapht.util.CollectionUtil
-
Returns a
HashMap
with an initial capacity that is sufficient to holdexpectedSize
mappings without rehashing its internal backing storage. - newHashSetWithExpectedSize(int) - Static method in class org.jgrapht.util.CollectionUtil
-
Returns a
HashSet
with an initial capacity that is sufficient to holdexpectedSize
elements without rehashing its internal backing storage. - newLinkedHashMapWithExpectedSize(int) - Static method in class org.jgrapht.util.CollectionUtil
-
Returns a
LinkedHashMap
with an initial capacity that is sufficient to holdexpectedSize
mappings without rehashing its internal backing storage. - newLinkedHashSetWithExpectedSize(int) - Static method in class org.jgrapht.util.CollectionUtil
-
Returns a
LinkedHashSet
with an initial capacity that is sufficient to holdexpectedSize
elements without rehashing its internal backing storage. - next - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- next - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- next() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
- next() - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
- next() - Method in class org.jgrapht.alg.util.AliasMethodSampler
-
Sample a value from the distribution.
- next() - Method in class org.jgrapht.traverse.CrossComponentIterator
- next() - Method in class org.jgrapht.traverse.DegeneracyOrderingIterator
- next() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Returns the next vertex in the ordering.
- next() - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Returns the next vertex in the ordering.
- next() - Method in class org.jgrapht.traverse.RandomWalkIterator
- next() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
- next() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNodeIterator
- next() - Method in interface org.jgrapht.util.DoublyLinkedList.NodeIterator
- next() - Method in class org.jgrapht.util.PrefetchIterator
- nextElement() - Method in class org.jgrapht.util.PrefetchIterator
- nextElement() - Method in interface org.jgrapht.util.PrefetchIterator.NextElementFunctor
-
Return the next element or throw a
NoSuchElementException
if there are no more elements. - nextNode() - Method in interface org.jgrapht.util.DoublyLinkedList.NodeIterator
-
Returns the next
DoublyLinkedList.ListNode
in the list and advances the cursor position. - nListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- NO_PERFECT_MATCHING_THRESHOLD - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Defines the threshold for throwing an exception about no perfect matching existence
- nodeOf(Object) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the first
node
holding the specifiedelement
in this list. - NONE - org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- normalizationFactor - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- normalize - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Whether to normalize scores
- notifyListeners(V, Point2D) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
-
Notify all registered listeners.
- NULL_NODE - Static variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- numberOfExpandedNodes - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- numberOfPaths() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition
- numberOfSets() - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the number of sets.
O
- OBJECT_SUPPLIER - Static variable in class org.jgrapht.util.SupplierUtil
-
Supplier for
Object
. - ObjectiveSense - Enum in org.jgrapht.alg.matching.blossom.v5
-
Enum specifying the objective sense of the algorithm.
- of(double, double) - Static method in class org.jgrapht.alg.drawing.model.Box2D
-
Create a new box
- of(double, double) - Static method in class org.jgrapht.alg.drawing.model.Point2D
-
Create a new point
- of(double, double, double, double) - Static method in class org.jgrapht.alg.drawing.model.Box2D
-
Create a new box
- of(A, B) - Static method in class org.jgrapht.alg.util.Pair
-
Create a new pair.
- of(A, B) - Static method in class org.jgrapht.alg.util.UnorderedPair
-
Creates new unordered pair of elements pulling of the necessity to provide corresponding types of the elements supplied.
- of(A, B, C) - Static method in class org.jgrapht.alg.util.Triple
-
Create a new triple.
- offer(E) - Method in class org.jgrapht.util.DoublyLinkedList
- offerFirst(E) - Method in class org.jgrapht.util.DoublyLinkedList
- offerLast(E) - Method in class org.jgrapht.util.DoublyLinkedList
- openList - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- optimalDistance - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- ordering1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- ordering2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- org.jgrapht - package org.jgrapht
-
The front-end API's interfaces and classes, including
Graph
. - org.jgrapht.alg - package org.jgrapht.alg
-
Algorithms provided with JGraphT.
- org.jgrapht.alg.clique - package org.jgrapht.alg.clique
-
Clique related algorithms.
- org.jgrapht.alg.clustering - package org.jgrapht.alg.clustering
-
Graph clustering algorithms.
- org.jgrapht.alg.color - package org.jgrapht.alg.color
-
Graph coloring algorithms.
- org.jgrapht.alg.connectivity - package org.jgrapht.alg.connectivity
-
Algorithms dealing with various connectivity aspects of a graph.
- org.jgrapht.alg.cycle - package org.jgrapht.alg.cycle
-
Algorithms related to graph cycles.
- org.jgrapht.alg.decomposition - package org.jgrapht.alg.decomposition
-
Algorithms for computing decompositions.
- org.jgrapht.alg.densesubgraph - package org.jgrapht.alg.densesubgraph
-
Algorithms for computing maximum density subgraphs.
- org.jgrapht.alg.drawing - package org.jgrapht.alg.drawing
-
Graph Drawing.
- org.jgrapht.alg.drawing.model - package org.jgrapht.alg.drawing.model
-
Graph Drawing Basic Types and Models.
- org.jgrapht.alg.flow - package org.jgrapht.alg.flow
-
Flow related algorithms.
- org.jgrapht.alg.flow.mincost - package org.jgrapht.alg.flow.mincost
-
Algorithms for minimum cost flow
- org.jgrapht.alg.independentset - package org.jgrapht.alg.independentset
-
Algorithms for Independent Set in a graph.
- org.jgrapht.alg.interfaces - package org.jgrapht.alg.interfaces
-
Algorithm related interfaces.
- org.jgrapht.alg.isomorphism - package org.jgrapht.alg.isomorphism
-
Algorithms for (sub)graph isomorphism.
- org.jgrapht.alg.lca - package org.jgrapht.alg.lca
-
Algorithms for computing lowest common ancestors in graphs.
- org.jgrapht.alg.matching - package org.jgrapht.alg.matching
-
Algorithms for the computation of matchings.
- org.jgrapht.alg.matching.blossom.v5 - package org.jgrapht.alg.matching.blossom.v5
-
Package for Kolmogorov's Blossom V algorithm
- org.jgrapht.alg.partition - package org.jgrapht.alg.partition
-
Algorithm for computing partitions.
- org.jgrapht.alg.planar - package org.jgrapht.alg.planar
-
Algorithms for testing planarity of the graphs
- org.jgrapht.alg.scoring - package org.jgrapht.alg.scoring
-
Vertex and/or edge scoring algorithms.
- org.jgrapht.alg.shortestpath - package org.jgrapht.alg.shortestpath
-
Shortest-path related algorithms.
- org.jgrapht.alg.spanning - package org.jgrapht.alg.spanning
-
Spanning tree and spanner algorithms.
- org.jgrapht.alg.tour - package org.jgrapht.alg.tour
-
Graph tours related algorithms.
- org.jgrapht.alg.transform - package org.jgrapht.alg.transform
-
Package for graph transformers
- org.jgrapht.alg.util - package org.jgrapht.alg.util
-
Utilities used by JGraphT algorithms.
- org.jgrapht.alg.util.extension - package org.jgrapht.alg.util.extension
-
Utility classes for managing extensions/encapsulations.
- org.jgrapht.alg.vertexcover - package org.jgrapht.alg.vertexcover
-
Vertex cover algorithms.
- org.jgrapht.alg.vertexcover.util - package org.jgrapht.alg.vertexcover.util
-
Utilities for vertex cover algorithms.
- org.jgrapht.event - package org.jgrapht.event
-
Event classes and listener interfaces, used to provide a change notification mechanism on graph modification events.
- org.jgrapht.generate - package org.jgrapht.generate
-
Generators for graphs of various topologies.
- org.jgrapht.graph - package org.jgrapht.graph
-
Implementations of various graphs.
- org.jgrapht.graph.builder - package org.jgrapht.graph.builder
-
Various builder for graphs.
- org.jgrapht.graph.concurrent - package org.jgrapht.graph.concurrent
-
Implementations of various concurrent graph structures.
- org.jgrapht.graph.specifics - package org.jgrapht.graph.specifics
-
Implementations of specifics for various graph types.
- org.jgrapht.traverse - package org.jgrapht.traverse
-
Graph traversal means.
- org.jgrapht.util - package org.jgrapht.util
-
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
- outDegreeOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- outDegreeOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in interface org.jgrapht.Graph
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns the "out degree" of the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns a set of all edges outgoing from the specified vertex.
P
- PadbergRaoOddMinimumCutset<V,E> - Class in org.jgrapht.alg.flow
-
Implementation of the algorithm by Padberg and Rao to compute Odd Minimum Cut-Sets.
- PadbergRaoOddMinimumCutset(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
- PadbergRaoOddMinimumCutset(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
- PadbergRaoOddMinimumCutset(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
- PageRank<V,E> - Class in org.jgrapht.alg.scoring
-
PageRank implementation.
- PageRank(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank(Graph<V, E>, double, int, double) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- Pair<A,B> - Class in org.jgrapht.alg.util
-
Generic pair.
- Pair(A, B) - Constructor for class org.jgrapht.alg.util.Pair
-
Create a new pair
- PalmerHamiltonianCycle<V,E> - Class in org.jgrapht.alg.tour
-
Palmer's algorithm for computing Hamiltonian cycles in graphs that meet Ore's condition.
- PalmerHamiltonianCycle() - Constructor for class org.jgrapht.alg.tour.PalmerHamiltonianCycle
-
Construct a new instance
- pappusGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- ParanoidGraph<V,E> - Class in org.jgrapht.graph
-
ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.
- ParanoidGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.ParanoidGraph
-
Create a new paranoid graph.
- PartitioningAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Algorithm to compute a vertex partitioning of a graph.
- PartitioningAlgorithm.Partitioning<V> - Interface in org.jgrapht.alg.interfaces
- PartitioningAlgorithm.PartitioningImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of a vertex partition
- PartitioningImpl(List<Set<V>>) - Constructor for class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
-
Construct a new vertex partitioning.
- PartitioningImpl(Map<V, Integer>) - Constructor for class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
-
Construct a new vertex partitioning.
- partitionSubtreesOfSubset(Set<V>, int) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Refines the partition by adding new subsets if the designated root has more than one subtree in the subset
label
of the partition. - PathDecompositionImpl(Graph<V, E>, Set<E>, List<List<V>>) - Constructor for class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
-
Construct a new path decomposition.
- pathExists(V, V) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
-
Tests whether two vertices lay respectively in the same connected component (undirected graph), or in the same weakly connected component (directed graph).
- PathGrowingWeightedMatching<V,E> - Class in org.jgrapht.alg.matching
-
A linear time $\frac{1}{2}$-approximation algorithm for finding a maximum weight matching in an arbitrary graph.
- PathGrowingWeightedMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Construct a new instance of the path growing algorithm.
- PathGrowingWeightedMatching(Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Construct a new instance of the path growing algorithm.
- PathGrowingWeightedMatching(Graph<V, E>, boolean, double) - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Construct a new instance of the path growing algorithm.
- paths - Variable in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
-
One path per vertex
- paths - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
One path per vertex
- PathValidator<V,E> - Interface in org.jgrapht.alg.shortestpath
-
May be used to provide external path validations in addition to the basic validations done by
KShortestSimplePaths
- that the path is from source to target and that it does not contain loops. - PatonCycleBase<V,E> - Class in org.jgrapht.alg.cycle
-
Find a cycle basis of an undirected graph using a variant of Paton's algorithm.
- PatonCycleBase(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.PatonCycleBase
-
Create a cycle base finder for the specified graph.
- peek() - Method in class org.jgrapht.util.DoublyLinkedList
- peekFirst() - Method in class org.jgrapht.util.DoublyLinkedList
- peekLast() - Method in class org.jgrapht.util.DoublyLinkedList
- petersenGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- PivotBronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Bron-Kerbosch maximal clique enumeration algorithm with pivot.
- PivotBronKerboschCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Constructs a new clique finder.
- PivotBronKerboschCliqueFinder(Graph<V, E>, long, TimeUnit) - Constructor for class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Constructs a new clique finder.
- PlanarityTestingAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Allows to check the planarity of the graph.
- PlanarityTestingAlgorithm.Embedding<V,E> - Interface in org.jgrapht.alg.interfaces
-
A combinatorial embedding of the graph.
- PlanarityTestingAlgorithm.EmbeddingImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Implementation of the
PlanarityTestingAlgorithm.Embedding
. - PlantedPartitionGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Create a random $l$-planted partition graph.
- PlantedPartitionGraphGenerator(int, int, double, double) - Constructor for class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Construct a new PlantedPartitionGraphGenerator.
- PlantedPartitionGraphGenerator(int, int, double, double, boolean) - Constructor for class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Construct a new PlantedPartitionGraphGenerator.
- PlantedPartitionGraphGenerator(int, int, double, double, long) - Constructor for class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Construct a new PlantedPartitionGraphGenerator.
- PlantedPartitionGraphGenerator(int, int, double, double, long, boolean) - Constructor for class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Construct a new PlantedPartitionGraphGenerator.
- PlantedPartitionGraphGenerator(int, int, double, double, Random, boolean) - Constructor for class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Construct a new PlantedPartitionGraphGenerator.
- Point2D - Class in org.jgrapht.alg.drawing.model
-
A 2-dimensional point in Euclidean space.
- Point2D(double, double) - Constructor for class org.jgrapht.alg.drawing.model.Point2D
-
Create a new point
- points - Variable in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- Points - Class in org.jgrapht.alg.drawing.model
-
A collection of utilities to assist with point manipulation.
- Points() - Constructor for class org.jgrapht.alg.drawing.model.Points
- poll() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Poll the first element from the queue.
- poll() - Method in class org.jgrapht.util.DoublyLinkedList
- pollFirst() - Method in class org.jgrapht.util.DoublyLinkedList
- pollLast() - Method in class org.jgrapht.util.DoublyLinkedList
- pop() - Method in class org.jgrapht.util.DoublyLinkedList
- poussinGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- predecessorListOf(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Returns a list of vertices that are the direct predecessors of a specified vertex.
- predecessorsOf(V) - Method in class org.jgrapht.alg.util.NeighborCache
-
Returns the unique predecessors of the given vertex if it exists in the cache, otherwise it is initialized.
- PrefetchIterator<E> - Class in org.jgrapht.util
-
Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time.
- PrefetchIterator(PrefetchIterator.NextElementFunctor<E>) - Constructor for class org.jgrapht.util.PrefetchIterator
-
Construct a new prefetch iterator.
- PrefetchIterator.NextElementFunctor<EE> - Interface in org.jgrapht.util
-
A functor for the calculation of the next element.
- prepend(DoublyLinkedList<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Prepends the
movedList
to the beginning of this list. - prev - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- prev - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- previous() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNodeIterator
- previousNode() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNodeIterator
-
Returns the previous
DoublyLinkedList.ListNode
in the list and moves the cursor position backwards. - PrimMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
An implementation of Prim's algorithm that finds a minimum spanning tree/forest subject to connectivity of the supplied weighted undirected graph.
- PrimMinimumSpanningTree(Graph<V, E>) - Constructor for class org.jgrapht.alg.spanning.PrimMinimumSpanningTree
-
Construct a new instance of the algorithm.
- printSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Print to the standard output all simple cycles without building a list to keep them, thus avoiding high memory consumption when investigating large and much connected graphs.
- provideNextVertex() - Method in class org.jgrapht.traverse.BreadthFirstIterator
- provideNextVertex() - Method in class org.jgrapht.traverse.ClosestFirstIterator
- provideNextVertex() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Returns the vertex to be returned in the following call to the iterator
next
method. - provideNextVertex() - Method in class org.jgrapht.traverse.DepthFirstIterator
- PruferTreeGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a random tree using Prüfer sequences.
- PruferTreeGenerator(int) - Constructor for class org.jgrapht.generate.PruferTreeGenerator
-
Construct a new PruferTreeGenerator.
- PruferTreeGenerator(int[]) - Constructor for class org.jgrapht.generate.PruferTreeGenerator
-
Construct a new PruferTreeGenerator from an input Prüfer sequence.
- PruferTreeGenerator(int, long) - Constructor for class org.jgrapht.generate.PruferTreeGenerator
-
Construct a new PruferTreeGenerator.
- PruferTreeGenerator(int, Random) - Constructor for class org.jgrapht.generate.PruferTreeGenerator
-
Construct a new PruferTreeGenerator
- pseudograph() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A pseudograph type.
- Pseudograph<V,E> - Class in org.jgrapht.graph
-
A pseudograph.
- Pseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.Pseudograph
-
Creates a new graph.
- Pseudograph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.Pseudograph
-
Creates a new graph.
- push(E) - Method in class org.jgrapht.util.DoublyLinkedList
- pushFlowThrough(MaximumFlowAlgorithmBase.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Increase flow in the direction denoted by edge $(u,v)$.
- pushFlowThrough(MaximumFlowAlgorithmBase.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Push flow through an edge.
- PushRelabelMFImpl<V,E> - Class in org.jgrapht.alg.flow
-
Push-relabel maximum flow algorithm designed by Andrew V.
- PushRelabelMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Construct a new push-relabel algorithm.
- PushRelabelMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Construct a new push-relabel algorithm.
- PushRelabelMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
-
Vertex extension for the push-relabel algorithm, which contains an additional height.
- put(V, Point2D) - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Set the location of a vertex.
- put(V, Point2D) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- put(V, Point2D) - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- putSeenData(V, D) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Stores iterator-dependent data for a vertex that has been seen.
- putVertex(Integer, V) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Add a vertex at the given topological index.
- putVertex(Integer, V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- putVertex(Integer, V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
Q
- QueueBFSFundamentalCycleBasis<V,E> - Class in org.jgrapht.alg.cycle
-
Generate a set of fundamental cycles by building a spanning tree (forest) using a straightforward implementation of BFS using a FIFO queue.
- QueueBFSFundamentalCycleBasis(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.QueueBFSFundamentalCycleBasis
-
Constructor
R
- radius - Variable in class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
- RadixSort - Class in org.jgrapht.util
-
Sorts the specified list of integers into ascending order using the Radix Sort method.
- RandomGreedyColoring<V,E> - Class in org.jgrapht.alg.color
-
The greedy coloring algorithm with a random vertex ordering.
- RandomGreedyColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.RandomGreedyColoring
-
Construct a new coloring algorithm.
- RandomGreedyColoring(Graph<V, E>, Random) - Constructor for class org.jgrapht.alg.color.RandomGreedyColoring
-
Construct a new coloring algorithm
- RandomLayoutAlgorithm2D<V,E> - Class in org.jgrapht.alg.drawing
-
Random layout.
- RandomLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.RandomLayoutAlgorithm2D
-
Create a new layout algorithm
- RandomLayoutAlgorithm2D(long) - Constructor for class org.jgrapht.alg.drawing.RandomLayoutAlgorithm2D
-
Create a new layout algorithm
- RandomLayoutAlgorithm2D(Random) - Constructor for class org.jgrapht.alg.drawing.RandomLayoutAlgorithm2D
-
Create a new layout algorithm
- RandomRegularGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generate a random $d$-regular undirected graph with $n$ vertices.
- RandomRegularGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.RandomRegularGraphGenerator
-
Construct a new RandomRegularGraphGenerator.
- RandomRegularGraphGenerator(int, int, long) - Constructor for class org.jgrapht.generate.RandomRegularGraphGenerator
-
Construct a new RandomRegularGraphGenerator.
- RandomRegularGraphGenerator(int, int, Random) - Constructor for class org.jgrapht.generate.RandomRegularGraphGenerator
-
Construct a new RandomRegularGraphGenerator.
- RandomTourTSP<V,E> - Class in org.jgrapht.alg.tour
-
Generate a random tour.
- RandomTourTSP() - Constructor for class org.jgrapht.alg.tour.RandomTourTSP
-
Construct with default random number generator
- RandomTourTSP(Random) - Constructor for class org.jgrapht.alg.tour.RandomTourTSP
-
Construct with specified random number generator
- RandomWalkIterator<V,E> - Class in org.jgrapht.traverse
-
A random walk iterator for a directed or undirected graph.
- RandomWalkIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.RandomWalkIterator
-
Creates a new iterator for the specified graph.
- RandomWalkIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.RandomWalkIterator
-
Creates a new iterator for the specified graph.
- RandomWalkIterator(Graph<V, E>, V, boolean) - Constructor for class org.jgrapht.traverse.RandomWalkIterator
-
Creates a new iterator for the specified graph.
- RandomWalkIterator(Graph<V, E>, V, boolean, long) - Constructor for class org.jgrapht.traverse.RandomWalkIterator
-
Creates a new iterator for the specified graph.
- RandomWalkIterator(Graph<V, E>, V, boolean, long, Random) - Constructor for class org.jgrapht.traverse.RandomWalkIterator
-
Creates a new iterator for the specified graph.
- RatioVertex<V> - Class in org.jgrapht.alg.vertexcover.util
-
Helper class for vertex covers.
- RatioVertex(int, V, double) - Constructor for class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Create a new ratio vertex
- RecursiveExactVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover
-
Finds a minimum vertex cover in a undirected graph.
- RecursiveExactVCImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Constructs a new GreedyVCImpl instance
- RecursiveExactVCImpl(Graph<V, E>, Map<V, Double>) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Constructs a new GreedyVCImpl instance
- RecursiveExactVCImpl.BitSetCover - Class in org.jgrapht.alg.vertexcover
-
Helper class which represents a vertex cover as a space efficient BitSet
- reduce(Graph<V, E>) - Method in class org.jgrapht.alg.TransitiveReduction
-
This method will remove all transitive edges from the graph passed as input parameter.
- Region(int, int) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Construct a new region.
- REGULAR - Variable in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Key used to access the regular polygon vertices in the resultMap
- remove() - Method in class org.jgrapht.traverse.AbstractGraphIterator
- remove() - Method in interface org.jgrapht.traverse.GraphIterator
-
Unsupported.
- remove() - Method in class org.jgrapht.util.DoublyLinkedList
- remove() - Method in class org.jgrapht.util.PrefetchIterator
- remove(int) - Method in class org.jgrapht.util.DoublyLinkedList
- remove(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Remove an edge.
- remove(E) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Remove an edge.
- remove(Object) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- removeAll(Collection<?>) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- 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.AbstractGraph
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Removes all the edges in this graph that are also contained in the specified edge collection.
- removeAllEdges(Collection<? extends E>) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes all the edges in this graph that are also contained in the specified edge collection.
- removeAllEdges(Collection<? extends E>) - Method in interface org.jgrapht.Graph
-
Removes all the edges in this graph that are also contained in the specified edge collection.
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.AbstractGraph
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Removes all the edges going from the specified source vertex to the specified target vertex, and returns a set of all removed edges.
- removeAllEdges(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes all the edges going from the specified source vertex to the specified target vertex, and returns a set of all removed edges.
- removeAllEdges(V, V) - Method in interface org.jgrapht.Graph
-
Removes all the edges going from the specified source vertex to the specified target vertex, and returns a set of all removed edges.
- removeAllVertices() - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Remove all vertices from the topological ordering.
- removeAllVertices() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- removeAllVertices() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.AbstractGraph
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- removeAllVertices(Collection<? extends V>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
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.MaskSubgraph
-
Removes all the vertices in this graph that are also contained in the specified vertex collection.
- removeAllVertices(Collection<? extends V>) - Method in interface org.jgrapht.Graph
-
Removes all the vertices in this graph that are also contained in the specified vertex collection.
- removeEdge(E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.AsGraphUnion
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.AsSubgraph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- removeEdge(E) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.DefaultListenableGraph
- removeEdge(E) - Method in class org.jgrapht.graph.GraphDelegator
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in interface org.jgrapht.Graph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Remove a vertex edge
- removeEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.AsSubgraph
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- 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.concurrent.AsSynchronizedGraph
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
- removeEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- removeEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdge(V, V) - Method in interface org.jgrapht.Graph
-
Removes an edge going from source vertex to target vertex, if such vertices and such edge exist in this graph.
- removeEdgeFromTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Removes the specified edge from the edge containers of its source and target vertices.
- removeEdgeFromTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- removeEdgeFromTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- removeEdgeFromTouchingVertices(V, V, E) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Removes the specified edge from the edge containers of its source and target vertices.
- removeEdgeFromTouchingVertices(V, V, E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Removes the specified edge from the edge containers of its source and target vertices.
- removeFirst() - Method in class org.jgrapht.util.DoublyLinkedList
- removeFirstOccurrence(Object) - Method in class org.jgrapht.util.DoublyLinkedList
- removeFromIndex(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
-
Remove an edge from the index.
- removeFromIndex(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
-
Remove an edge from the index.
- removeGraphListener(GraphListener<V, E>) - Method in class org.jgrapht.graph.DefaultListenableGraph
- removeGraphListener(GraphListener<V, E>) - Method in interface org.jgrapht.ListenableGraph
-
Removes the specified graph listener from this graph, if present.
- removeIncomingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
Remove an incoming edge.
- removeLast() - Method in class org.jgrapht.util.DoublyLinkedList
- removeLastOccurrence(Object) - Method in class org.jgrapht.util.DoublyLinkedList
- removeListener(BiConsumer<V, Point2D>) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
-
Remove a listener.
- removeNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Remove a neighbor.
- removeNode(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Removes the
node
from this list. - removeOutgoingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
Remove an outgoing edge.
- removeTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
- 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.graph.AbstractBaseGraph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in class org.jgrapht.graph.AsSubgraph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- 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.concurrent.AsSynchronizedGraph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
- removeVertex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
- removeVertex(V) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Remove the given vertex from the topological ordering.
- removeVertex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- removeVertex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- removeVertex(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in interface org.jgrapht.Graph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertexAndPreserveConnectivity(Graph<V, E>, Iterable<V>) - Static method in class org.jgrapht.Graphs
-
Removes all the given vertices from the given graph.
- removeVertexAndPreserveConnectivity(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Removes the given vertex from the given graph.
- removeVertexSetListener(VertexSetListener<V>) - Method in class org.jgrapht.graph.DefaultListenableGraph
- removeVertexSetListener(VertexSetListener<V>) - Method in interface org.jgrapht.ListenableGraph
-
Removes the specified vertex set listener from this graph, if present.
- removeVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Removes each vertex of
vertices
from the graph being built, if such vertices exist in graph. - removeVerticesAndPreserveConnectivity(Graph<V, E>, Predicate<V>) - Static method in class org.jgrapht.Graphs
-
Filters vertices from the given graph and subsequently removes them.
- repulsiveForce(double) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the repulsive force.
- requireDirected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is directed and throws an
IllegalArgumentException
if it is not. - requireDirected(Graph<V, E>, String) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is directed and throws a customized
IllegalArgumentException
if it is not. - requireDirectedOrUndirected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is directed and throws an
IllegalArgumentException
if it is not. - requireDirectedOrUndirected(Graph<V, E>, String) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is directed or undirected and throws a customized
IllegalArgumentException
if it is not. - requireUndirected(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is undirected and throws an
IllegalArgumentException
if it is not. - requireUndirected(Graph<V, E>, String) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is undirected and throws a customized
IllegalArgumentException
if it is not. - requireWeighted(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks that the specified graph is weighted and throws a customized
IllegalArgumentException
if it is not. - reset() - Method in class org.jgrapht.alg.util.UnionFind
-
Resets the UnionFind data structure: each element is placed in its own singleton set.
- retainAll(Collection<?>) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- reusableEdgeEvent - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- reusableVertexEvent - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- reuseEvents - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- reverse - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- reverse() - Method in class org.jgrapht.graph.GraphWalk
-
Reverses the direction of the walk.
- reverse(Function<GraphWalk<V, E>, Double>) - Method in class org.jgrapht.graph.GraphWalk
-
Reverses the direction of the walk.
- reverseCircularIterator(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns a
DoublyLinkedList.NodeIterator
that starts at the firstDoublyLinkedList.ListNode
of this list that is equal to the specifiedfirstElement
, iterates in reverse direction over the end of this list until the first node. - RingGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a ring graph of any size.
- RingGraphGenerator(int) - Constructor for class org.jgrapht.generate.RingGraphGenerator
-
Construct a new RingGraphGenerator.
- rng - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- root - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the designated root of the CMST.
S
- SaturationDegreeColoring<V,E> - Class in org.jgrapht.alg.color
-
The Dsatur greedy coloring algorithm.
- SaturationDegreeColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.SaturationDegreeColoring
-
Construct a new coloring algorithm.
- savedComparisons - Variable in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
- scalarMultiply(Point2D, double) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Multiply a vector with a scalar.
- scalarMultiply(Point2D, S, BiFunction<Double, S, Double>) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Multiply a vector with a scalar.
- ScaleFreeGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates directed or undirected scale-free network of any size.
- ScaleFreeGraphGenerator(int) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Constructor
- ScaleFreeGraphGenerator(int, long) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Constructor
- ScaleFreeGraphGenerator(int, Random) - Constructor for class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Constructor
- schläfliGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- scores - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
The actual scores
- second - Variable in class org.jgrapht.alg.util.Pair
-
The second pair element
- second - Variable in class org.jgrapht.alg.util.Triple
-
The second element
- second - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
- second(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
Set the second partition of the generator.
- SECOND - Static variable in interface org.jgrapht.util.WeightCombiner
-
Second weight.
- selectOutgoingEdges(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Selects the outgoing edges for a given vertex based on the source vertex and other traversal state.
- self() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
- self() - Method in class org.jgrapht.graph.builder.GraphBuilder
- SELF_LOOPS_NOT_ALLOWED - Static variable in class org.jgrapht.alg.color.GreedyColoring
-
Error message if the input graph contains self-loops.
- SENTINEL - Static variable in class org.jgrapht.traverse.DepthFirstIterator
-
Sentinel object.
- set(E, T) - Method in class org.jgrapht.graph.DefaultEdgeFunction
-
Set the function value for an edge.
- setAllowingMultipleEdges(boolean) - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Sets whether the generated graph may contain multiple (parallel) edges between the same two vertices
- setAllowingSelfLoops(boolean) - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Sets whether the generated graph may contain multiple (parallel) edges between the same two vertices
- setCache(boolean) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Set the cache strategy for
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - setCopyless() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph which does not return collection copies.
- 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
- setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.DegeneracyOrderingIterator
-
Sets the cross component traversal flag - indicates whether to traverse the graph across connected components.
- setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Sets the cross component traversal flag - indicates whether to traverse the graph across connected components.
- setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Sets the cross component traversal flag - indicates whether to traverse the graph across connected components.
- setCrossComponentTraversal(boolean) - Method in class org.jgrapht.traverse.TopologicalOrderIterator
-
Sets the cross component traversal flag - indicates whether to traverse the graph across connected components.
- setCycle(GraphPath<?, ?>) - Method in exception org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Set the negative cycle.
- setDrawableArea(Box2D) - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Set the drawable area of the model.
- setDrawableArea(Box2D) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- setDrawableArea(Box2D) - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- setEdgeSupplier(Supplier<E>) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Set the edge supplier that the graph uses whenever it needs to create new edges.
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Set an edge weight.
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsGraphUnion
-
Throws
UnsupportedOperationException
since graph union is read-only. - setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsSubgraph
-
Assigns a weight to an edge.
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsUnweightedGraph
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.AsWeightedGraph
-
Assigns a weight to an edge.
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Set the weight of an edge
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Assigns a weight to an edge.
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.GraphDelegator
-
Assigns a weight to an edge.
- setEdgeWeight(E, double) - Method in interface org.jgrapht.graph.IntrusiveEdgesSpecifics
-
Set the edge weight
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.MaskSubgraph
-
Assigns a weight to an edge.
- setEdgeWeight(E, double) - Method in interface org.jgrapht.Graph
-
Assigns a weight to an edge.
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
- setEdgeWeight(V, V, double) - Method in interface org.jgrapht.Graph
-
Assigns a weight to an edge between
sourceVertex
andtargetVertex
. - setFair() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with fair mode.
- setFirst(A) - Method in class org.jgrapht.alg.util.Pair
-
Set the first element of the pair.
- setFirst(A) - Method in class org.jgrapht.alg.util.Triple
-
Set the first element
- setFixed(V, boolean) - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Set a point as being a "fixed-point" or not.
- setFixed(V, boolean) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- setFixed(V, boolean) - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- setGraph(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Set the graph
- setGraph(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Set the graph
- setGraph(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Set the graph
- setGraph(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Set the graph
- setMaxFailures(int) - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Sets the maximum allowed number of consecutive failed attempts to add an edge (must be non negative).
- setNonfair() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with non-fair mode.
- setPathLimit(int) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Limits the maximum number of edges in a cycle.
- setReuseEvents(boolean) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
If the
reuseEvents
flag is set totrue
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. - setSecond(B) - Method in class org.jgrapht.alg.util.Pair
-
Set the second element of the pair.
- setSecond(B) - Method in class org.jgrapht.alg.util.Triple
-
Set the second element
- setThird(C) - Method in class org.jgrapht.alg.util.Triple
-
Set the third element
- setValue(int) - Method in class org.jgrapht.util.ModifiableInteger
-
Sets a new value for this modifiable integer.
- setVertexSupplier(Supplier<V>) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Set the vertex supplier that the graph uses whenever it needs to create new vertices.
- setVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- setVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- setVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- setVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- setVisited(int) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy
-
Mark the given topological index as visited.
- setWeight(double) - Method in class org.jgrapht.graph.GraphWalk
-
Updates the weight of this walk
- ShortestPathAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes shortest paths between vertices.
- ShortestPathAlgorithm.SingleSourcePaths<V,E> - Interface in org.jgrapht.alg.interfaces
-
A set of paths starting from a single source vertex.
- sides - Variable in class org.jgrapht.alg.drawing.model.Box2D
-
The side lengths
- simple() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A simple graph type.
- simpleCycleToGraphPath(Graph<V, E>, List<E>) - Static method in class org.jgrapht.alg.cycle.Cycles
-
Transform a simple cycle from an edge set representation to a graph 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 graph.
- SimpleDirectedGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.SimpleDirectedGraph
-
Creates a new graph.
- SimpleDirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
-
A simple directed weighted graph.
- SimpleDirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Creates a new graph.
- SimpleDirectedWeightedGraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Creates a new graph.
- SimpleGraph<V,E> - Class in org.jgrapht.graph
-
Implementation of a Simple Graph.
- SimpleGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleGraph
-
Creates a new simple graph.
- SimpleGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.SimpleGraph
-
Creates a new simple graph.
- SimpleWeightedBipartiteGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate
-
A simple weighted bipartite graph matrix generator.
- SimpleWeightedBipartiteGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
- SimpleWeightedGraph<V,E> - Class in org.jgrapht.graph
-
A simple weighted graph.
- SimpleWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
-
Creates a new simple weighted graph.
- SimpleWeightedGraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.SimpleWeightedGraph
-
Creates a new simple weighted graph.
- SimpleWeightedGraphMatrixGenerator<V,E> - Class in org.jgrapht.generate
-
A simple weighted graph matrix generator.
- SimpleWeightedGraphMatrixGenerator() - Constructor for class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- singletonWalk(Graph<V, E>, V) - Static method in class org.jgrapht.graph.GraphWalk
-
Convenience method which creates a walk consisting of a single vertex with weight 0.0.
- singletonWalk(Graph<V, E>, V, double) - Static method in class org.jgrapht.graph.GraphWalk
-
Convenience method which creates a walk consisting of a single vertex.
- sink - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- sinkPartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- size() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Returns the number of items in the queue.
- size() - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the total number of elements in this data structure.
- size() - Method in class org.jgrapht.util.DoublyLinkedList
- size() - Method in class org.jgrapht.util.UnmodifiableUnionSet
-
Since the view is live, this operation is no longer a constant time operation.
- size() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- SmallestDegreeLastColoring<V,E> - Class in org.jgrapht.alg.color
-
The smallest degree last greedy coloring algorithm.
- SmallestDegreeLastColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.SmallestDegreeLastColoring
-
Construct a new coloring algorithm.
- sort(List<Integer>) - Static method in class org.jgrapht.util.RadixSort
-
Sort the given list in ascending order.
- source - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- source - Variable in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
-
The source vertex of all paths
- source - Variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
The source vertex of all paths
- source - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
The source vertex
- sourceNode - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- sourcePartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- SpannerAlgorithm<E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a graph spanner of a given graph.
- SpannerAlgorithm.Spanner<E> - Interface in org.jgrapht.alg.interfaces
-
A graph spanner.
- SpannerAlgorithm.SpannerImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the spanner interface.
- SpannerImpl(Set<E>) - Constructor for class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
-
Construct a new spanner
- SpannerImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
-
Construct a new spanner
- SpanningTreeAlgorithm<E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a spanning tree of a given connected graph.
- SpanningTreeAlgorithm.SpanningTree<E> - Interface in org.jgrapht.alg.interfaces
-
A spanning tree.
- SpanningTreeAlgorithm.SpanningTreeImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the spanning tree interface.
- SpanningTreeImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
-
Construct a new spanning tree.
- SparseEdmondsMaximumCardinalityMatching<V,E> - Class in org.jgrapht.alg.matching
-
Edmonds' blossom algorithm for maximum cardinality matching in general undirected graphs.
- SparseEdmondsMaximumCardinalityMatching(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
-
Constructs a new instance of the algorithm.
- SparseEdmondsMaximumCardinalityMatching(Graph<V, E>, MatchingAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
-
Constructs a new instance of the algorithm.
- Specifics<V,E> - Interface in org.jgrapht.graph.specifics
-
An interface encapsulating the basic graph operations.
- splitAlongXAxis(Box2D) - Static method in class org.jgrapht.alg.drawing.model.Boxes
-
Split a box along the x axis into two equal boxes.
- splitAlongYAxis(Box2D) - Static method in class org.jgrapht.alg.drawing.model.Boxes
-
Split a box along the y axis into two equal boxes.
- StackBFSFundamentalCycleBasis<V,E> - Class in org.jgrapht.alg.cycle
-
Generate a set of fundamental cycles by building a spanning tree (forest) using an implementation of BFS using a LIFO Stack.
- StackBFSFundamentalCycleBasis(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.StackBFSFundamentalCycleBasis
-
Constructor
- STAR - Variable in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Key used to access the star polygon vertices in the resultMap
- StarGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a star graph of any size.
- StarGraphGenerator(int) - Constructor for class org.jgrapht.generate.StarGraphGenerator
-
Creates a new StarGraphGenerator object.
- START_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the first vertex generated.
- startVertex - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- startVertex - Variable in class org.jgrapht.graph.GraphWalk
- Statistics() - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- StoerWagnerMinimumCut<V,E> - Class in org.jgrapht.alg
-
Implements the Stoer and Wagner minimum cut algorithm.
- StoerWagnerMinimumCut(Graph<V, E>) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut
-
Will compute the minimum cut in graph.
- StoerWagnerMinimumCut.VertexAndWeight - Class in org.jgrapht.alg
-
Class for weighted vertices
- StrongConnectivityAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
A strong connectivity inspector algorithm.
- stronglyConnectedSets() - Method in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- stronglyConnectedSets() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
- stronglyConnectedSets() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Computes a
List
ofSet
s, where each set contains vertices which together form a strongly connected component within the given graph. - subtract(Point2D, Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Subtract 2-dimensional vectors
- successorListOf(Graph<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.util.NeighborCache
-
Returns the unique successors of the given vertex if it exists in the cache, otherwise it is initialized.
- SUM - Static variable in interface org.jgrapht.util.WeightCombiner
-
Sum of weights.
- SupplierUtil - Class in org.jgrapht.util
-
Helper class for suppliers.
- SupplierUtil() - Constructor for class org.jgrapht.util.SupplierUtil
- SuurballeKDisjointShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of Suurballe algorithm for finding K edge-disjoint shortest paths.
- SuurballeKDisjointShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths
-
Creates a new instance of the algorithm.
- 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(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Create a simple cycle finder for the specified graph.
T
- targetNode - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- TarjanLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Tarjan's offline algorithm for computing lowest common ancestors in rooted trees and forests.
- TarjanLCAFinder(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.lca.TarjanLCAFinder
-
Construct a new instance of the algorithm.
- TarjanLCAFinder(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.lca.TarjanLCAFinder
-
Construct a new instance of the algorithm.
- 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(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Create a simple cycle finder for the specified graph.
- temperature(int, int) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D.InverseLinearTemperatureModel
- temperature(int, int) - Method in interface org.jgrapht.alg.drawing.FRLayoutAlgorithm2D.TemperatureModel
-
Return the temperature for the new iteration
- temperatureModelSupplier - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- testIncidence(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
-
Tests whether an edge is incident to a vertex.
- testOptimality() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Performs an optimality test after the perfect matching is computed.
- testOptimality() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Performs an optimality test after the perfect matching is computed.
- testOptimality(double) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Tests the optimality conditions after a flow of minimum cost has been computed.
- theta - Variable in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
- third - Variable in class org.jgrapht.alg.util.Triple
-
The third element
- thomsenGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- 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(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Create a simple cycle finder for the specified graph.
- tietzeGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- toArray() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- toArray(T[]) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- toInteger() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns an
Integer
object representing thisModifiableInteger
's value. - TOLERANCE_DEFAULT - Static variable in class org.jgrapht.alg.scoring.AlphaCentrality
-
Default value for the tolerance.
- TOLERANCE_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Default value for the tolerance.
- ToleranceDoubleComparator - Class in org.jgrapht.alg.util
-
A double comparator with adjustable tolerance.
- ToleranceDoubleComparator() - Constructor for class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Construct a new comparator with a
ToleranceDoubleComparator.DEFAULT_EPSILON
tolerance. - ToleranceDoubleComparator(double) - Constructor for class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Construct a new comparator with a specified tolerance.
- TooManyFailuresException - Exception in org.jgrapht.generate
-
Raised when the generator fails, too many times in a row, to grow a graph.
- TooManyFailuresException() - Constructor for exception org.jgrapht.generate.TooManyFailuresException
-
Constructs a new too many failures Exception with null as its detail message.
- TooManyFailuresException(String) - Constructor for exception org.jgrapht.generate.TooManyFailuresException
-
Constructs a new exception with the specified detail message.
- TooManyFailuresException(String, Throwable) - Constructor for exception org.jgrapht.generate.TooManyFailuresException
-
Constructs a new too Many Failures exception with the specified detail message and cause.
- TopologicalOrderIterator<V,E> - Class in org.jgrapht.traverse
-
A topological ordering iterator for a directed acyclic graph.
- TopologicalOrderIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
-
Construct a topological order iterator.
- TopologicalOrderIterator(Graph<V, E>, Comparator<V>) - Constructor for class org.jgrapht.traverse.TopologicalOrderIterator
-
Construct a topological order iterator.
- TopoVertexBiMap() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
-
Constructor
- TopoVertexMap() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
-
Constructor
- toString() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- toString() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- toString() - Method in class org.jgrapht.alg.drawing.model.Box2D
- toString() - Method in class org.jgrapht.alg.drawing.model.Point2D
- toString() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- toString() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- toString() - Method in class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
- toString() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- toString() - Method in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
- toString() - Method in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
- toString() - Method in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
- toString() - Method in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
- toString() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- toString() - Method in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- toString() - Method in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
- toString() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- toString() - Method in enum org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
-
Returns the name of the dual updates strategy
- toString() - Method in enum org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
-
Returns the name of the initialization type
- toString() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
- toString() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
- toString() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- toString() - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- toString() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Returns a textual representation of the queue.
- toString() - Method in class org.jgrapht.alg.util.Pair
- toString() - Method in class org.jgrapht.alg.util.Triple
- toString() - Method in class org.jgrapht.alg.util.UnionFind
-
Returns a string representation of this data structure.
- toString() - Method in class org.jgrapht.alg.util.UnorderedPair
- toString() - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
- toString() - Method in class org.jgrapht.graph.AbstractGraph
-
Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
- toString() - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
- toString() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
- toString() - Method in class org.jgrapht.graph.DefaultEdge
- toString() - Method in class org.jgrapht.graph.DefaultGraphType
- toString() - Method in class org.jgrapht.graph.DefaultWeightedEdge
- toString() - Method in class org.jgrapht.graph.EdgeReversedGraph
- toString() - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a string of the parenthesized pair (V, E) representing this G=(V,E) graph.
- toString() - Method in class org.jgrapht.graph.GraphWalk
- toString() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns a
String
object representing thisModifiableInteger
's value. - toStringFromSets(Collection<? extends V>, Collection<? extends E>, boolean) - Method in class org.jgrapht.graph.AbstractGraph
-
Helper for subclass implementations of toString( ).
- touchingVerticesToEdgeMap - Variable in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
-
Maps a pair of vertices <u,v> to a set of edges {(u,v)}.
- touchingVerticesToEdgeMap - Variable in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
-
Maps a pair of vertices <u,v> to a set of edges {(u,v)}.
- transformGraph(List<E>) - Method in class org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths
- transformGraph(List<E>) - Method in class org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths
- TransitiveClosure - Class in org.jgrapht.alg
-
Constructs the transitive closure of the input graph.
- TransitiveReduction - Class in org.jgrapht.alg
-
An implementation of Harry Hsu's transitive reduction algorithm.
- TraversalListener<V,E> - Interface in org.jgrapht.event
-
A listener on graph iterator or on a graph traverser.
- TraversalListenerAdapter<V,E> - Class in org.jgrapht.event
-
An empty do-nothing implementation of the
TraversalListener
interface used for subclasses. - TraversalListenerAdapter() - Constructor for class org.jgrapht.event.TraversalListenerAdapter
- TreeMeasurer<V,E> - Class in org.jgrapht.alg.shortestpath
-
Algorithm class which computes a number of distance related metrics for trees.
- TreeMeasurer(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.TreeMeasurer
-
Constructs a new instance of TreeMeasurer.
- TreeSingleSourcePathsImpl<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of
ShortestPathAlgorithm.SingleSourcePaths
which uses linear space. - TreeSingleSourcePathsImpl(Graph<V, E>, V, Map<V, Pair<Double, E>>) - Constructor for class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Construct a new instance.
- TreeToPathDecompositionAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a decomposition into disjoint paths for a given tree/forest
- TreeToPathDecompositionAlgorithm.PathDecomposition<V,E> - Interface in org.jgrapht.alg.interfaces
-
A path decomposition.
- TreeToPathDecompositionAlgorithm.PathDecompositionImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the path decomposition interface.
- Triple<A,B,C> - Class in org.jgrapht.alg.util
-
Generic triple (3-tuple).
- Triple(A, B, C) - Constructor for class org.jgrapht.alg.util.Triple
-
Create a new triple
- tutteGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- TwoApproxMetricTSP<V,E> - Class in org.jgrapht.alg.tour
-
A 2-approximation algorithm for the metric TSP problem.
- TwoApproxMetricTSP() - Constructor for class org.jgrapht.alg.tour.TwoApproxMetricTSP
-
Construct a new instance
- TwoOptHeuristicTSP<V,E> - Class in org.jgrapht.alg.tour
-
The 2-opt heuristic algorithm for the TSP problem.
- TwoOptHeuristicTSP() - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor.
- TwoOptHeuristicTSP(int) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- TwoOptHeuristicTSP(int, long) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- TwoOptHeuristicTSP(int, Random) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- TwoOptHeuristicTSP(int, Random, double) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- TwoOptHeuristicTSP(int, HamiltonianCycleAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- TwoOptHeuristicTSP(int, HamiltonianCycleAlgorithm<V, E>, double) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- TwoOptHeuristicTSP(HamiltonianCycleAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Constructor
- type - Variable in class org.jgrapht.event.GraphChangeEvent
-
The type of graph change this event indicates.
- TypeUtil - Class in org.jgrapht.util
-
TypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay warning-free.
- TypeUtil() - Constructor for class org.jgrapht.util.TypeUtil
U
- uncheckedCast(Object) - Static method in class org.jgrapht.util.TypeUtil
-
Casts an object to a type.
- undirected() - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder for an undirected graph.
- undirected() - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set the type as undirected.
- UndirectedEdgeContainer<V,E> - Class in org.jgrapht.graph.specifics
-
A container for vertex edges.
- undirectedGraph(Graph<V, E>) - Static method in class org.jgrapht.Graphs
-
Returns an undirected view of the specified graph.
- UndirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics
-
Plain implementation of UndirectedSpecifics.
- UndirectedSpecifics(Graph<V, E>, Map<V, UndirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Construct a new undirected specifics.
- UniformIntrusiveEdgesSpecifics<V,E> - Class in org.jgrapht.graph
-
An uniform weights variant of the intrusive edges specifics.
- UniformIntrusiveEdgesSpecifics(Map<E, IntrusiveEdge>) - Constructor for class org.jgrapht.graph.UniformIntrusiveEdgesSpecifics
-
Constructor
- union(T, T) - Method in class org.jgrapht.alg.util.UnionFind
-
Merges the sets which contain element1 and element2.
- UnionFind<T> - Class in org.jgrapht.alg.util
-
An implementation of Union Find data structure.
- UnionFind(Set<T>) - Constructor for class org.jgrapht.alg.util.UnionFind
-
Creates a UnionFind instance with all the elements in separate sets.
- unlink(HierholzerEulerianCycle.EdgeNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Unlink an edge from the adjacency lists of its end-points.
- unlink(HierholzerEulerianCycle.VertexNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Unlink a vertex from the vertex list.
- unmodifiableEdgeSet - Variable in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- UnmodifiableUnionSet<E> - Class in org.jgrapht.util
-
An unmodifiable live view of the union of two sets.
- UnmodifiableUnionSet(Set<E>, Set<E>) - Constructor for class org.jgrapht.util.UnmodifiableUnionSet
-
Constructs a new set.
- UnorderedPair<A,B> - Class in org.jgrapht.alg.util
-
Generic unordered pair.
- UnorderedPair(A, B) - Constructor for class org.jgrapht.alg.util.UnorderedPair
-
Create a new unordered pair
- unpackBackward(ContractionHierarchyPrecomputation.ContractionEdge<E>, LinkedList<V>, LinkedList<E>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Unpacks
edge
by recursively going from target to source. - unpackForward(ContractionHierarchyPrecomputation.ContractionEdge<E>, LinkedList<V>, LinkedList<E>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Unpacks
edge
by recursively going from source to target. - updateGraphAndInsertLocations(Pair<HierholzerEulerianCycle.EdgeNode, HierholzerEulerianCycle.EdgeNode>, HierholzerEulerianCycle.VertexNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Iterate over the partial cycle to remove vertices with zero degrees and compute new insert locations for vertices with non-zero degrees.
- USE_GAP_RELABELING_HEURISTIC - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- USE_GLOBAL_RELABELING_HEURISTIC - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
V
- v - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- v - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
original vertex
- value - Variable in class org.jgrapht.util.ModifiableInteger
-
The int value represented by this
ModifiableInteger
. - valueOf(String) - Static method in enum org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum org.jgrapht.generate.WindmillGraphsGenerator.Mode
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Returns the enum constant of this type with the specified name.
- values() - Static method in enum org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum org.jgrapht.generate.WindmillGraphsGenerator.Mode
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Returns an array containing the constants of this enum type, in the order they are declared.
- verify() - Method in class org.jgrapht.graph.GraphWalk
-
Convenience method which verifies whether the given path is feasible wrt the input graph and forms an actual path.
- vertex - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- vertex - Variable in class org.jgrapht.event.GraphVertexChangeEvent
-
The vertex that this event is related to.
- vertex - Variable in class org.jgrapht.event.VertexTraversalEvent
-
The traversed vertex.
- VERTEX_ADDED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
-
Vertex added event.
- VERTEX_REMOVED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
-
Vertex removed event.
- vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.util.NeighborCache
- vertexAdded(GraphVertexChangeEvent<V>) - Method in interface org.jgrapht.event.VertexSetListener
-
Notifies that a vertex has been added to the graph.
- VertexAndWeight(Set<V>, double, boolean) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
Construct a new weighted vertex.
- vertexClass(Class<V1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the vertex class.
- VertexColoringAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a graph vertex coloring.
- VertexColoringAlgorithm.Coloring<V> - Interface in org.jgrapht.alg.interfaces
-
A coloring.
- VertexColoringAlgorithm.ColoringImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the coloring interface.
- vertexComparator - Variable in class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
- vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- VertexCoverAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Computes a (weighted) vertex cover in an undirected graph.
- VertexCoverAlgorithm.VertexCover<V> - Interface in org.jgrapht.alg.interfaces
- VertexCoverAlgorithm.VertexCoverImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of a (weighted) vertex cover
- VertexCoverImpl(Set<V>) - Constructor for class org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCoverImpl
- VertexCoverImpl(Set<V>, double) - Constructor for class org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCoverImpl
- VertexDegreeComparator<V,E> - Class in org.jgrapht.alg.util
-
Compares two vertices based on their degree.
- VertexDegreeComparator(Graph<V, E>) - Constructor for class org.jgrapht.alg.util.VertexDegreeComparator
-
Creates a comparator for comparing the degrees of vertices in the specified graph.
- VertexDegreeComparator(Graph<V, E>, VertexDegreeComparator.Order) - Constructor for class org.jgrapht.alg.util.VertexDegreeComparator
-
Creates a comparator for comparing the degrees of vertices in the specified graph.
- VertexDegreeComparator.Order - Enum in org.jgrapht.alg.util
-
Order in which we sort the vertices: ascending vertex degree or descending vertex degree
- VertexExtension() - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- vertexExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- vertexFinished(VertexTraversalEvent<V>) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform the listener that the specified vertex have been finished during the graph traversal.
- vertexFinished(VertexTraversalEvent<V>) - Method in class org.jgrapht.event.TraversalListenerAdapter
- vertexHasPredecessors(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Check if a vertex has any direct predecessors.
- vertexHasSuccessors(Graph<V, E>, V) - Static method in class org.jgrapht.Graphs
-
Check if a vertex has any direct successors.
- vertexList - Variable in class org.jgrapht.graph.GraphWalk
- vertexListToTour(List<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Transform from a List representation to a graph path.
- vertexMap - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
- vertexMap - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
- vertexMask - Variable in class org.jgrapht.graph.MaskSubgraph
- VertexNode(HierholzerEulerianCycle.VertexNode, V, HierholzerEulerianCycle.VertexNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
-
Create VertexNode
- vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.alg.util.NeighborCache
- vertexRemoved(GraphVertexChangeEvent<V>) - Method in interface org.jgrapht.event.VertexSetListener
-
Notifies that a vertex has been removed from the graph.
- VertexScoringAlgorithm<V,D> - Interface in org.jgrapht.alg.interfaces
-
An interface for all algorithms which assign scores to vertices of a graph.
- vertexSet - Variable in class org.jgrapht.graph.AsSubgraph
- vertexSet() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in class org.jgrapht.graph.AsSubgraph
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in interface org.jgrapht.Graph
-
Returns a set of the vertices contained in this graph.
- VertexSetListener<V> - Interface in org.jgrapht.event
-
A listener that is notified when the graph's vertex set changes.
- vertexSupplier(Supplier<V1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the vertex supplier.
- vertexToHeapNodeMap - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- VertexToIntegerMapping<V> - Class in org.jgrapht.util
-
Helper class for building a one-to-one mapping for a collection of vertices to the integer range $[0, n)$ where $n$ is the number of vertices in the collection.
- VertexToIntegerMapping(Collection<V>) - Constructor for class org.jgrapht.util.VertexToIntegerMapping
-
Create a new mapping from a collection of vertices.
- VertexToIntegerMapping(List<V>) - Constructor for class org.jgrapht.util.VertexToIntegerMapping
-
Create a new mapping from a list of vertices.
- VertexToIntegerMapping(Set<V>) - Constructor for class org.jgrapht.util.VertexToIntegerMapping
-
Create a new mapping from a set of vertices.
- VertexTraversalEvent<V> - Class in org.jgrapht.event
-
A traversal event for a graph vertex.
- VertexTraversalEvent(Object, V) - Constructor for class org.jgrapht.event.VertexTraversalEvent
-
Creates a new VertexTraversalEvent.
- vertexTraversed(VertexTraversalEvent<V>) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform the listener that the specified vertex have been visited during the graph traversal.
- vertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.event.TraversalListenerAdapter
- vertexWeight(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Compute the sum of the weights entering a vertex
- vertices - Variable in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- vertices - Variable in class org.jgrapht.graph.MaskSubgraph
- vertices(List<V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
-
Set the generator vertices.
- verticesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- VF2AbstractIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
Base implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2SubgraphIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the VF2 algorithm using its feature of detecting subgraph isomorphism between two graphs as described in Cordella et al.
- VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
-
Construct a new VF2 subgraph isomorphism inspector.
- VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
-
Construct a new VF2 subgraph isomorphism inspector.
- VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
-
Construct a new VF2 subgraph isomorphism inspector.
- VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
-
Construct a new VF2 subgraph isomorphism inspector.
- VisitedArrayImpl() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
-
Constructs empty instance
- VisitedArrayImpl(DirectedAcyclicGraph.Region) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
-
Construct an empty instance for a region.
- VisitedArrayListImpl() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
-
Constructor
- VisitedBitSetImpl() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
-
Constructor
- VisitedHashSetImpl() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
-
Constructor
W
- WattsStrogatzGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Watts-Strogatz small-world graph generator.
- WattsStrogatzGraphGenerator(int, int, double) - Constructor for class org.jgrapht.generate.WattsStrogatzGraphGenerator
-
Constructor
- WattsStrogatzGraphGenerator(int, int, double, boolean, Random) - Constructor for class org.jgrapht.generate.WattsStrogatzGraphGenerator
-
Constructor
- WattsStrogatzGraphGenerator(int, int, double, long) - Constructor for class org.jgrapht.generate.WattsStrogatzGraphGenerator
-
Constructor
- WeakChordalityInspector<V,E> - Class in org.jgrapht.alg.cycle
-
Tests whether a graph is weakly chordal.
- WeakChordalityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Creates a weak chordality inspector for the
graph
- weight - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- weight - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
- weight - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
weight of the vertex
- weight - Variable in class org.jgrapht.graph.GraphWalk
- weight - Variable in class org.jgrapht.util.WeightedUnmodifiableSet
- WeightCombiner - Interface in org.jgrapht.util
-
Binary operator for edge weights.
- weighted(boolean) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set whether the graph will be weighted or not.
- weighted(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether the graph will be weighted.
- WeightedIntrusiveEdgesSpecifics<V,E> - Class in org.jgrapht.graph
-
A weighted variant of the intrusive edges specifics.
- WeightedIntrusiveEdgesSpecifics(Map<E, IntrusiveWeightedEdge>) - Constructor for class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
-
Constructor
- WeightedMultigraph<V,E> - Class in org.jgrapht.graph
-
A weighted multigraph.
- WeightedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.WeightedMultigraph
-
Creates a new graph.
- WeightedMultigraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.WeightedMultigraph
-
Creates a new graph.
- WeightedPseudograph<V,E> - Class in org.jgrapht.graph
-
A weighted pseudograph.
- WeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.WeightedPseudograph
-
Creates a new weighted graph.
- WeightedPseudograph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.WeightedPseudograph
-
Creates a new weighted graph.
- WeightedUnmodifiableSet<E> - Class in org.jgrapht.util
-
Implementation of a weighted, unmodifiable set.
- WeightedUnmodifiableSet(Set<E>) - Constructor for class org.jgrapht.util.WeightedUnmodifiableSet
-
Constructs a WeightedUnmodifiableSet instance
- WeightedUnmodifiableSet(Set<E>, double) - Constructor for class org.jgrapht.util.WeightedUnmodifiableSet
-
Constructs a WeightedUnmodifiableSet instance
- weights - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
- weights - Variable in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- weights(double[][]) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
Set the weights of the generator.
- weights(double[][]) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
-
Set the weights of the generator.
- WheelGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a wheel graph of any size.
- WheelGraphGenerator(int) - Constructor for class org.jgrapht.generate.WheelGraphGenerator
-
Creates a new WheelGraphGenerator object.
- WheelGraphGenerator(int, boolean) - Constructor for class org.jgrapht.generate.WheelGraphGenerator
-
Construct a new WheelGraphGenerator.
- WHITE - org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has not been returned via iterator yet.
- WINDMILL - org.jgrapht.generate.WindmillGraphsGenerator.Mode
- WindmillGraphsGenerator<V,E> - Class in org.jgrapht.generate
- WindmillGraphsGenerator(WindmillGraphsGenerator.Mode, int, int) - Constructor for class org.jgrapht.generate.WindmillGraphsGenerator
-
Constructs a GeneralizedPetersenGraphGenerator used to generate a Generalized Petersen graphs $GP(n,k)$.
- WindmillGraphsGenerator.Mode - Enum in org.jgrapht.generate
-
WINDMILL and DUTCHWINDMILL Modes for the Constructor
X
Y
- y - Variable in class org.jgrapht.alg.drawing.model.Point2D
- YenKShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
Implementation of Yen`s algorithm for finding $k$ shortest loopless paths.
- YenKShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.YenKShortestPath
-
Constructs an instance of the algorithm for the given
graph
. - YenShortestPathIterator<V,E> - Class in org.jgrapht.alg.shortestpath
-
Iterator over the shortest loopless paths between two vertices in a graph sorted by weight.
- YenShortestPathIterator(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Constructs an instance of the algorithm for given
graph
,source
andsink
. - YenShortestPathIterator(Graph<V, E>, V, V, Supplier<AddressableHeap<Double, GraphPath<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Constructs an instance of the algorithm for given
graph
,source
,sink
andheapSupplier
.
All Classes All Packages