Index
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form
A
- a - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D.InverseLinearTemperatureModel
- a - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
- 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, - Class in org.jgrapht.graph.builderG, B> -
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
- AbstractGraphIterator.FlyweightEdgeEvent<E> - Class in org.jgrapht.traverse
-
A reusable edge event.
- AbstractGraphIterator.FlyweightVertexEvent<V> - Class in org.jgrapht.traverse
-
A reusable vertex event.
- AbstractImmutableBigGraphAdapter<E> - Class in org.jgrapht.webgraph
-
An abstract base class for adapters using WebGraph (big)'s
ImmutableGraph
. - AbstractImmutableBigGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- AbstractImmutableGraphAdapter<E> - Class in org.jgrapht.webgraph
-
An abstract base class for adapters using WebGraph's
ImmutableGraph
. - AbstractImmutableGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- AbstractSparseSpecificsGraph<S> - Class in org.jgrapht.opt.graph.sparse.specifics
-
Helper class to ease the implementation of different sparse graphs with different backends.
- AbstractSparseSpecificsGraph(Supplier<S>) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
-
Constructor
- AbstractStrongConnectivityInspector<V,
E> - Class in org.jgrapht.alg.connectivity -
Base implementation of the strongly connected components algorithm.
- AbstractStrongConnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- AbstractSuccinctDirectedGraph<E> - Class in org.jgrapht.sux4j
-
An abstract base class for all succinct directed implementations.
- AbstractSuccinctDirectedGraph(int, int) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph
- AbstractSuccinctDirectedGraph.CumulativeDegrees - Class in org.jgrapht.sux4j
-
Iterates over the cumulative degrees (starts with a zero).
- AbstractSuccinctDirectedGraph.CumulativeSuccessors<E> - Class in org.jgrapht.sux4j
-
Turns all edges x → y into a monotone sequence using the encoding x2⌈log n⌉ + y, or the encoding xn + y - e, where e is the index of the edge in lexicographical order, depending on the value of the
strict
parameter. - AbstractSuccinctGraph<E> - Class in org.jgrapht.sux4j
-
An abstract base class for all succinct implementations.
- AbstractSuccinctGraph(int, int) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctGraph
- AbstractSuccinctUndirectedGraph<E> - Class in org.jgrapht.sux4j
-
An abstract base class for all succinct undirected implementations.
- AbstractSuccinctUndirectedGraph(int, int) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph
- AbstractSuccinctUndirectedGraph.CumulativeDegrees<E> - Class in org.jgrapht.sux4j
-
Iterates over the cumulative degrees (starts with a zero).
- AbstractSuccinctUndirectedGraph.CumulativeSuccessors<E> - Class in org.jgrapht.sux4j
-
Turns all edges x — y, x ≤ y, into a monotone sequence using the encoding x2⌈log n⌉ + y, or all edges x — y, x ≥ y, using the encoding xn + y - e, where e is the index of the edge in lexicographical order, depending on the value of the
sorted
parameter. - accept(ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ToListConsumer
- accept(ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ToStatisticsConsumer
- AccessVertex(V, GraphPath<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex
-
Constructs a new instance for the given
vertex
andpath
. - accessVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Forward and backward access vertices for every vertex in the contraction graph.
- accessVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Stores access vertices for each vertex in the
graph
. - AccessVertices(List<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>>, List<List<TransitNodeRoutingPrecomputation.AccessVertex<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertices
-
Constructs a new instance for the given
forwardAccessVertices
andbackwardAccessVertices
. - accessVerticesBuilder - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
-
Builder object for a
AccessVertices
instance. - AccessVerticesBuilder(int) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
Constructs an instance for the given
numberOfVertices
. - accumulate(Map<V, List<E>>, Map<V, Long>) - Method in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.Algorithm
- accumulatedEps - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Accumulated dual change.
- Action() - Constructor for enum class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer.Action
- active - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
If this vertex is in the active vertex list.
- active - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- active - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- activeVertices - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
The queue of active vertices.
- activeVertices - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- AdamicAdarIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Adamic-Adar Index.
- AdamicAdarIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.AdamicAdarIndexLinkPrediction
-
Create a new prediction
- add(int, E) - Method in class org.jgrapht.util.DoublyLinkedList
- add(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- add(E) - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- 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
- add(T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Adds an
element
to this data structure. - addAll(Collection<? extends E>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- 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.
- addAllRemainingArcs() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates remaining arcs to satisfy the arcNum constraint.
- 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.
- addArc(NetworkGenerator.Node, NetworkGenerator.Node) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Adds a simple arc to the network.
- addArcAfter(TreeDynamicConnectivity.Arc, TreeDynamicConnectivity.Arc) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Inserts the
newArc
in the arc list after thearc
- addArcLast(TreeDynamicConnectivity.Arc) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Append the
arc
to the arc list - addArcTo(CapacityScalingMinimumCostFlow.Node, int, double) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Adds a new arc with
capacity
,cost
to theopposite
. - addBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
Computes a list of backward access vertices for
v
usingvertices
and adds them to thebackwardAccessVertices
. - addBackwardVisitedVoronoiCells(ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<Integer>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilterBuilder
-
Adds
visitedVoronoiCells
to this builder in the backward direction forvertex
. - addBoundaryEdges(Set<BoyerMyrvoldPlanarityInspector.Edge>, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Adds the edges on the outer face of the component rooted at
componentRoot
to the setedges
- addChild(BlossomVNode, BlossomVEdge, boolean) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Appends the
child
to the end of the linked list of children of this node. - addCrossEdges() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Adds cross edges for every vertex $v$ reachable from the root of balanced heap of
source
in the paths graph. - addCycle(Graph<V, E>, int[]) - Method in class org.jgrapht.generate.NamedGraphGenerator
- addDeviations(GraphPath<V, E>) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Builds unique loopless deviations from the given path in the
graph
. - addedContractionEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexStatistics
-
Number of edges added to the
contractionGraph
in case this vertex is contracted. - addEdge(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Add a vertex edge
- addEdge(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- addEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- addEdge(Integer, Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- addEdge(Integer, Integer, E) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- addEdge(Integer, Integer, E) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- addEdge(Integer, Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- addEdge(Long, Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- addEdge(Long, Long, E) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- addEdge(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, E) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Add an edge to the index.
- addEdge(BlossomVEdge, int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Insert the
edge
into linked list of incident edges of this node in the specified directiondir
- addEdge(BlossomVNode, BlossomVNode, double, int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Adds a new edge between
from
andto
. - addEdge(Graph<V, E>, int, int) - Method in class org.jgrapht.generate.NamedGraphGenerator
- 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.concurrent.AsSynchronizedGraph.CacheAccess
-
Add an edge into AsSynchronizedGraph's backing graph.
- addEdge(V, V) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Add an edge into AsSynchronizedGraph's backing graph.
- addEdge(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Add an edge into AsSynchronizedGraph's backing graph.
- 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.guava.ImmutableGraphAdapter
- addEdge(V, V) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- addEdge(V, V) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- addEdge(V, V) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- addEdge(V, V) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- addEdge(V, V) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- 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, EndpointPair<V>) - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- addEdge(V, V, EndpointPair<V>) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- addEdge(V, V, EndpointPair<V>) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, EndpointPair<V>) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in interface org.jgrapht.Graph
-
Adds the specified edge to this graph, going from the source vertex to the target vertex.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.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.concurrent.AsSynchronizedGraph.CacheAccess
-
Add an edge into AsSynchronizedGraph's backing graph.
- addEdge(V, V, E) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Add an edge into AsSynchronizedGraph's backing graph.
- addEdge(V, V, E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Add an edge into AsSynchronizedGraph's backing graph.
- 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.guava.ImmutableNetworkAdapter
- addEdge(V, V, E) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- 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.
- addEdgeAttributeConsumer(BiConsumer<Pair<E, String>, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add an edge attribute consumer.
- addEdgeAttributeConsumer(BiConsumer<Pair<E, String>, Attribute>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add an edge attribute consumer.
- addEdgeChain(V, V, V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds a chain of edges to the graph being built.
- addEdgeConsumer(Consumer<E>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add an edge consumer.
- addEdgeConsumer(Consumer<E>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add an edge consumer.
- addEdgeCountConsumer(Consumer<Integer>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add an edge count consumer.
- addEdgeCountConsumer(Consumer<Integer>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add an edge count consumer.
- 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
- addEdgeWithAttributesConsumer(BiConsumer<E, Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add an edge with attributes consumer.
- addEdgeWithAttributesConsumer(BiConsumer<E, Map<String, Attribute>>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add an edge with attributes consumer.
- 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. - addedOriginalEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexStatistics
-
Sum of the complexities of edges added to the
contractionGraph
in case this vertex is contracted. - addedVertex1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- addElement(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Adds a new element to the data structure in its own set.
- 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.
- addExtension(EppsteinShortestPathIterator.EppsteinGraphPath, EppsteinShortestPathIterator.PathsGraphVertex, double) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Adds an extension of
paths
withextendingVertex
being its last element. - addFirst(E) - Method in class org.jgrapht.util.DoublyLinkedList
- addForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
Computes a list of forward access vertices for
v
usingvertices
and adds them to theforwardAccessVertices
. - addForwardVisitedVoronoiCells(ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<Integer>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilterBuilder
-
Adds
visitedVoronoiCells
to this builder in the forward direction forvertex
. - 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.
- addGraphAttributeConsumer(BiConsumer<String, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add a graph attribute consumer.
- addGraphAttributeConsumer(BiConsumer<String, Attribute>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add a graph attribute consumer.
- 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.
- addId(String) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- addIfAbsent(T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Adds the
element
to this data structure if it is not already present - addImportEventConsumer(Consumer<ImportEvent>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add an ImportEvent consumer.
- addImportEventConsumer(Consumer<ImportEvent>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add an ImportEvent consumer.
- 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.
- addInsteadOfRewire - Variable in class org.jgrapht.generate.WattsStrogatzGraphGenerator
- addIntrusiveEdge(E, V, V, IE) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- 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.
- addListNode(DoublyLinkedList.ListNodeImpl<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Adds the given
DoublyLinkedList.ListNode
to thisList
. - addLowerBound(Function<K, Integer>) - Method in class org.jgrapht.generate.netgen.Distributor
-
Adds a lower bound function.
- addMax(T) - Method in class org.jgrapht.util.AVLTree
-
Adds
value
as a maximum element to this tree. - addMaxNode(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Adds the
newMax
as a maximum node to this tree. - addMin(T) - Method in class org.jgrapht.util.AVLTree
-
Adds the
value
as a minimum element to this tree - addMinNode(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Adds the
newMin
as a minimum node to this tree - addMinusBlossom(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Ensures correct addition of a blossom to the heap
- addNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Add a neighbor.
- addNeighbor(V) - Method in class org.jgrapht.alg.util.NeighborCache.Neighbors
- 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. - addOneEdgeExtension(EppsteinShortestPathIterator.EppsteinGraphPath) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Adds all one-edge extension of the
path
wrt the paths graph. - 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.
- addPair() - Method in class org.jgrapht.alg.isomorphism.VF2State
-
adds the pair to the current matching.
- addPathEdges(Set<BoyerMyrvoldPlanarityInspector.Edge>, BoyerMyrvoldPlanarityInspector.Edge, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Adds the edges on the path from the
startEdge
up to the nodestop
to the setedges
- addPathEdges(Set<BoyerMyrvoldPlanarityInspector.Edge>, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Adds the edges between the
start
and theend
to the setedges
- addPathGraphRoot() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Creates the root vertex $r$ of the paths graph and connects it to the root of the balanced heap of
source
. - addPlusInfinityEdge(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Ensures correct addition of an edge to the heap
- addPlusPlusEdge(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Ensures correct addition of an edge to the heap
- addPlusPlusEdge(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Adds
edge
to the heap of (+, +) cross-tree edges. - addSetRemaining(Iterator<V>) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Adds all remaining vertices to the
DeltaSteppingShortestPath.verticesQueue
provided by theiterator
. - addSetsRemaining(Iterator<Set<V>>) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Adds all remaining vertices to the
DeltaSteppingShortestPath.verticesQueue
that are contained in the sets provided by thesetIterator
. - addSetsVertices(Iterator<Set<V>>, int) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Adds
numOfVertices
vertices to theDeltaSteppingShortestPath.verticesQueue
that are contained in the sets provided by thesetIterator
. - addSetVertices(Iterator<V>, int) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Adds
numOfVertices
vertices to theDeltaSteppingShortestPath.verticesQueue
provided by theiterator
. - addSkeletonArc(NetworkGenerator.Node, NetworkGenerator.Node, NetworkGenerator.Node) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Adds an arc between the
tail
andhead
. - addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
- addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- addSpannerEdge(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
- addToBucket(V, int) - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Adds the
vertex
to the bucket with the givencardinality
. - addToCurrentMinusPlusHeap(BlossomVEdge, int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Adds
edge
to the heap of (-, +) cross-tree edges. - addToCurrentPlusMinusHeap(BlossomVEdge, int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Adds
edge
to the heap of (+, -) cross-tree edges. - addToHead(AddressableHeap<Double, BlossomVEdge>, BlossomVNode, BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Adds "best edges" to the
heap
- 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.
- addToListenerList(List<L>, L) - Static method in class org.jgrapht.graph.DefaultListenableGraph
- addToReach(Integer, V, HashMap<Integer, HashSet<V>>) - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Add a vertex to reach.
- 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.
- addTreeEdge(BlossomVTree, BlossomVTree) - Static method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Adds a new tree edge from
from
toto
. - addUnseenChildrenOf(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
- addUpperBound(Function<K, Integer>) - Method in class org.jgrapht.generate.netgen.Distributor
-
Adds an upper bounding function.
- 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.AsUnmodifiableGraph
- addVertex() - Method in class org.jgrapht.graph.DefaultListenableGraph
- 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.guava.ImmutableGraphAdapter
- addVertex() - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- addVertex() - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- addVertex() - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- addVertex() - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- addVertex() - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- addVertex() - Method in class org.jgrapht.graph.MaskSubgraph
-
Creates a new vertex in this graph and returns it.
- addVertex() - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- addVertex() - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- addVertex() - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- addVertex() - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- addVertex(int, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Add a vertex in the vertex cover.
- addVertex(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- addVertex(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- addVertex(Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- addVertex(Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- addVertex(String) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- addVertex(String) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- addVertex(Graph<V, E>, int) - Method in class org.jgrapht.generate.NamedGraphGenerator
- 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.guava.ImmutableGraphAdapter
- addVertex(V) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- addVertex(V) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- addVertex(V) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- addVertex(V) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- addVertex(V) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- addVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.ParanoidGraph
-
Adds the specified vertex to this graph if not already present.
- addVertex(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Adds a vertex.
- addVertex(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Adds a vertex.
- addVertex(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Adds a vertex.
- addVertex(V) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Adds the
vertex
to this bucket. - addVertex(V, double, int) - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
Adds a vertex to the path
- addVertex1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- addVertex2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- addVertexAttributeConsumer(BiConsumer<Pair<V, String>, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add a vertex attribute consumer.
- addVertexAttributeConsumer(BiConsumer<Pair<V, String>, Attribute>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add a vertex attribute consumer.
- addVertexConsumer(Consumer<V>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add a vertex consumer.
- addVertexConsumer(Consumer<V>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add a vertex consumer.
- addVertexCountConsumer(Consumer<Integer>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add a vertex count consumer.
- addVertexCountConsumer(Consumer<Integer>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add a vertex count consumer.
- 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.
- addVertexWithAttributesConsumer(BiConsumer<V, Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Add a vertex with attributes consumer.
- addVertexWithAttributesConsumer(BiConsumer<V, Map<String, Attribute>>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Add a vertex with attributes consumer.
- addVertices(List<String>) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- addVertices(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds each vertex of
vertices
to the graph being built. - ADJACENCY_LIST - Enum constant in enum class org.jgrapht.nio.csv.CSVFormat
-
Adjacency list
- AdjacencyListCSVListener() - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter.AdjacencyListCSVListener
- adjEdgesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- adjList - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- adjMatrix - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
-
if caching is enabled, adjMatrix contains cached information on existing edges, valid values: 0 - no cached value 1 - edge exists -1 - no edge exists
- admissibleHeuristic - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- adopt() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Adopts all orphans.
- advance() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
Advances this iterator to the next node in the blossom
- advance() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
-
Advances this iterator to the next incident edge.
- advance() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
-
Moves this iterator to the next tree edge.
- advance() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
-
Advances the iterator to the next tree node
- advance() - Method in class org.jgrapht.traverse.DegeneracyOrderingIterator
- advance() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Retrieves vertex from the
bucketList
and returns it. - advance() - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Retrieves a vertex from the
buckets
with the maximum cardinality and returns it. - advance() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
- affectedRegion - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- affectedRegion - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- 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.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph - Class in org.jgrapht.alg.spanning
-
This class realises the improvement graph for the composite multi-exchange large neighborhood search.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType - Enum Class in org.jgrapht.alg.spanning
-
This enums contains the vertex types of the improvement graph.
- 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
- AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V> - Class in org.jgrapht.alg.cycle
-
Implementation of a labeled path.
- AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey<V> - Class in org.jgrapht.alg.cycle
-
Implementation of a key for the path maps.
- ahuRootedTreeIsomorphismInspector - Variable in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
- 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.
- aK - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- Algorithm() - Constructor for class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.Algorithm
- Algorithm() - Constructor for class org.jgrapht.alg.scoring.PageRank.Algorithm
- Algorithm() - Constructor for class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- Algorithm(Graph<V, E>, MatchingAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- algorithmExecuted - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Helper field which indicates whether the algorithm has already been executed for
tree1
andtree2
. - Algorithms for enumeration of simple cycles in graphs - Search tag in package org.jgrapht.alg.cycle
- Section
- Algorithms for the computation of Eulerian cycles - Search tag in package org.jgrapht.alg.cycle
- Section
- Algorithms for the computation of undirected cycle basis - Search tag in package org.jgrapht.alg.cycle
- Section
- alias - Variable in class org.jgrapht.alg.util.AliasMethodSampler
- 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
- aList() - Method in class org.jgrapht.io.DOTParser
- aList() - Method in class org.jgrapht.io.DOTParser.AttributesListContext
- aList() - Method in class org.jgrapht.nio.dot.DOTParser
- aList() - Method in class org.jgrapht.nio.dot.DOTParser.AttributesListContext
- aList(int) - Method in class org.jgrapht.io.DOTParser.AttributesListContext
- aList(int) - Method in class org.jgrapht.nio.dot.DOTParser.AttributesListContext
- AListContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.AListContext
- AListContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.AListContext
- ALL - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.KeyTarget
- ALL - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- ALL - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- ALL - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- 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.
- AllDirectedPaths(Graph<V, E>, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Create a new instance with given
pathValidator
. - allEdges(V, V) - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable view over all edges connecting source vertex to target vertex if such vertices exist in this graph.
- allEdgesSet - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
- allMaximalCliques - Variable in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
The result
- allocateArrays() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- allocateTrees() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Allocates trees.
- allowCycles - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- allowCycles(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether the graph will allow cycles.
- allowedColors - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- allowingMultipleEdges - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Control whether the generated graph may contain loops.
- allowingMultipleEdges - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- 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 - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Control whether the generated graph many contain multiple (parallel) edges between the same two vertices
- allowingSelfLoops - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- 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 - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- allowMultipleEdges(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether to allow multiple edges.
- allowsCycles - Variable in class org.jgrapht.graph.DefaultGraphType
- allowSelfLoops - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- allowSelfLoops(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether to allow self-loops.
- allVerticesAdded - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Indicates when all the vertices are been added to the
DeltaSteppingShortestPath.verticesQueue
on each iteration. - allVerticesSet - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
- alpha - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm
- alpha - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
probability that the new edge is from a new vertex v to an existing vertex w, where w is chosen according to d_in + delta_in criterion.
- ALPHA_DIG - Static variable in class org.jgrapht.nio.dot.DOTUtils
- alphaPlusBeta - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
The probability that the new edge is (from a new vertex v to an existing vertex w) plus the probability that the new edge is (from an existing vertex v to an existing vertex w), where v and w are chosen independently, v according to d_out + delta_out, and w according to d_in + delta_in criteria.
- 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. - analyzeCircuits() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- ancestors - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- ancestors - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- AnnotatedFlowEdge() - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- ANYURI - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- ApBetweennessCentrality<V,
E> - Class in org.jgrapht.alg.scoring -
Betweenness centrality with arbitrary precision arithmetic.
- ApBetweennessCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Construct a new instance.
- ApBetweennessCentrality(Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Construct a new instance.
- ApBetweennessCentrality(Graph<V, E>, boolean, long) - Constructor for class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Construct a new instance.
- ApBetweennessCentrality.MyQueue<T,
D> - Interface in org.jgrapht.alg.scoring - ApBetweennessCentrality.UnweightedQueue - Class in org.jgrapht.alg.scoring
- ApBetweennessCentrality.WeightedQueue - Class in org.jgrapht.alg.scoring
- 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.
- apply(T) - Method in class org.jgrapht.nio.IntegerIdProvider
- Arc(TreeDynamicConnectivity.Node, AVLTree.TreeNode<T>) - Constructor for class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Arc
-
Constructs a new arc with the target node
target
and the tree node referencearcTreeNode
- Arc(CapacityScalingMinimumCostFlow.Node, int, double) - Constructor for class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
Creates a new arc
- arcCapacityLowerBounds - Variable in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
- arcCapacityUpperBounds - Variable in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
- arcCosts - Variable in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
- arcNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- arcNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- arcs - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Arcs list
- arcs - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Array of internal arcs.
- arcTreeNode - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Arc
-
The occurrence of the source node, which precedes the subtree Euler tour stored in the binary tree
- areCompatibleEdges(int, int, int, int) - Method in class org.jgrapht.alg.isomorphism.VF2State
-
checks the edges from $v_1$ to $v_2$ and from $u_1$ to $u_2$ for semantic equivalence
- areCompatibleVertexes(int, int) - Method in class org.jgrapht.alg.isomorphism.VF2State
-
checks the vertices $v_1$ and $v_2$ for semantic equivalence
- array - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- array() - Method in class org.jgrapht.io.JsonParser
- array() - Method in class org.jgrapht.io.JsonParser.ValueContext
- array() - Method in class org.jgrapht.nio.json.JsonParser
- array() - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- ArrayBasedSingleSourcePathsImpl(Integer, double[], E[], IntVertexDijkstraShortestPath.IdentifierMap) - Constructor for class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- ArrayContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.JsonParser.ArrayContext
- ArrayContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.json.JsonParser.ArrayContext
- arrayLevel - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- ArrayUnenforcedSet<E> - Class in org.jgrapht.util
-
Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness property in the data structure itself.
- ArrayUnenforcedSet() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs a new empty set
- ArrayUnenforcedSet(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs an empty set with the specified initial capacity.
- ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs a set containing the elements of the specified collection.
- ArrayUnenforcedSet.SetForEquality - Class in org.jgrapht.util
-
Multiple inheritance helper.
- ArrayUnenforcedSetEdgeSetFactory<V,
E> - Class in org.jgrapht.graph.specifics -
An edge set factory which creates
ArrayUnenforcedSet
of size 1, suitable for small degree vertices. - ArrayUnenforcedSetEdgeSetFactory() - Constructor for class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
- ArrayUtil - Class in org.jgrapht.util
-
Utility class to simplify handling of arrays.
- ArrayUtil() - Constructor for class org.jgrapht.util.ArrayUtil
- ASCENDING - Enum constant in enum class org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Deprecated.
- asDirected() - Method in class org.jgrapht.graph.DefaultGraphType
- asDirected() - Method in interface org.jgrapht.GraphType
-
Create a directed variant of the current graph type.
- asDirectedEdgeGraph(MatchingAlgorithm.Matching<V, E>, Set<V>) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
- asDirectedGraph(MatchingAlgorithm.Matching<V, E>) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
- 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
. - assertEdgeExist(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Ensures that the specified edge exists in this graph, or else throws exception.
- assertEdgeExist(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Ensures that the specified edge exists in this graph, or else throws exception.
- assertEdgeExist(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
Ensures that the specified edge exists in this graph, or else throws exception.
- assertNonNegativeEdge(E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
- assertVertexExist(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Ensures that the specified vertex exists in this graph, or else throws exception.
- assertVertexExist(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
-
Ensures that the specified vertex exists in this graph, or else throws exception.
- assertVertexExist(V) - Method in class org.jgrapht.graph.AbstractGraph
-
Ensures that the specified vertex exists in this graph, or else throws exception.
- assignmentProblemCondition() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Checks if the
transportation network is a bipartite matching problem. - 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.
- AsSubgraph.BaseGraphListener - Class in org.jgrapht.graph
-
An internal listener on the base graph.
- assumeEdgeWeights - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.AdjacencyListCSVListener
- assumeEdgeWeights - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- assumeNodeIds - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- assumeZeroWhenNoEdge - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- 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(Graph<V, E>, boolean, boolean, boolean) - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Constructor for AsSynchronizedGraph with specified properties.
- AsSynchronizedGraph.Builder<V,
E> - Class in org.jgrapht.graph.concurrent -
A builder for
AsSynchronizedGraph
. - AsSynchronizedGraph.CacheAccess - Class in org.jgrapht.graph.concurrent
-
Use cache for AsSynchronizedGraph's
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - AsSynchronizedGraph.CacheStrategy<V,
E> - Interface in org.jgrapht.graph.concurrent -
An interface for cache strategy of AsSynchronizedGraph's
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - AsSynchronizedGraph.CopyOnDemandSet<E> - Class in org.jgrapht.graph.concurrent
-
Create a synchronized (thread-safe) and unmodifiable Set backed by the specified Set.
- AsSynchronizedGraph.NoCache - Class in org.jgrapht.graph.concurrent
-
Don't use cache for AsSynchronizedGraph's
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - AsSynchronizedGraph.NoCopy - Class in org.jgrapht.graph.concurrent
-
Disable cache as per
NoCache
, and also don't produce copies; instead, just directly return the results from the underlying graph. - AStarAdmissibleHeuristic<V> - Interface in org.jgrapht.alg.interfaces
-
Interface for an admissible heuristic used in A* search.
- AStarSearchFrontier(Graph<V, E>, V, AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
- 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.
- atoms - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
The atoms generated by the decomposition
- attractiveForce(double) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the attractive force.
- Attribute - Interface in org.jgrapht.nio
-
An attribute
- Attribute(String, String, GEXFAttributeType) - Constructor for class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.Attribute
- ATTRIBUTE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTRIBUTE_ID - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTRIBUTE_KEY_PREFIX - Static variable in class org.jgrapht.nio.graphml.GraphMLExporter
- ATTRIBUTE_TITLE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTRIBUTE_TYPE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- AttributeCategory(String) - Constructor for enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
- AttributeCategory(String) - Constructor for enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- AttributeDetails(String, GEXFAttributeType, String, String) - Constructor for class org.jgrapht.nio.gexf.GEXFExporter.AttributeDetails
- AttributeDetails(String, GraphMLExporter.AttributeCategory, AttributeType, String) - Constructor for class org.jgrapht.nio.graphml.GraphMLExporter.AttributeDetails
- attributeName - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- attributeName - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.Key
- attributes - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- attributes - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.Singleton
- attributes - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphElement
- attributes - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- ATTRIBUTES - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTRIBUTES_CLASS - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- attributesClass - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- attributesList() - Method in class org.jgrapht.io.DOTParser
- attributesList() - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- attributesList() - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- attributesList() - Method in class org.jgrapht.io.DOTParser.NodeStatementContext
- attributesList() - Method in class org.jgrapht.nio.dot.DOTParser
- attributesList() - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- attributesList() - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- attributesList() - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementContext
- AttributesListContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.AttributesListContext
- AttributesListContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.AttributesListContext
- attributeStatement() - Method in class org.jgrapht.io.DOTParser
- attributeStatement() - Method in class org.jgrapht.io.DOTParser.StatementContext
- attributeStatement() - Method in class org.jgrapht.nio.dot.DOTParser
- attributeStatement() - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- AttributeStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.AttributeStatementContext
- AttributeStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- AttributeType - Enum Class in org.jgrapht.nio
-
Denotes the type of an attribute.
- AttributeType(String) - Constructor for enum class org.jgrapht.nio.AttributeType
- attrs - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- ATTVALUE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTVALUE_FOR - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTVALUE_VALUE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- ATTVALUES - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- augment() - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Search for an augmenting path.
- augment(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Construct a path from vertex $v$ to the root of its tree, and use the resulting path to augment the matching.
- augment(List<V>, Map<V, NearestInsertionHeuristicTSP.Closest<V>>, Set<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Augment an existing tour to give a complete tour
- augment(List<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Augment an existing tour to give a complete tour
- augment(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Augments an s-t path specified using the
boundingEdge
and computes the set of tree orphans emerged after augmentation. - augment(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Performs augment operation.
- augment(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Augment from a particular node.
- AUGMENT - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer.Action
- augmentBranch(BlossomVNode, BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Converts a tree into a set of free matched edges.
- augmentBranchInit(BlossomVNode, BlossomVNode, BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Augments the tree rooted at
treeRoot
viaaugmentEdge
. - augmentFlow() - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
For all paths which end in the sink.
- augmentFlowAlongInternal(double, EdmondsKarpMFImpl.VertexExtension, Set<EdmondsKarpMFImpl.VertexExtension>) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
- augmentPath(CapacityScalingMinimumCostFlow.Node, CapacityScalingMinimumCostFlow.Node) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Augments the path from
start
to theend
sending as much flow as possible. - augmentPathTo(V) - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- augmentShortPaths(BoykovKolmogorovMFImpl.VertexExtension, BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Augments all source-sink and source-node-sink paths.
- augmentTime - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Time spent during the augment operation in nanoseconds
- AVAndLFConstructionTask(int, TransitNodeRoutingPrecomputation.LocalityFilterBuilder, TransitNodeRoutingPrecomputation.AccessVerticesBuilder, TransitNodeRoutingPrecomputation.ContractionHierarchyBFS, TransitNodeRoutingPrecomputation.ContractionHierarchyBFS) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
-
Constructs a new instance for the give
taskId
,localityFilterBuilder
,accessVerticesBuilder
,forwardBFS
andbackwardBFS
. - averageClusteringCoefficient - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
- AVLTree<T> - Class in org.jgrapht.util
-
Implementation of the AVL tree data structure.
- AVLTree() - Constructor for class org.jgrapht.util.AVLTree
-
Constructs an empty tree
- AVLTree(AVLTree.TreeNode<T>) - Constructor for class org.jgrapht.util.AVLTree
-
Constructor for internal usage
- AVLTree.TreeNode<T> - Class in org.jgrapht.util
-
Container holding the values stored in the tree.
- AVLTree.TreeNodeIterator - Class in org.jgrapht.util
-
Iterator over the tree nodes.
- AVLTree.TreeValuesIterator - Class in org.jgrapht.util
-
Iterator over the values stored in this tree.
B
- b - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- b - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D.InverseLinearTemperatureModel
- backEdgeFlag - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
During the process of embedding of the down edges of the node $v$, this variable is set to the dfs index of $v$ to indicate that this node has a back edge incident to $v$, which needs to be embedded.
- backEdges - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The list of back edges incident to this node.
- backingSet - Variable in class org.jgrapht.util.WeightedUnmodifiableSet
- backtrace - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- backtrack - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OrientDfsStackInfo
-
Whether dfs is moving forward or backtracking on the
current
node - backtrack - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.SearchInfo
-
Whether dfs is in a forward or a backtracking phase
- backtrack() - Method in class org.jgrapht.alg.isomorphism.VF2State
-
removes the last added pair from the matching
- backtrack(V, V) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- backward - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.TerminationCriterion
- backwardAccessVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertices
-
For each vertex in
contractionGraph
stores corresponding backward access vertices. - backwardAccessVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
For every vertex in
contractionGraph
stores a list of backward access vertices. - backwardBFS - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
-
Is used to run backward CH BFS query over the
contractionGraph
. - backwardHeuristic - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Heuristic used for backward search.
- backwardMapping - Variable in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- backwardMapping - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- backwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, List<CHManyToManyShortestPaths.BucketEntry>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>, boolean) - Method in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Performs backward single source shortest paths search in
contractionGraph
starting fromtarget
tosources
. - backwardSearchSpaces - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Stores backward search space for each target vertex.
- balance(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Performs a node balancing on the path from
node
up until the root - balance(AVLTree.TreeNode<T>, AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Performs a node balancing on the path from
node
up until thestop
node - balanceNode(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Checks whether the
node
is unbalanced. - 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
- BarycenterGreedyTwoLayeredBipartiteLayout2D<V,
E> - Class in org.jgrapht.alg.drawing -
The barycenter heuristic greedy algorithm for edge crossing minimization in two layered bipartite layouts.
- BarycenterGreedyTwoLayeredBipartiteLayout2D() - Constructor for class org.jgrapht.alg.drawing.BarycenterGreedyTwoLayeredBipartiteLayout2D
-
Create a new layout
- BarycenterGreedyTwoLayeredBipartiteLayout2D(Set<V>, Comparator<V>, boolean) - Constructor for class org.jgrapht.alg.drawing.BarycenterGreedyTwoLayeredBipartiteLayout2D
-
Create a new layout
- 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.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- 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.
- BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,
E> - Class in org.jgrapht.alg.shortestpath -
Base class of the search frontier used by bidirectional shortest path algorithms.
- BaseBronKerboschCliqueFinder<V,
E> - Class in org.jgrapht.alg.clique -
Base implementation of the Bron-Kerbosch algorithm.
- BaseBronKerboschCliqueFinder(Graph<V, E>, long, TimeUnit) - Constructor for class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Constructor
- BaseEventDrivenImporter<V,
E> - Class in org.jgrapht.nio -
Base implementation for an importer which uses consumers to notify interested parties.
- BaseEventDrivenImporter() - Constructor for class org.jgrapht.nio.BaseEventDrivenImporter
-
Constructor
- BaseExporter<V,
E> - Class in org.jgrapht.nio -
Base implementation for an exporter.
- BaseExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.BaseExporter
-
Constructor
- BaseGraphAdapter<V,
G> - Class in org.jgrapht.graph.guava -
A base abstract implementation for the graph adapter class using Guava's
Graph
. - BaseGraphAdapter(G) - Constructor for class org.jgrapht.graph.guava.BaseGraphAdapter
-
Create a new adapter.
- BaseGraphAdapter(G, Supplier<V>, Supplier<EndpointPair<V>>) - Constructor for class org.jgrapht.graph.guava.BaseGraphAdapter
-
Create a new adapter.
- BaseGraphAdapter(G, Supplier<V>, Supplier<EndpointPair<V>>, ElementOrderMethod<V>) - Constructor for class org.jgrapht.graph.guava.BaseGraphAdapter
-
Create a new adapter.
- BaseGraphListener() - Constructor for class org.jgrapht.graph.AsSubgraph.BaseGraphListener
- BaseIntrusiveEdgesSpecifics<V,
E, - Class in org.jgrapht.graphIE> -
A base implementation for the intrusive edges specifics.
- BaseIntrusiveEdgesSpecifics(Map<E, IE>) - Constructor for class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Constructor
- BaseKDisjointShortestPathsAlgorithm<V,
E> - Class in org.jgrapht.alg.shortestpath -
A base implementation of a $k$ disjoint shortest paths algorithm based on the strategy used in Suurballe and Bhandari algorithms.
- BaseKDisjointShortestPathsAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
-
Creates a new instance of the algorithm
- BaseLayoutAlgorithm2D<V,
E> - Class in org.jgrapht.alg.drawing -
A base class for a 2d layout algorithm.
- BaseLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.BaseLayoutAlgorithm2D
-
Create a new layout algorithm
- BaseLayoutAlgorithm2D(Function<V, Point2D>) - Constructor for class org.jgrapht.alg.drawing.BaseLayoutAlgorithm2D
-
Create a new layout algorithm with an initializer.
- BaseManyToManyShortestPaths<V,
E> - Class in org.jgrapht.alg.shortestpath -
Base class for many-to-many shortest paths algorithms.
- BaseManyToManyShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseManyToManyShortestPaths
-
Constructs a new instance of the algorithm for a given graph.
- BaseManyToManyShortestPathsImpl(Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
-
Constructs an instance for the given
sources
andtargets
. - BaseMultiObjectiveShortestPathAlgorithm<V,
E> - Class in org.jgrapht.alg.shortestpath -
A base implementation of the multi-objective shortest path interface.
- BaseMultiObjectiveShortestPathAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseMultiObjectiveShortestPathAlgorithm
-
Constructs a new instance of the algorithm for a given graph
- BaseNetworkAdapter<V,
E, - Class in org.jgrapht.graph.guavaN> -
A base abstract implementation for the graph adapter class using Guava's
Network
. - BaseNetworkAdapter(N) - Constructor for class org.jgrapht.graph.guava.BaseNetworkAdapter
-
Create a new network adapter.
- BaseNetworkAdapter(N, Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.guava.BaseNetworkAdapter
-
Create a new network adapter.
- BaseNetworkAdapter(N, Supplier<V>, Supplier<E>, ElementOrderMethod<V>) - Constructor for class org.jgrapht.graph.guava.BaseNetworkAdapter
-
Create a new network adapter.
- BaseSearchFrontier(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
-
Constructs instance for a given
graph
. - BaseShortestPathAlgorithm<V,
E> - Class in org.jgrapht.alg.shortestpath -
A base implementation of the shortest path interface.
- BaseShortestPathAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Constructs a new instance of the algorithm for a given graph.
- baseType - Variable in class org.jgrapht.graph.AsSubgraph
- baseType - Variable in class org.jgrapht.graph.MaskSubgraph
- BaseValueGraphAdapter<V,
W, - Class in org.jgrapht.graph.guavaVG> -
A base abstract implementation for the graph adapter class using Guava's
ValueGraph
. - BaseValueGraphAdapter(VG, ToDoubleFunction<W>) - Constructor for class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Create a new adapter.
- BaseValueGraphAdapter(VG, ToDoubleFunction<W>, Supplier<V>, Supplier<EndpointPair<V>>) - Constructor for class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Create a new adapter.
- BaseValueGraphAdapter(VG, ToDoubleFunction<W>, Supplier<V>, Supplier<EndpointPair<V>>, ElementOrderMethod<V>) - Constructor for class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Create a new adapter.
- 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
- bestEdge - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
A (+, inf) edge incident to this node.
- bestImprovement - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
contains whether the best or the first improvement is returned
- bestImprovement - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
contains whether the best (if true) or the first improvement (if false) is returned in the neighborhood search
- 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.
- BetweennessCentrality(Graph<V, E>, boolean, BetweennessCentrality.OverflowStrategy) - Constructor for class org.jgrapht.alg.scoring.BetweennessCentrality
-
Construct a new instance.
- BetweennessCentrality.MyQueue<T,
D> - Interface in org.jgrapht.alg.scoring - BetweennessCentrality.OverflowStrategy - Enum Class in org.jgrapht.alg.scoring
-
Strategy followed when counting paths.
- BetweennessCentrality.UnweightedQueue - Class in org.jgrapht.alg.scoring
- BetweennessCentrality.WeightedQueue - Class in org.jgrapht.alg.scoring
- bfOddHoleCertificate(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
- bfs() - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Creates a level graph.
- bfs() - Method in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
-
BFS function which finds the shortest augmenting path.
- bfs(Queue<Integer>, boolean[]) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- bfs(Graph<V, E>, V, List<List<V>>) - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- 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.
- BidirectionalAStarShortestPath.AStarSearchFrontier - Class in org.jgrapht.alg.shortestpath
-
Maintains search frontier during shortest path computation.
- BidirectionalAStarShortestPath.ConsistentTerminationCriterion - Class in org.jgrapht.alg.shortestpath
-
Termination criterion for the consistent heuristics.
- BidirectionalAStarShortestPath.InconsistentTerminationCriterion - Class in org.jgrapht.alg.shortestpath
-
Termination criterion for the inconsistent heuristics.
- BidirectionalAStarShortestPath.ReversedGraphHeuristic - Class in org.jgrapht.alg.shortestpath
-
Helper class for backward search, since it should operate on the reversed graph.
- BidirectionalAStarShortestPath.TerminationCriterion - Class in org.jgrapht.alg.shortestpath
-
Termination criterion for the heuristic search.
- 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.
- BidirectionalDijkstraShortestPath.DijkstraSearchFrontier<V,
E> - Class in org.jgrapht.alg.shortestpath -
Maintains search frontier during shortest path computation.
- bigger - Variable in class org.jgrapht.util.UnmodifiableUnionSet.SetSizeOrdering
- biggerSize - Variable in class org.jgrapht.util.UnmodifiableUnionSet.SetSizeOrdering
- 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.
- BipartiteMatchingProblem<V,
E> - Interface in org.jgrapht.generate.netgen -
This class represents a bipartite matching problem.
- BipartiteMatchingProblem.BipartiteMatchingProblemImpl<V,
E> - Class in org.jgrapht.generate.netgen -
Default implementation of a Bipartite Matching Problem
- BipartiteMatchingProblemImpl(Graph<V, E>, Set<V>, Set<V>, Function<E, Double>, boolean) - Constructor for class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
-
Constructs a new bipartite matching problem
- 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.
- bitfield - Variable in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- bitIndex - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- bitIndex - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- 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 - Enum constant in enum class org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has been returned via iterator, and we're done with all of its out-edges.
- blackNodes - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- 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
- blocked - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- blocked - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- blocks - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- blocks - Variable in class org.jgrapht.alg.connectivity.BlockCutpointGraph
- blossom(int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Creates a new blossom using bridge $(v,w)$.
- blossomFormingEdge - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
The (+, +) edge of the blossom
- blossomGrandparent - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Reference of some blossom that is higher than this node.
- blossomNodesIterator(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Returns a new instance of blossom nodes iterator
- BlossomNodesIterator(BlossomVNode, BlossomVEdge) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
Constructs a new BlossomNodeIterator for the
root
andblossomFormingEdge
- blossomNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Number of blossoms
- blossomParent - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Reference of the blossom this node is contained in.
- blossomSibling - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Reference of the next node in the blossom structure in the circular singly linked list of blossom nodes.
- blossomSupports(int, int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
This method creates one side of the blossom: the path from vertex $v$ to the base of the blossom.
- BlossomVDualUpdater<V,
E> - Class in org.jgrapht.alg.matching.blossom.v5 -
This class is used by
KolmogorovWeightedPerfectMatching
to perform dual updates, thus increasing the dual objective function value and creating new tight edges. - BlossomVDualUpdater(BlossomVState<V, E>, BlossomVPrimalUpdater<V, E>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Creates a new instance of the BlossomVDualUpdater
- BlossomVEdge - Class in org.jgrapht.alg.matching.blossom.v5
-
This class is a data structure for Kolmogorov's Blossom V algorithm.
- BlossomVEdge(int) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Constructs a new edge by initializing the arrays
- BlossomVEdge.BlossomNodesIterator - Class in org.jgrapht.alg.matching.blossom.v5
-
An iterator which traverses all nodes in the blossom.
- BlossomVInitializer<V,
E> - Class in org.jgrapht.alg.matching.blossom.v5 -
Is used to start the Kolmogorov's Blossom V algorithm.
- BlossomVInitializer(Graph<V, E>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Creates a new BlossomVInitializer instance
- BlossomVInitializer.Action - Enum Class in org.jgrapht.alg.matching.blossom.v5
-
Enum for specifying the primal operation to perform with critical edge during fractional matching initialization
- BlossomVNode - Class in org.jgrapht.alg.matching.blossom.v5
-
This class is a data structure for Kolmogorov's Blossom V algorithm.
- BlossomVNode(int) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Constructs a new "+" node with a
BlossomVNode.Label.PLUS
label. - BlossomVNode.IncidentEdgeIterator - Class in org.jgrapht.alg.matching.blossom.v5
-
An iterator for traversing the edges incident to this node.
- BlossomVNode.Label - Enum Class in org.jgrapht.alg.matching.blossom.v5
-
Represents nodes' labels
- 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 Class in org.jgrapht.alg.matching.blossom.v5
-
Enum for choosing dual updates strategy
- BlossomVOptions.InitializationType - Enum Class in org.jgrapht.alg.matching.blossom.v5
-
Enum for types of matching initialization
- BlossomVPrimalUpdater<V,
E> - Class in org.jgrapht.alg.matching.blossom.v5 -
This class is used by
KolmogorovWeightedPerfectMatching
for performing primal operations: grow, augment, shrink and expand. - BlossomVPrimalUpdater(BlossomVState<V, E>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Constructs a new instance of BlossomVPrimalUpdater
- BlossomVState<V,
E> - Class in org.jgrapht.alg.matching.blossom.v5 -
This class stores data needed for the Kolmogorov's Blossom V algorithm; it is used by
KolmogorovWeightedPerfectMatching
,BlossomVPrimalUpdater
andBlossomVDualUpdater
during the course of the algorithm. - BlossomVState(Graph<V, E>, BlossomVNode[], BlossomVEdge[], int, int, int, List<V>, List<E>, BlossomVOptions, double) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Constructs the algorithm's initial state
- BlossomVTree - Class in org.jgrapht.alg.matching.blossom.v5
-
This class is a data structure for Kolmogorov's Blossom V algorithm.
- BlossomVTree() - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Empty constructor
- BlossomVTree(BlossomVNode) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Constructs a new tree with the
root
- BlossomVTree.TreeEdgeIterator - Class in org.jgrapht.alg.matching.blossom.v5
-
An iterator over tree edges incident to this tree.
- BlossomVTree.TreeNodeIterator - Class in org.jgrapht.alg.matching.blossom.v5
-
An iterator over tree nodes.
- BlossomVTreeEdge - Class in org.jgrapht.alg.matching.blossom.v5
-
This class is a data structure for Kolmogorov's Blossom V algorithm.
- BlossomVTreeEdge() - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Constructs a new tree edge by initializing arrays and heaps
- BOOLEAN - Enum constant in enum class org.jgrapht.nio.AttributeType
- BOOLEAN - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- 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.
- boundaryHeight - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The height of this node on the boundary of the biconnected component, which is used to extract the Kuratowski subdivision.
- box - Variable in class org.jgrapht.alg.drawing.FRQuadTree.Node
- 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
. - BoyerMyrvoldPlanarityInspector.Edge - Class in org.jgrapht.alg.planar
-
Internal representation of the edges of the input
graph
. - BoyerMyrvoldPlanarityInspector.MergeInfo - Class in org.jgrapht.alg.planar
-
The information needed to merge two consecutive biconnected components
- BoyerMyrvoldPlanarityInspector.Node - Class in org.jgrapht.alg.planar
-
The internal representation of the vertices of the graph.
- BoyerMyrvoldPlanarityInspector.OrientDfsStackInfo - Class in org.jgrapht.alg.planar
-
Represents information needed to store in the stack during the input
graph
orientation. - BoyerMyrvoldPlanarityInspector.OuterFaceCirculator - Class in org.jgrapht.alg.planar
-
A circulator over the nodes on the boundary of the biconnected component.
- BoyerMyrvoldPlanarityInspector.SearchInfo - Class in org.jgrapht.alg.planar
-
Represents information needed to search a path within a biconnected component
- BoykovKolmogorovMFImpl<V,
E> - Class in org.jgrapht.alg.flow -
This is an implementation of the Boykov-Kolmogorov maximum flow algorithm.
- BoykovKolmogorovMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Creates a new algorithm instance with the specified
network
. - BoykovKolmogorovMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Construct a new algorithm instance with the specifies
network
andepsilon
. - BoykovKolmogorovMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
-
Network vertex extension used to store auxiliary vertex information.
- BoykovKolmogorovMFImpl.VertexTreeStatus - Enum Class in org.jgrapht.alg.flow
-
Enum specifying vertex tree status
- 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.
- BreadthFirstIterator.SearchNodeData<E> - Class in org.jgrapht.traverse
-
Data kept for discovered vertices.
- breadthFirstSearch() - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
Method which finds a path from source to sink the in the residual graph.
- bridges - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- bridges - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
For each odd vertex condensed into a blossom, a bridge is defined.
- 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.
- bSets - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- bSets - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- Bucket(Collection<V>) - Constructor for class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Creates a new bucket with all
vertices
stored in it. - Bucket(V) - Constructor for class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Creates a new Bucket with a single
vertex
in it. - BucketEntry(ContractionHierarchyPrecomputation.ContractionVertex<V>, double) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.BucketEntry
-
Constrcuts an instance of an entry for the given
target
anddistance
. - bucketIndex(double) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Calculates bucket index for a given
distance
. - bucketList - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Reference to the
BucketList
that contains unvisited vertices. - BucketList(Collection<V>) - Constructor for class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList
-
Creates a
BucketList
with a single bucket and all specifiedvertices
in it. - bucketMap - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList
-
Map for mapping vertices to buckets they are currently in.
- buckets - Variable in class org.jgrapht.traverse.DegeneracyOrderingIterator
- buckets - Variable in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Disjoint sets of vertices of the graph, indexed by the cardinalities of already visited neighbours.
- bucketsSupplier - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Supplier of the buckets for the
bucketStructure
. - bucketStructure - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Buckets structure.
- buckyBallGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- build() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Builds the
NetworkGeneratorConfig
. - 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.
- buildAdjacencyList() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- buildAsUnmodifiable() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Build an unmodifiable version graph.
- buildBlock(int) - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Each time a cutpoint is discovered, this method computes the biconnected component
- buildDGraph() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
If the
graph
is denoted by $G$, then for every vertex $v$ reachable fromsource
in $G$ $D(G)$ contains balanced heaps of all outroots, which corresponds to vertices on the path from $v$ tosink
. - 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.
- buildFundamentalCycle(E, Map<V, E>) - Method in class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
-
Given a non-tree edge and a spanning tree (forest) build a fundamental cycle.
- 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. - buildGraphPath(V, V, double) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Builds the graph path
- Building and serializing with limited memory - Search tag in package org.jgrapht.sux4j
- Section
- buildInternal() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Create internal data structure
- buildLocalityFilter() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilterBuilder
-
Builds an instance of
LocalityFilter
usingvisitedForwardVoronoiCells
andvisitedBackwardVoronoiCells
. - buildMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Gets costs-matrix as input and returns assignment of tasks (designated by the columns of cost-matrix) to the workers (designated by the rows of the cost-matrix) so that to MINIMIZE total tasks-tackling costs
- buildMaximalMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Builds maximal matching corresponding to the given excess-matrix
- buildNetwork() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Helper method for constructing the internally used network
- buildPath(int[], int, int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Builds the path backwards from the specified start vertex to the end vertex.
- buildPath(V, int, double) - Method in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Constructs cycle with minimum mean using information in
policyGraph
. - buildPaths(V) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
-
Build the actual paths from the final labels of each node.
- buildPaths(V, V) - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
-
After removing overlapping edges, each path is not necessarily connecting start to end vertex.
- buildPathsGraph() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Guides the building process of the paths graph.
- buildType() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the graph type.
- buildVertexCoverage() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Builds vertex-cover given built up matching
- buildVertices() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
Builds a new instance of
AccessVertices
usingforwardAccessVertices
andbackwardAccessVertices
. - buildWalk() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Build final walk
- bulkInsert(SaturationDegreeColoring.HeapHandle[]) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- bullGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- butterflyGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- bypassedEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Pair of edges this edge bypasses in case it is a shortcut.
- byteArrayOutputStream - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- byteIndex - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- bytes - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
C
- c - Variable in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- CacheAccess() - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheAccess
- cacheDisable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph without caching.
- cachedPartitioning - Variable in class org.jgrapht.alg.partition.BipartitePartitioning
- cacheEdges - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- cacheEnable - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
- cacheEnable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with caching.
- CacheEntry(int, int, ZhangShashaTreeEditDistance.EditOperation<V>) - Constructor for class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.CacheEntry
-
Constructs an instance of entry for the given
cachePreviousPosI
cachePreviousPosJ
andeditOperation
. - cachePreviousPosI - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.CacheEntry
-
Outer index of the previous entry which is part of the computed optimal solution.
- cachePreviousPosJ - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.CacheEntry
-
Inner index of the previous entry which is part of the computed optimal solution.
- cacheStrategy - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
- cacheWeights - Variable in class org.jgrapht.graph.AsWeightedGraph
- calculateAttractiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the repulsive forces between vertices connected with edges.
- calculateClosestVertex(V, Map<V, Set<Integer>>, Map<Integer, V>) - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Calculates the closest vertex to
vertex
such that the connection ofvertex
to the subtree of the closest vertex does not violate the capacity constraint and the savings are positive. - calculateColorDegrees(int, ColorRefinementAlgorithm.ColoringRepresentation) - Method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Helper method that calculates the color degree for every vertex and the maximum and minimum color degree for every color.
- calculateCoverRecursively(int, BitSet, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
- 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
- calculateEquivalentFlowTree() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Runs the algorithm
- calculateGomoryHuTree() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Runs the algorithm
- calculateGraphMapping(VertexColoringAlgorithm.Coloring<V>, VertexColoringAlgorithm.Coloring<V>) - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
calculates the graph isomorphism as GraphMapping and assigns it to attribute
isomorphicGraphMapping
- calculateMaxFlow(V, V) - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Assigns source to currentSource and sink to currentSink.
- calculateMaximumDemandOfSubtrees(Set<V>, SpanningTreeAlgorithm.SpanningTree<E>, double) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Calculates the maximum demand over all new subtrees induced by the minimum spanning tree
spanningTree
. - calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Computes the maximum flow value.
- 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.
- calculateMinCutWithoutTreeCompression() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Modified implementation of the algorithm proposed in Odd Minimum Cut-sets and b-matchings by Padberg and Rao.
- calculateMinCutWithTreeCompression() - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Implementation of the algorithm proposed in Odd Minimum Cut-sets and b-matchings by Padberg and Rao.
- calculateMinimumCostFlow() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Calculated a solution to the specified minimum cost flow problem.
- calculatePathLength(V, E) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
Determine weighted path length to a vertex via an edge, using the path length for the opposite vertex.
- 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.BaseKDisjointShortestPathsAlgorithm
-
Calculates the shortest paths for the current iteration.
- 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.
- calculateSpanningTrees(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>, Set<Integer>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Updates the map containing the MSTs for every subset of the partition.
- calculateSubtreesOfVertices(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<V, Pair<Set<V>, Double>>, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>, Set<Integer>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Updates the map containing the subtrees of all vertices in the graph with respect to the MST in the partition and returns them in map.
- calculateUpperBound() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Calculates a cheap upper bound on the optimum solution.
- cameFrom - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- cameFrom - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
-
Predecessor map.
- canAddEdge(Map<V, Integer>, UnionFind<V>, V, V, boolean) - Method in class org.jgrapht.alg.tour.GreedyHeuristicTSP
-
Tests if an edge can be added.
- candidatePaths - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Heap of the candidate path generated so far and sorted my their weights.
- CANNOT_CREATE_NEW_VERTICES_FROM_SUBGRAPH - Static variable in class org.jgrapht.graph.AsSubgraph
- 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 - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
the current solution corresponding to the improvement graph
- 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
. - capacities - Variable in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
- capacity - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- capacity - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the maximal capacity for each subtree.
- capacity - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- CAPACITY - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- CAPACITY_COST_BOUND - Static variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Upper bound on the arc capacities and costs values in the network this generator can work with.
- CAPACITY_INF - Static variable in interface org.jgrapht.generate.netgen.MaximumFlowProblem
- capacityForSize(int) - Static method in class org.jgrapht.util.CollectionUtil
- capacityMap - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Arc capacity mapping which is used to define arc capacity function.
- 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
. - CapacityScalingMinimumCostFlow.Arc - Class in org.jgrapht.alg.flow.mincost
-
Supporting data structure for the
CapacityScalingMinimumCostFlow
. - CapacityScalingMinimumCostFlow.Node - Class in org.jgrapht.alg.flow.mincost
-
Supporting data structure for the
CapacityScalingMinimumCostFlow
. - cardinalityMap - Variable in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Maps every vertex to its cardinality.
- category - Variable in class org.jgrapht.nio.graphml.GraphMLExporter.AttributeDetails
- ccFinishedEvent - Variable in class org.jgrapht.traverse.CrossComponentIterator
- CCS_AFTER_COMPONENT - Static variable in class org.jgrapht.traverse.CrossComponentIterator
- CCS_BEFORE_COMPONENT - Static variable in class org.jgrapht.traverse.CrossComponentIterator
- CCS_WITHIN_COMPONENT - Static variable in class org.jgrapht.traverse.CrossComponentIterator
- ccStartedEvent - Variable in class org.jgrapht.traverse.CrossComponentIterator
- CENTER_VERTEX - Static variable in class org.jgrapht.generate.StarGraphGenerator
- centroid - Variable in class org.jgrapht.alg.drawing.FRQuadTree.Node
- certificate - Variable in class org.jgrapht.alg.cycle.BergeGraphInspector
- certificate - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Contains a hole or an anti-hole of the graph, if it isn't weakly chordal
- certify - Variable in class org.jgrapht.alg.cycle.BergeGraphInspector
- chainNodes - Variable in class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
List of chain nodes.
- CHANGE - Enum constant in enum class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
-
Indicates that an edit operation is changing a vertex in one tree to a vertex in another three.
- changeCost - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Function which computes cost of changing a vertex $v1$ in
tree1
to vertex $v2$ intree2
. - channelNames - Static variable in class org.jgrapht.io.CSVLexer
- channelNames - Static variable in class org.jgrapht.io.DOTLexer
- channelNames - Static variable in class org.jgrapht.io.GmlLexer
- channelNames - Static variable in class org.jgrapht.io.JsonLexer
- channelNames - Static variable in class org.jgrapht.nio.csv.CSVLexer
- channelNames - Static variable in class org.jgrapht.nio.dot.DOTLexer
- channelNames - Static variable in class org.jgrapht.nio.gml.GmlLexer
- channelNames - Static variable in class org.jgrapht.nio.json.JsonLexer
- characters(char[], int, int) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- characters(char[], int, int) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- checkCapacityCostConstraint(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Performs capacity and cost parameter valiation.
- checkComponentForFailedEdge(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Checks whether the biconnected component rooted at
componentRoot
can be used to extract a Kuratowski subdivision. - checkDominatedPathsOfLengthK(AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V>, Map<AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey<V>, AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V>>) - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Checks whether
path
is dominated by some path in the previously calculated set of paths of length k. - checkDominatedPathsOfLengthKplus1(AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V>, Map<AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey<V>, AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V>>) - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Checks whether
path
dominates the current minimal cost path with the same head, tail and label set in the set of all paths of length k + 1. - checkForComodification() - Method in class org.jgrapht.util.AVLTree.TreeNodeIterator
-
Checks if the tree has been modified during the iteration process
- checkForComodification() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
Verifies that the list structure hasn't been changed since the iteration started
- checkForEmptySolution() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Check if denominator will be empty to avoid dividing by 0.
- checkGraph(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Checks that graph is undirected, complete, and non-empty
- checkIsAdjacent(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Checks whether this node has a neighbor
node
on the boundary of the biconnected component - checkLabels(List<List<Integer>>, List<Pair<Integer, Integer>>) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
For a given coconnected component of the
separator
checks whether every vertex in it is seen by al least one vertex of the edge that is separated by theseparator
- checkNodeConstraint(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Perform node parameter validation.
- checkNodes(V, V) - Method in class org.jgrapht.alg.lca.NaiveLCAFinder
-
Checks whether both
a
andb
belong to the specified graph - checkRadiusTraversal(boolean) - Method in class org.jgrapht.traverse.ClosestFirstIterator
- checkWeights - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- chi - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- child - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
The virtual root of the child biconnected component
- childOrphans - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
A queue of child orphans.
- childPrev - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
The previous node along the traversal of the child biconnected component
- children - Variable in class org.jgrapht.alg.drawing.FRQuadTree.Node
- children - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- 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>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
graph
andexecutor
. - CHManyToManyShortestPaths.BucketEntry - Class in org.jgrapht.alg.shortestpath
-
Stores data computed during the backward searches.
- CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl - Class in org.jgrapht.alg.shortestpath
-
Implementation of
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
for many-to-many shortest paths algorithm based on contraction hierarchy. - CHManyToManyShortestPathsImpl(Graph<V, E>, ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>, Set<V>, Set<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Constructs a new instance for the given
graph
,contractionGraph
,contractionMapping
,forwardSearchSpaces
,backwardSearchSpaces
anddistanceAndMiddleVertexMap
. - chooseClosest(Map<V, NearestInsertionHeuristicTSP.Closest<V>>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Chooses the closest unvisited vertex to the sub-tour
- choosePivot(Set<V>, Set<V>) - Method in class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Choose a pivot.
- chordal - Variable in class org.jgrapht.alg.cycle.ChordalityInspector
-
Contains true if the graph is chordal, otherwise false.
- chordalGraph - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Minimal triangulation of 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 - Variable in class org.jgrapht.alg.color.ChordalGraphColoring
- chordalityInspector - Variable in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
ChordalityInspector
for testing chordality of thegraph
- chordalityInspector - Variable in class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
- 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 Class 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
- chvatalGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- circuit(Integer, int) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- 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
- classes - Variable in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
- 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.
- cleanupColorDegrees(Set<Integer>, ColorRefinementAlgorithm.ColoringRepresentation) - Method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Helper method that cleanups the internal representation of color degrees for a new iteration.
- cleanUpDfs(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Recursively cleans up the dfs tree rooted at the
dfsTreeRoot
my removing all the short-circuit edges and properly orienting other embedded edges - clear() - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
- clear() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Empty the queue.
- clear() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- clear() - Method in class org.jgrapht.util.AVLTree
-
Removes all nodes from this tree.
- 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.
- clearCurrentEdges() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Clears the currentEdge variable of all adjacent to the
tree
trees - clearIsMarkedAndSetIsOuter(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Traverses the nodes in the tree from
start
toroot
and sets isMarked and isOuter to false - clearMarked() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Clears the marking of all nodes and pseudonodes
- clearMarked(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Clears the marking of
node
and all its ancestors up until the first unmarked vertex is encountered - clearMinSCCState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- clearPathLimit() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
This is the default behaviour of the algorithm.
- clearState() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- clearState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- clearState() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- clearState() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- clearVisited() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Clears the visited variable of all the nodes and component roots
- 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
. - clock - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- clone() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
Returns a shallow copy of this labeled path instance.
- 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
- clone() - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.IntrusiveEdge
- closeDirectedAcyclicGraph(DirectedAcyclicGraph<V, E>) - Method in class org.jgrapht.alg.TransitiveClosure
-
Computes the transitive closure of a directed acyclic graph in $O(nm)$
- closedList - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- closedList - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
-
Closed nodes of the frontier.
- closedVertexListToTour(List<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Transform from a closed List representation (first and last vertex element are the same) to a graph path.
- 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.
- Closest(V, V, double) - Constructor for class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- 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.
- ClosestFirstIterator.QueueEntry<V,
E> - Class in org.jgrapht.traverse -
Private data to associate with each entry in the priority queue.
- 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.
- clusters - Variable in class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
- coarseColoringAreEqual(VertexColoringAlgorithm.Coloring<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>>) - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Checks whether two coarse colorings are equal.
- 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. - CollectionUtil() - Constructor for class org.jgrapht.util.CollectionUtil
- colorClasses - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
mapping from all colors to their classes
- colorCount - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- colorDegree - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
mapping from vertex to the vertex color degree (number of neighbors with different colors)
- coloring - Variable in class org.jgrapht.alg.color.ChordalGraphColoring
- coloring - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
The actual coloring
- COLORING - Enum constant in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Coloring format.
- ColoringImpl(Map<V, Integer>, int) - Constructor for class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
-
Construct a new vertex coloring.
- ColoringRepresentation(Graph<V, E>, VertexColoringAlgorithm.Coloring<V>) - Constructor for class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
- 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.
- ColorRefinementAlgorithm.ColoringRepresentation - Class in org.jgrapht.alg.color
- 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.
- ColorRefinementIsomorphismInspector.DistinctGraphObject<T,
V, - Class in org.jgrapht.alg.isomorphismE> -
Representation of a graph vertex in the disjoint union
- colors - Variable in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
- cols - Variable in class org.jgrapht.generate.GridGraphGenerator
- colsVisited - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
- columnIndex - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- columnIndices - Variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
- columnMatched - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
``columnMatched[i]'' is the column # of the ZERO matched at the $i$-th row
- columns - Variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
- columns() - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
-
Get the number of columns of the matrix.
- columnsCovered - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Columns coverage bit-mask
- combine(double, double) - Method in interface org.jgrapht.util.WeightCombiner
-
Combines two weights.
- comment - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- COMMENT - Static variable in class org.jgrapht.io.DOTLexer
- COMMENT - Static variable in class org.jgrapht.io.DOTParser
- COMMENT - Static variable in class org.jgrapht.io.GmlLexer
- COMMENT - Static variable in class org.jgrapht.io.GmlParser
- COMMENT - Static variable in class org.jgrapht.nio.dot.DOTLexer
- COMMENT - Static variable in class org.jgrapht.nio.dot.DOTParser
- COMMENT - Static variable in class org.jgrapht.nio.gml.GmlLexer
- COMMENT - Static variable in class org.jgrapht.nio.gml.GmlParser
- COMMENT - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- CommonNeighborsLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the number of common neighbors.
- CommonNeighborsLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.CommonNeighborsLinkPrediction
-
Create a new prediction
- communities - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- comparator - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- comparator - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Used to compare floating point numbers.
- comparator - Variable in class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
- comparator - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- comparator - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- comparator - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- comparator - Variable in class org.jgrapht.alg.matching.GreedyWeightedMatching
- comparator - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- comparator - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
- comparator - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
- comparator - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- comparator - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
- comparator - Variable in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
- comparator - Variable in class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree
- comparator - Variable in class org.jgrapht.alg.util.AliasMethodSampler
- comparator - Variable in class org.jgrapht.graph.guava.ElementOrder
- comparator - Variable in class org.jgrapht.graph.guava.ElementOrderMethod
- comparator() - Method in class org.jgrapht.graph.guava.ElementOrderMethod
-
Get the comparator.
- comparator(Comparator<T>) - Static method in class org.jgrapht.graph.guava.ElementOrderMethod
-
Get the comparator ordering method.
- comparator(Comparator<V>) - Static method in class org.jgrapht.graph.guava.ElementOrder
-
Create an element order with a comparator
- COMPARATOR - Enum constant in enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
-
Usage of an actual comparator instance to order the elements.
- compare(E, E) - Method in class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching.EdgeDegreeComparator
- compare(Double, Double) - Method in class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Compares two floating point values.
- compare(MartinShortestPath.Label, MartinShortestPath.Label) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath.LabelComparator
- compare(V, V) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.DSaturComparator
- compare(V, V) - Method in class org.jgrapht.alg.util.VertexDegreeComparator
-
Deprecated, for removal: This API element is subject to removal in a future version.
- compare(V, V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoComparator
- compare(V, V) - Method in class org.jgrapht.graph.guava.ElementOrder
-
Compare two elements
- compareTo(EppsteinShortestPathIterator.EppsteinGraphPath) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
- compareTo(EppsteinShortestPathIterator.PathsGraphVertex) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
- 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(NearestInsertionHeuristicTSP.Closest<V>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- 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.
- completeColorAssignment - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- 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.
- CompleteIntegerSet - Class in org.jgrapht.opt.graph.sparse.specifics
-
An integer set containing all numbers from 0 to n-1.
- CompleteIntegerSet(int) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.CompleteIntegerSet
-
Create an integer set from 0 to n-1.
- completionService - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Decorator for
ThreadPoolExecutor
supplied to this algorithm that enables to keep track of when all submitted tasks are finished. - completionService - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Decorator for
ThreadPoolExecutor
supplied to this algorithm that enables to keep track of when all submitted tasks are finished. - completionService - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Decorator for
executor
that allows to keep track of when all submitted tasks are finished. - component - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- component - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- component - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- component - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- componentRoots - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
List of the virtual biconnected component roots.
- 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
- compoundStatement() - Method in class org.jgrapht.io.DOTParser
- compoundStatement() - Method in class org.jgrapht.io.DOTParser.GraphContext
- compoundStatement() - Method in class org.jgrapht.io.DOTParser.SubgraphStatementContext
- compoundStatement() - Method in class org.jgrapht.nio.dot.DOTParser
- compoundStatement() - Method in class org.jgrapht.nio.dot.DOTParser.GraphContext
- compoundStatement() - Method in class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- CompoundStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.CompoundStatementContext
- CompoundStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.CompoundStatementContext
- compute() - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Main loop of the algorithm
- compute() - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Compute the centrality index
- compute() - Method in class org.jgrapht.alg.scoring.BetweennessCentrality
-
Compute the centrality index
- compute() - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Compute the centrality index
- compute() - Method in class org.jgrapht.alg.scoring.HarmonicCentrality
- compute() - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.MaxEdgeWeightTask
-
Computes maximum edge weight.
- compute(V) - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality
- compute(V) - Method in class org.jgrapht.alg.scoring.BetweennessCentrality
- compute2DCeilingEuclideanDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Computes the distance of the two nodes n1 and n2 according to the
CEIL_2D
metric, the round up version ofEUC_2D
. - compute2DGeographicalDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Computes the distance of the two nodes n1 and n2 according to the
GEO
metric. - compute2DPseudoEuclideanDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Computes the distance of two the two nodes n1 and n2 according to the
ATT
metric. - computeAncestorMatrix() - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- computeAncestorsStructure() - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- computeAtoms() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Compute the unique decomposition of the input graph $G$ (atoms of $G$).
- computeAVAndLF() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Computes in parallel access vertices and locality filter for the transit node routing.
- computeBinaryLog(int) - Method in class org.jgrapht.alg.TransitiveClosure
-
Computes floor($\log_2 (n)$) $+ 1$
- computeCoConnectedComponents(Graph<V, E>, List<Pair<Integer, Integer>>) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Computes the connected components of the complement of the graph induces by the vertices of the
separator
. - computeCommunities() - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Compute the final communities from the labels.
- computeConnector(Graph<V, E>) - Method in class org.jgrapht.nio.dot.DOTExporter
-
Compute the connector
- computeContractionHierarchy() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes contraction hierarchy for
graph
. - computed - Variable in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- computed - Variable in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
- computed - Variable in class org.jgrapht.alg.partition.BipartitePartitioning
- computed - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Global Clustering Coefficient
- computedAverage - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Average Clustering Coefficient
- 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
- computeEccentricityMap() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Lazy method which computes the eccentricity of each vertex
- computeEuclideanDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Computes the distance of the two nodes n1 and n2 according to the
EUC_2D
orEUC_3D
metric depending on their dimension. - computeFarthestVertex(BreadthFirstIterator<V, E>) - Method in class org.jgrapht.alg.shortestpath.TreeMeasurer
- computeFooter(Graph<V, E>) - Method in class org.jgrapht.nio.dot.DOTExporter
-
Compute the footer
- computeFullScoreMap() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
- computeGlobalClusteringCoefficient() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
- computeGlobalSeparatorList() - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Computes the global separator list of the
graph
. - computeGraphId(Graph<V, E>) - Method in class org.jgrapht.nio.dot.DOTExporter
-
Get the id of the graph.
- computeHeader(Graph<V, E>) - Method in class org.jgrapht.nio.dot.DOTExporter
-
Compute the header
- computeHeavyPathDecomposition() - Method in class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Compute the heavy path decomposition and get the corresponding arrays from the internal state.
- computeIndependentSetConsumer - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes independent set during contraction.
- computeInitialPrioritiesConsumers - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Consumers that perform computation of initial priorities for vertices in
contractionGraph
. - computeKeyrootsAndMapping(V) - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
Runs post-order DFS on
tree
starting attreeRoot
. - computeLevels(Graph<V, E>, V) - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- computeLocalClusteringCoefficient(V) - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
- computeLowerBounds(List<K>) - Method in class org.jgrapht.generate.netgen.Distributor
-
Finds a maximum lower bound for every key.
- computeManhattanDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Computes the distance of the two nodes n1 and n2 according to the
MAN_2D
orMAN_3D
metric depending on their dimension. - computeMatching() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- computeMaximumAllowedEdges(int, boolean, boolean, boolean) - Static method in class org.jgrapht.generate.GnmRandomGraphGenerator
-
Return the number of allowed edges based on the graph type.
- computeMaximumDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Computes the distance of the two nodes n1 and n2 according to the
MAX_2D
orMAX_3D
metric depending on their dimension. - computeMinimalTriangulation() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Compute the minimal triangulation of the graph.
- computeMinimumWeights(Map<V, Integer>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.HeldKarpTSP
- computeNegativeCycle(E, Map<V, E>) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Computes a negative weight cycle assuming that the algorithm has already determined that it exists.
- computeNext() - Method in class org.jgrapht.traverse.RandomWalkVertexIterator
- computeNextId(V) - Method in class org.jgrapht.graph.guava.ElementOrder
- computeOddSetCover() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- computePartialCycle() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Computes a partial cycle assuming that all vertices have an even degree.
- computePartitions(Graph<V, E>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Compute the vertex partitions.
- computeRadiansAngle(double) - Static method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- computeRMQ() - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- computeShortcutsConsumer - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes shortcuts for a vertex.
- computeShortestPaths(V) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Performs shortest path computations.
- 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.
- computeSuffixSum(List<Integer>) - Method in class org.jgrapht.generate.netgen.Distributor
-
Computes a suffix sum of the
bounds
. - computeTarjan(List<Pair<V, V>>) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
- computeTarjanOLCA(V, V, Set<V>) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
- computeTransitNodeRouting() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Computes transit node routing based on
contractionHierarchy
. - computeUpperBounds(List<K>) - Method in class org.jgrapht.generate.netgen.Distributor
-
Finds a minimum lower bound for every key.
- computeVertexDistance(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
This method runs the reverted BFS starting from
currentCycleVertex
to update data inpolicyGraph
andvertexDistance
. - computeVertexIndices(Graph<V, E>) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Compute a unique integer for each vertex of the graph
- computeVertexWeights(Graph<V, E>) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Compute vertex weights for edge re-weighting using Bellman-Ford.
- computeVoronoiDiagram() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
Computes Voronoi diagram for
graph
. - 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.
- ConcurrencyUtil - Class in org.jgrapht.util
-
Utility class to manage creation and shutting down instance of the
ThreadPoolExecutor
. - ConcurrencyUtil() - Constructor for class org.jgrapht.util.ConcurrencyUtil
- config - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
User-provided network configuration.
- config - Variable in class org.jgrapht.generate.netgen.NetworkInfo
-
Network configuration.
- connectChainsToSinks() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Connects generated chains to sinks and distributes network supply among sinks.
- connected(T, T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Checks if the
first
andsecond
belong to the same tree. - CONNECTED_COMPONENT_FINISHED - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Connected component traversal finished event.
- CONNECTED_COMPONENT_STARTED - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Connected component traversal started event.
- connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector.MyTraversalListener
- connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform listeners that the traversal of the current connected component has finished.
- connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
- connectedComponents - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector.MyTraversalListener
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform listeners that a traversal of a new connected component has started.
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
- ConnectedComponentTraversalEvent - Class in org.jgrapht.event
-
A traversal event with respect to a connected component.
- ConnectedComponentTraversalEvent(Object, int) - Constructor for class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Creates a new ConnectedComponentTraversalEvent.
- connectedSet - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- 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 - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- connectedSets - Variable in class org.jgrapht.alg.connectivity.ConnectivityInspector
- 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.
- ConnectivityInspector.MyTraversalListener - Class in org.jgrapht.alg.connectivity
-
A traversal listener that groups all vertices according to to their containing connected set.
- ConsistentTerminationCriterion(BidirectionalAStarShortestPath.AStarSearchFrontier, BidirectionalAStarShortestPath.AStarSearchFrontier, double) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ConsistentTerminationCriterion
- constructCycle(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Finds cycle in the
policyGraph
and computes computes its mean. - constructor - Variable in class org.jgrapht.util.SupplierUtil.ConstructorSupplier
- ConstructorSupplier(Constructor<? extends T>) - Constructor for class org.jgrapht.util.SupplierUtil.ConstructorSupplier
- constructPolicyGraph(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Computes policy graph for
component
and stores result inpolicyGraph
andvertexDistance
. - consumer - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
Performs needed action with vertices.
- Consumers() - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.csv.CSVImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.dimacs.DIMACSImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.dot.DOTImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.gml.GmlImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.graph6.Graph6Sparse6Importer.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- Consumers(Graph<V, E>) - Constructor for class org.jgrapht.nio.json.JSONImporter.Consumers
- contains(Object) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- contains(Object) - Method in class org.jgrapht.graph.MaskEdgeSet
- contains(Object) - Method in class org.jgrapht.graph.MaskVertexSet
- contains(Object) - Method in class org.jgrapht.opt.graph.sparse.specifics.CompleteIntegerSet
- contains(Object) - Method in class org.jgrapht.util.UnmodifiableUnionSet
- contains(Object) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- contains(T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Checks if this data structure contains the
element
. - containsAll(Collection<?>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- containsAll(Collection<?>) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- containsBucketWith(V) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList
-
Checks whether there exists a bucket with the specified
vertex
. - containsCleanShortestOddHole(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a graph contains a clean shortest odd hole.
- containsEdge(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
- containsEdge(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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 class org.jgrapht.graph.guava.BaseNetworkAdapter
- 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(IntIntPair) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- containsEdge(IntIntPair) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- containsEdge(IntIntSortedPair) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- containsEdge(IntIntSortedPair) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- containsEdge(LongLongPair) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- containsEdge(LongLongSortedPair) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- containsEdge(EliasFanoIndexedMonotoneLongBigList, int, int) - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph
- containsEdge(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- containsEdge(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns
true
if this graph contains the specified edge. - containsEdge(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- containsEdge(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- containsEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- containsEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- containsEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- containsEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- containsEdge(Integer, Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- containsEdge(Long, Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- 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. - containsEdgeFast(int, int) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- containsEdgeFast(long, long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- containsJewel(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a graph contains a Jewel.
- 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.
- containsPyramid(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a graph contains a pyramid.
- containsShortestOddHole(Graph<V, E>, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether the vertex set of a graph without a vertex set X contains a shortest odd hole.
- containsVertex(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- containsVertex(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns
true
if this graph contains the specified vertex. - containsVertex(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- containsVertex(Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- containsVertex(Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- 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.guava.BaseGraphAdapter
- containsVertex(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- containsVertex(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- containsVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns
true
if this graph contains the specified vertex. - contractedTransitVerticesSet - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Set of contracted transit vertices.
- contractIndependentSet(int, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Contracts vertices in the current independent set.
- ContractionEdge(E1) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Constructs a contraction edge for the given original
edge
. - ContractionEdge(Pair<ContractionHierarchyPrecomputation.ContractionEdge<E1>, ContractionHierarchyPrecomputation.ContractionEdge<E1>>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Constrcuts a contraction edge for the given pair of bypassed edges.
- contractionGraph - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Contraction hierarchy for
graph
. - contractionGraph - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Contracted version of
graph
. - contractionGraph - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Contracted graph, which is used during the queries.
- contractionGraph - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Graph that stores the computed contraction hierarchy.
- contractionGraph - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Graph that stores the computed contraction hierarchy.
- contractionGraph - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Contracted graph.
- contractionGraph - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.ContractionHierarchyBFS
-
Search graph.
- contractionHierarchy - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Contraction hierarchy of
graph
. - contractionHierarchy - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Contraction hierarchy which is used to compute shortest paths.
- contractionHierarchy - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Contraction hierarchy which is used to compute transit node routing.
- contractionHierarchy - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Contraction hierarchy based on which this transit node routing was computed.
- contractionHierarchy - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Contraction hierarchy which is used to compute shortest paths.
- ContractionHierarchy(Graph<V, E>, Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, Map<V, ContractionHierarchyPrecomputation.ContractionVertex<V>>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Constructs a new instance for the given
graph
,contractionGraph
andcontractionMapping
. - ContractionHierarchyBFS(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.ContractionHierarchyBFS
-
Constructs a new instance of the algorithm for the given
graph
. - 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>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Constructs a new instance of the algorithm for a given
graph
andexecutor
. - ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<V,
E> - Class in org.jgrapht.alg.shortestpath -
Maintains search frontier during shortest path computation.
- ContractionHierarchyPrecomputation<V,
E> - Class in org.jgrapht.alg.shortestpath -
Parallel implementation of the contraction hierarchy route planning precomputation technique.
- ContractionHierarchyPrecomputation(Graph<V, E>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
andexecutor
. - ContractionHierarchyPrecomputation(Graph<V, E>, Supplier<Random>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
,randomSupplier
andexecutor
. - ContractionHierarchyPrecomputation(Graph<V, E>, Supplier<Random>, Supplier<AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Constructs a new instance of the algorithm for a given
graph
,parallelism
,randomSupplier
,shortcutsSearchHeapSupplier
andexecutor
. - 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.ContractionTask - Class in org.jgrapht.alg.shortestpath
-
Task that is used to perform computing of initial priorities, independent set and shortcuts, updating neighbours priorities and marking upward edges.
- ContractionHierarchyPrecomputation.ContractionVertex<V1> - Class in org.jgrapht.alg.shortestpath
-
Vertex for building the contraction hierarchy, which contains an original vertex from
graph
. - ContractionHierarchyPrecomputation.ToListConsumer - Class in org.jgrapht.alg.shortestpath
-
Caches passed shortcuts into a list.
- ContractionHierarchyPrecomputation.ToStatisticsConsumer - Class in org.jgrapht.alg.shortestpath
-
Uses passed shortcuts to compute
addedContractionEdges
andaddedOriginalEdges
statistics. - ContractionHierarchyPrecomputation.VertexData - Class in org.jgrapht.alg.shortestpath
-
Contains information of a vertex needed during the contraction.
- ContractionHierarchyPrecomputation.VertexStatistics - Class in org.jgrapht.alg.shortestpath
-
Contains statistics corresponding to a vertex in
contractionGraph
needed to compute its priority. - contractionLevel - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
-
Level that is assigned to this vertex during contraction which is used to determine upward edges in the hierarchy.
- contractionLevelCounter - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Counter of contraction level that should be assigned to vertex that is being contracted.
- contractionMapping - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Mapping from original to contracted vertices.
- contractionMapping - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Mapping from vertices in the original
graph
to vertices in thecontractionGraph
. - contractionMapping - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Mapping from original to contracted vertices.
- contractionMapping - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Mapping of the vertices in the original graph to the vertices in the contraction hierarchy graph.
- contractionMapping - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Mapping of the vertices in the original graph to the vertices in the contraction hierarchy graph.
- contractionMapping - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Mapping of vertices in the initial graph to contracted vertices.
- contractionMapping - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilter
-
Mapping of vertices in the initial graph to the vertices in the contraction graph.
- ContractionSearchFrontier(Graph<V, E>, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier
-
Constructs an instance of a search frontier for the given graph, heap supplier and
isDownwardEdge
function. - ContractionTask(int) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
Constructs an instance of the task for the given
taskId
. - ContractionVertex(V1, int) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
-
Constructs a new vertex for given original vertex
vertex
andvertexId
. - contractionVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
List of contracted vertices.
- contractVertex(ContractionHierarchyPrecomputation.ContractionVertex<V>, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Contracts provided
vertex
and assigns the specifiedcontractionLevel
to it. - contractVertices() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Performs contraction of vertices in
contractionGraph
. - convert(Set<V>, Set<E>, boolean) - Method in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Adds a new super vertex and connects it to all vertices in
vertices
. - convert(Graph<V, E>, Map<V, String>) - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Convert from a map representation to a list of sets.
- 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
- coordinates - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
-
The coordinates of this node.
- copy - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- copy() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Copy a vertex cover.
- copy() - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- copy() - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- copy() - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- copy() - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- copyAsSimpleGraph(Graph<V, E>) - Static method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Create a copy of a graph for internal use.
- copyFrom(CSVParser.FieldContext) - Method in class org.jgrapht.io.CSVParser.FieldContext
- copyFrom(GmlParser.KeyValuePairContext) - Method in class org.jgrapht.io.GmlParser.KeyValuePairContext
- copyFrom(CSVParser.FieldContext) - Method in class org.jgrapht.nio.csv.CSVParser.FieldContext
- copyFrom(GmlParser.KeyValuePairContext) - Method in class org.jgrapht.nio.gml.GmlParser.KeyValuePairContext
- copyless - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
- copyless - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- CopyOnDemandSet(Set<E>, ReadWriteLock, boolean) - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
Constructor for CopyOnDemandSet.
- copySet(Set<C>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Create a unmodifiable copy of the set.
- core1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- core2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- coreLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- 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.
- correctDistanceBackward(V) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Updates the distance of relevant predecessors of the input vertex.
- correctDistanceForward(V) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Updates the distance of provided vertex
v
in the shortest paths tree based on the current distances of its successors in theg
. - cost - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
the cost of the path
- cost - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
The cost of sending one unit of flow across this arc.
- cost - Variable in class org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlowImpl
-
The cost of the flow defined by the mapping
flowMap
- COST_INF - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
A cost which is considered to be infinite.
- costMap - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Arc cost mapping which is used to define arc cost function.
- costMatrix - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Cost matrix
- costs - Variable in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
- count - Variable in class org.jgrapht.alg.util.UnionFind
- count - Static variable in class org.jgrapht.util.RadixSort
- counter - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Variable that is used to determine whether a vertex has been labeled temporarily or permanently during Dijkstra's algorithm
- countHeight - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- 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
- create(String) - Static method in enum class org.jgrapht.nio.AttributeType
-
Create a type from a string representation
- create(String) - Static method in enum class org.jgrapht.nio.gexf.GEXFAttributeType
-
Create a type from a string representation
- createAttribute(Boolean) - Static method in class org.jgrapht.nio.DefaultAttribute
-
Create a boolean attribute
- createAttribute(Double) - Static method in class org.jgrapht.nio.DefaultAttribute
-
Create a double attribute
- createAttribute(Float) - Static method in class org.jgrapht.nio.DefaultAttribute
-
Create a float attribute
- createAttribute(Integer) - Static method in class org.jgrapht.nio.DefaultAttribute
-
Create an integer attribute
- createAttribute(Long) - Static method in class org.jgrapht.nio.DefaultAttribute
-
Create a long attribute
- createAttribute(String) - Static method in class org.jgrapht.nio.DefaultAttribute
-
Create a string attribute
- createBackwardEdge(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- 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.
- createEdge(MaximumFlowAlgorithmBase.VertexExtensionBase, MaximumFlowAlgorithmBase.VertexExtensionBase, E, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- createEdge(V, V) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
-
Create an edge.
- createEdge(V, V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Create an edge
- createEdges() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- 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.
- createEmptyPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BaseMultiObjectiveShortestPathAlgorithm
-
Create an empty path.
- createEmptyPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Create an empty path.
- createExtension() - Method in class org.jgrapht.alg.util.extension.ExtensionManager
-
Creates and returns an extension object.
- createGraphEdgeChangeEvent(int, E, V, V, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
- createGraphPath(List<E>, V, V) - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
- createGraphVertexChangeEvent(int, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
- createImprovementGraph() - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Initializes the improvement graph, i.e.
- createInitialTour() - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Create an initial tour
- 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.
- createIntegerTriple(Triple<String, String, Double>) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- 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.
- createLoops - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
- createNewNode(Map<V, BoyerMyrvoldPlanarityInspector.Node>, V, E, BoyerMyrvoldPlanarityInspector.Node, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Creates a new node by converting the
graphVertex
to the internal node representation. - createNodes(int, NetworkGenerator.NodeType) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Creates
num
nodes of the specifiedtype
. - 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. - createPath(ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, double, ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Builds shortest unpacked 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.
- createSCCVertexSetAndNumberVertices(GabowStrongConnectivityInspector.VertexNumber<V>) - Method in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- createSchema() - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- createSingleRootGraph(Graph<V, E>, Set<V>) - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- 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.
- createSupply() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Distributes supply units among source nodes.
- createThreadPoolExecutor(int) - Static method in class org.jgrapht.util.ConcurrencyUtil
-
Creates a
ThreadPoolExecutor
with fixed number of threads which is equal toparallelism
. - createVertexData() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
- createVertexNumber() - Method in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- createVertexOrder(ElementOrderMethod<V>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
-
Create the internal vertex order implementation.
- createVertexOrder(ElementOrderMethod<V>) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
-
Create the internal vertex order implementation.
- createVertexOrder(ElementOrderMethod<V>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Create the internal vertex order implementation.
- createVertexTraversalEvent(V) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Create a vertex traversal event.
- createVertices() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- createVerticesFromNodeIds() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- createXMLReader() - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- createXMLReader() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- createXMLReader() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
- creator - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- CREATOR - Static variable in class org.jgrapht.nio.gml.GmlExporter
- CREATOR - Static variable in class org.jgrapht.nio.json.JSONExporter
- CREATOR - Static variable in class org.jgrapht.nio.lemon.LemonExporter
- cross - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
- CrossComponentIterator<V,
E, - Class in org.jgrapht.traverseD> -
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
- CSRBooleanMatrix - Class in org.jgrapht.opt.graph.sparse.specifics
-
A sparse boolean matrix in Compressed Sparse Row (CSR) format.
- CSRBooleanMatrix(int, int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
-
Create a new CSR boolean matrix
- CSRBooleanMatrix.NonZerosIterator - Class in org.jgrapht.opt.graph.sparse.specifics
- CSVBaseListener - Class in org.jgrapht.io
-
This class provides an empty implementation of
CSVListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - CSVBaseListener - Class in org.jgrapht.nio.csv
-
This class provides an empty implementation of
CSVListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - CSVBaseListener() - Constructor for class org.jgrapht.io.CSVBaseListener
- CSVBaseListener() - Constructor for class org.jgrapht.nio.csv.CSVBaseListener
- CSVEventDrivenImporter - Class in org.jgrapht.nio.csv
-
Imports a graph from a CSV Format or any other Delimiter-separated value format.
- CSVEventDrivenImporter() - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Constructs a new importer using the
CSVFormat.ADJACENCY_LIST
format as default. - CSVEventDrivenImporter(CSVFormat) - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Constructs a new importer.
- CSVEventDrivenImporter(CSVFormat, char) - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Constructs a new importer.
- CSVEventDrivenImporter.AdjacencyListCSVListener - Class in org.jgrapht.nio.csv
- CSVEventDrivenImporter.MatrixCSVListener - Class in org.jgrapht.nio.csv
- CSVEventDrivenImporter.RowCSVListener - Class in org.jgrapht.nio.csv
- CSVEventDrivenImporter.ThrowingErrorListener - Class in org.jgrapht.nio.csv
- CSVExporter<V,
E> - Class in org.jgrapht.nio.csv -
Exports a graph into a CSV Format or any other Delimiter-separated value format.
- CSVExporter() - Constructor for class org.jgrapht.nio.csv.CSVExporter
-
Creates a new CSVExporter with
CSVFormat.ADJACENCY_LIST
format and integer name provider for the vertices. - CSVExporter(Function<V, String>, CSVFormat, char) - Constructor for class org.jgrapht.nio.csv.CSVExporter
-
Constructs a new CSVExporter with the given ID providers and format.
- CSVExporter(CSVFormat) - Constructor for class org.jgrapht.nio.csv.CSVExporter
-
Creates a new CSVExporter with integer id providers for the vertices.
- CSVExporter(CSVFormat, char) - Constructor for class org.jgrapht.nio.csv.CSVExporter
-
Creates a new CSVExporter with integer id providers for the vertices.
- CSVFormat - Enum Class in org.jgrapht.nio.csv
-
Supported CSV formats.
- CSVFormat() - Constructor for enum class org.jgrapht.nio.csv.CSVFormat
- CSVFormat.Parameter - Enum Class in org.jgrapht.nio.csv
-
Parameters that affect the behavior of CVS importers/exporters.
- CSVImporter<V,
E> - Class in org.jgrapht.nio.csv -
Imports a graph from a CSV Format or any other Delimiter-separated value format.
- CSVImporter() - Constructor for class org.jgrapht.nio.csv.CSVImporter
-
Constructs a new importer using the
CSVFormat.ADJACENCY_LIST
format as default. - CSVImporter(CSVFormat) - Constructor for class org.jgrapht.nio.csv.CSVImporter
-
Constructs a new importer.
- CSVImporter(CSVFormat, char) - Constructor for class org.jgrapht.nio.csv.CSVImporter
-
Constructs a new importer.
- CSVImporter.Consumers - Class in org.jgrapht.nio.csv
- CSVLexer - Class in org.jgrapht.io
- CSVLexer - Class in org.jgrapht.nio.csv
- CSVLexer(CharStream) - Constructor for class org.jgrapht.io.CSVLexer
- CSVLexer(CharStream) - Constructor for class org.jgrapht.nio.csv.CSVLexer
- CSVListener - Interface in org.jgrapht.io
-
This interface defines a complete listener for a parse tree produced by
CSVParser
. - CSVListener - Interface in org.jgrapht.nio.csv
-
This interface defines a complete listener for a parse tree produced by
CSVParser
. - CSVParser - Class in org.jgrapht.io
- CSVParser - Class in org.jgrapht.nio.csv
- CSVParser(TokenStream) - Constructor for class org.jgrapht.io.CSVParser
- CSVParser(TokenStream) - Constructor for class org.jgrapht.nio.csv.CSVParser
- CSVParser.EmptyFieldContext - Class in org.jgrapht.io
- CSVParser.EmptyFieldContext - Class in org.jgrapht.nio.csv
- CSVParser.FieldContext - Class in org.jgrapht.io
- CSVParser.FieldContext - Class in org.jgrapht.nio.csv
- CSVParser.FileContext - Class in org.jgrapht.io
- CSVParser.FileContext - Class in org.jgrapht.nio.csv
- CSVParser.HeaderContext - Class in org.jgrapht.io
- CSVParser.HeaderContext - Class in org.jgrapht.nio.csv
- CSVParser.RecordContext - Class in org.jgrapht.io
- CSVParser.RecordContext - Class in org.jgrapht.nio.csv
- CSVParser.StringFieldContext - Class in org.jgrapht.io
- CSVParser.StringFieldContext - Class in org.jgrapht.nio.csv
- CSVParser.TextFieldContext - Class in org.jgrapht.io
- CSVParser.TextFieldContext - Class in org.jgrapht.nio.csv
- cumul - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- cumul - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- CumulativeDegrees(int, Function<Integer, Integer>) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- CumulativeDegrees(Graph<Integer, E>, boolean, Function<Integer, Iterable<E>>) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- cumulativeIndegrees - Variable in class org.jgrapht.sux4j.SuccinctDirectedGraph
-
The cumulative list of indegrees.
- cumulativeIndegrees - Variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
The cumulative list of indegrees.
- cumulativeIndegrees - Variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
The cumulative list of indegrees (number of edges in reversed order, including loops).
- cumulativeIndegrees - Variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
The cumulative list of indegrees (number of edges in reversed order, including loops).
- cumulativeOutdegrees - Variable in class org.jgrapht.sux4j.SuccinctDirectedGraph
-
The cumulative list of outdegrees.
- cumulativeOutdegrees - Variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
The cumulative list of outdegrees.
- cumulativeOutdegrees - Variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
The cumulative list of outdegrees (number of edges in sorted order, including loops).
- cumulativeOutdegrees - Variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
The cumulative list of outdegrees (number of edges in sorted order, including loops).
- CumulativeSuccessors(Graph<Integer, E>, boolean, Function<Integer, Iterable<E>>) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- CumulativeSuccessors(Graph<Integer, E>, Function<Integer, Iterable<E>>, boolean) - Constructor for class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- cur - Variable in class org.jgrapht.traverse.DegeneracyOrderingIterator
- cur - Variable in class org.jgrapht.traverse.TopologicalOrderIterator
- cur - Variable in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- curPos - Variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix.NonZerosIterator
- current - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
Helper variable, is used to determine whether currentNode has been returned or not
- current - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
-
Variable to determine whether
currentNode
has been returned or not - current - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OrientDfsStackInfo
-
The current vertex of the dfs traversal
- current - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
The node this circulator will return next
- current - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.SearchInfo
-
The current node of the dfs traversal
- current - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Contains current vertex of the
graph
. - current - Variable in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Contains current vertex.
- currentArc - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- currentByte - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- currentConnectedSet - Variable in class org.jgrapht.alg.connectivity.ConnectivityInspector.MyTraversalListener
- currentCycleLength - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Length of a cycle found on current iteration.
- currentCycleVertex - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Vertex which is used to reconstruct the cycle found on current iteration.
- currentCycleWeight - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Total weight of a cycle found on current iteration.
- currentData - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- currentDataKey - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- currentDataValue - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- currentDir - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
-
The direction of the current edge
- currentDirection - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
The current direction of this iterator
- currentDirection - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Direction of the tree edge connecting this tree and the currently processed tree
- currentDirection - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
-
The direction of the
currentEdge
- currentEdge - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
This variable is used to quickly determine the edge between two trees during primal operations.
- currentEdge - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
-
The tree edge this iterator is currently on
- currentEdge - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- currentEdge - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- currentGraphElement - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- currentId - Static variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Variable for debug purposes
- currentIndex - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
Ordering index to be assigned to the next traversed vertex.
- currentKey - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- currentKey - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- currentNetwork - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- currentNode - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
The node this iterator is currently on
- currentNode - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
-
The node this iterator is currently on
- currentNode - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- currentNode - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- currentSink - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
The network sink of the current algorithm invocation.
- currentSink - Variable in class org.jgrapht.alg.flow.DinicMFImpl
-
Current sink vertex.
- currentSink - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
- currentSource - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
The network source of the current algorithm invocation.
- currentSource - Variable in class org.jgrapht.alg.flow.DinicMFImpl
-
Current source vertex.
- currentSource - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
- currentTimestamp - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
The value of the current iteration timestamp.
- currentTopoIndex - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- currentVertex - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- currentVertexName - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- currentVertices - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- curScore - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- cut(T, T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Removes an edge between the
first
andsecond
. - CUT_OFF - Static variable in class org.jgrapht.util.RadixSort
-
Deprecated, for removal: This API element is subject to removal in a future version.use
RadixSort.setCutOff(int)
instead - cutEdges - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- cutpoints - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- cutpoints - Variable in class org.jgrapht.alg.connectivity.BlockCutpointGraph
- cycle - Variable in exception class org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
- cycle(int, int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- cycleAugmentationLabels - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
mapping form all improvement graph vertices to their labels corresponding to the base graph for the CMST problem
- 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.
- cycleConsumer - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- cycleConsumer - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- cycleConsumer - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- CycleDetectedException() - Constructor for exception class org.jgrapht.alg.cycle.CycleDetector.CycleDetectedException
- 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.
- CycleDetector.CycleDetectedException - Exception Class in org.jgrapht.alg.cycle
-
Exception thrown internally when a cycle is detected during a yes/no cycle test.
- CycleDetector.ProbeIterator<V,
E> - Class in org.jgrapht.alg.cycle -
Version of DFS which maintains a backtracking path used to probe for cycles.
- CycleFoundException() - Constructor for exception class org.jgrapht.graph.DirectedAcyclicGraph.CycleFoundException
- cycles - Variable in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
- Cycles - Class in org.jgrapht.alg.cycle
-
Collection of helper methods related to cycles.
- Cycles() - Constructor for class org.jgrapht.alg.cycle.Cycles
- cycleSet - Variable in class org.jgrapht.alg.cycle.CycleDetector.ProbeIterator
D
- d - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- d - Variable in class org.jgrapht.generate.RandomRegularGraphGenerator
- d - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- d - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- dag() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed acyclic graph.
- DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.KatzCentrality
-
Damping factor default value.
- DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Damping factor default value.
- dampingFactor - Variable in class org.jgrapht.alg.scoring.PageRank
-
The damping factor
- Data(String, String) - Constructor for class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Data
- DATA - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- DATA - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- DATA_KEY - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- DATA_KEY - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- DEBUG - Static variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Whether to print debug related messages.
- DEBUG - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Debug variable
- DEBUG - Static variable in class org.jgrapht.alg.isomorphism.VF2State
- DEBUG - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
When set to true, verbose debugging output will be produced
- DEBUG - Static variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Whether to print debug messages
- decompose() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- decompose(MatchingAlgorithm.Matching<V, E>, boolean) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
-
Perform the decomposition, using a pre-calculated bipartite matching
- Decomposition(Set<V>, Set<V>, List<Set<V>>) - Constructor for class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
- decreaseResidualCapacity(int) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
Decreases residual capacity of this arc by
value
units of flow. - decrement() - Method in class org.jgrapht.util.ModifiableInteger
-
Subtracts one from the value of this modifiable integer.
- DEFAULT - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- DEFAULT - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- DEFAULT_ADD_INSTEAD_OF_REWIRE - Static variable in class org.jgrapht.generate.WattsStrogatzGraphGenerator
- DEFAULT_ALLOW_LOOPS - Static variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- DEFAULT_ALLOW_LOOPS - Static variable in class org.jgrapht.generate.GnpRandomGraphGenerator
- DEFAULT_ALLOW_MULTIPLE_EDGES - Static variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- DEFAULT_ALLOW_SELFLOOPS - Static variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- DEFAULT_DELIMITER - Static variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter
- DEFAULT_DELIMITER - Static variable in class org.jgrapht.nio.csv.CSVExporter
- DEFAULT_DELIMITER - Static variable in class org.jgrapht.nio.csv.CSVImporter
- DEFAULT_DIMACS_FORMAT - Static variable in class org.jgrapht.nio.dimacs.DIMACSExporter
-
The default format used by the exporter.
- DEFAULT_DUAL_UPDATE_TYPE - Static variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Default dual updates strategy
- 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_EDGES_COLLECTION_NAME - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Default name for the edges collection
- DEFAULT_EDGES_COLLECTION_NAME - Static variable in class org.jgrapht.nio.json.JSONExporter
-
Default name for the edges collection
- DEFAULT_EDGES_COLLECTION_NAME - Static variable in class org.jgrapht.nio.json.JSONImporter
-
Default name for the edges collection
- DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Default tolerance.
- DEFAULT_EPSILON - Static variable in interface org.jgrapht.alg.interfaces.MatchingAlgorithm
-
Default tolerance used by algorithms comparing floating point values.
- DEFAULT_EPSILON - Static variable in class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Default tolerance used by the comparator.
- DEFAULT_GRAPH_ID - Static variable in class org.jgrapht.nio.dot.DOTExporter
-
Default graph id used by the exporter.
- DEFAULT_GRAPH_ID_KEY - Static variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter
-
Default key used for the graph ID.
- DEFAULT_GRAPH6SPARSE6_FORMAT - Static variable in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
-
The default format used by the exporter.
- DEFAULT_INITIALIZATION_TYPE - Static variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Default algorithm initialization type
- 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_PARALLELISM - Static variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Default value for
DeltaSteppingShortestPath.parallelism
. - 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_UPDATE_DUALS_AFTER - Static variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Default value for the flag
BlossomVOptions.updateDualsAfter
- DEFAULT_UPDATE_DUALS_BEFORE - Static variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Default value for the flag
BlossomVOptions.updateDualsBefore
- 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_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.csv.CSVImporter
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.dimacs.DIMACSImporter
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.dot.DOTImporter
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.gml.GmlImporter
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.graph6.Graph6Sparse6Importer
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.graphml.GraphMLImporter
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Default key used for vertex ID.
- DEFAULT_VERTEX_ID_KEY - Static variable in class org.jgrapht.nio.json.JSONImporter
-
Default key used for vertex ID.
- DEFAULT_VERTICES_COLLECTION_NAME - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Default name for the vertices collection
- DEFAULT_VERTICES_COLLECTION_NAME - Static variable in class org.jgrapht.nio.json.JSONExporter
-
Default name for the vertices collection
- DEFAULT_VERTICES_COLLECTION_NAME - Static variable in class org.jgrapht.nio.json.JSONImporter
-
Default name for the vertices collection
- DEFAULT_WEIGHT_KEY - Static variable in class org.jgrapht.nio.csv.CSVImporter
- DEFAULT_WEIGHTED_EDGE_SUPPLIER - Static variable in class org.jgrapht.util.SupplierUtil
-
Supplier for
DefaultWeightedEdge
. - DefaultAttribute<T> - Class in org.jgrapht.nio
-
Default implementation of an attribute.
- DefaultAttribute(T, AttributeType) - Constructor for class org.jgrapht.nio.DefaultAttribute
-
Create a new attribute
- 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
- DefaultGraphIterables<V,
E> - Class in org.jgrapht.graph -
The default implementation of the graph iterables which simply delegates to the set implementations.
- DefaultGraphIterables() - Constructor for class org.jgrapht.graph.DefaultGraphIterables
-
Create new graph iterables
- DefaultGraphIterables(Graph<V, E>) - Constructor for class org.jgrapht.graph.DefaultGraphIterables
-
Create new graph iterables
- 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(boolean, boolean, boolean, boolean, boolean, boolean, boolean) - Constructor for class org.jgrapht.graph.DefaultGraphType
- 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.
- DefaultListenableGraph.FlyweightEdgeEvent<VV,
EE> - Class in org.jgrapht.graph -
A reuseable edge event.
- DefaultListenableGraph.FlyweightVertexEvent<VV> - Class in org.jgrapht.graph
-
A reuseable vertex event.
- 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
. - DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl<V,
E> - Class in org.jgrapht.alg.shortestpath -
Implementation of the
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
. - DefaultManyToManyShortestPathsImpl(Set<V>, Set<V>, Map<V, Map<V, GraphPath<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl
-
Constructs an instance of the algorithm for the given
sources
,targets
andpathsMap
. - 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
- defaultValue - Variable in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- defaultValue - Variable in class org.jgrapht.nio.gexf.GEXFExporter.AttributeDetails
- defaultValue - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- defaultValue - Variable in class org.jgrapht.nio.graphml.GraphMLExporter.AttributeDetails
- defaultWeight - Variable in class org.jgrapht.nio.dimacs.DIMACSImporter
- DefaultWeightedEdge - Class in org.jgrapht.graph
-
A default implementation for edges in a weighted graph.
- DefaultWeightedEdge() - Constructor for class org.jgrapht.graph.DefaultWeightedEdge
- degeneracy - Variable in class org.jgrapht.alg.scoring.Coreness
- 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.color.SaturationDegreeColoring.DSaturComparator
- degree - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
degree of this vertex
- degreeOf - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- degreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- degreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- degreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
- degreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- degreeOf(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns the degree of the specified vertex.
- degreeOf(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph
- degreeOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- degreeOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- degreeOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- degreeOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- degreeOf(Long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- degreeOf(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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.guava.BaseGraphAdapter
- degreeOf(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- degreeOf(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- degreeOf(V) - Method in interface org.jgrapht.GraphIterables
-
Returns the degree of the specified vertex.
- degrees - Variable in class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
- degrees - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- degrees - Variable in class org.jgrapht.traverse.DegeneracyOrderingIterator
- delegate - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality.UnweightedQueue
- delegate - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- delegate - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality.UnweightedQueue
- delegate - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- delegate - Variable in class org.jgrapht.graph.GraphDelegator
- delete(SaturationDegreeColoring.HeapHandle) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- deleteMin() - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- DELIM - Static variable in class org.jgrapht.nio.gml.GmlExporter
- DELIM - Static variable in class org.jgrapht.nio.lemon.LemonExporter
- delimiter - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter
- delimiter - Variable in class org.jgrapht.nio.csv.CSVExporter
- delimiter - Variable in class org.jgrapht.nio.csv.CSVImporter
- delimiter - Variable in class org.jgrapht.nio.matrix.MatrixExporter
- delta - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
The bucket width.
- delta - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
-
$Delta(edge)$ value.
- delta(E) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Calculates the $\delta(e)$ value for a given edge
e
. - DELTA_MUST_BE_NON_NEGATIVE - Static variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Error message for reporting that delta must be positive.
- deltaIn - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
In-degree bias used for Alpha and Beta
- deltaOut - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Out-degree bias used for Beta and Gamma
- 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>, double) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Deprecated.
- DeltaSteppingShortestPath(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Deprecated.
- DeltaSteppingShortestPath(Graph<V, E>, double, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph, delta and
executor
. - DeltaSteppingShortestPath(Graph<V, E>, double, ThreadPoolExecutor, Comparator<V>) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph, delta,
executor
andvertexComparator
. - DeltaSteppingShortestPath(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Deprecated.replaced with
DeltaSteppingShortestPath(Graph, ThreadPoolExecutor)
- DeltaSteppingShortestPath(Graph<V, E>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given graph and
executor
. - DeltaSteppingShortestPath(Graph<V, E>, ThreadPoolExecutor, Comparator<V>) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Constructs a new instance of the algorithm for a given
graph
,executor
andvertexComparator
. - DeltaSteppingShortestPath.HeavyRelaxTask - Class in org.jgrapht.alg.shortestpath
-
Task that is submitted to the
DeltaSteppingShortestPath.completionService
during shortest path computation for heavy relax requests relaxation. - DeltaSteppingShortestPath.LightRelaxTask - Class in org.jgrapht.alg.shortestpath
-
Task that is submitted to the
DeltaSteppingShortestPath.completionService
during shortest path computation for light relax requests relaxation. - DeltaSteppingShortestPath.MaxEdgeWeightTask - Class in org.jgrapht.alg.shortestpath
-
Is used during the algorithm to compute maximum edge weight of the
BaseShortestPathAlgorithm.graph
. - 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.
- DenseEdmondsMaximumCardinalityMatching.Levels - Class in org.jgrapht.alg.matching
-
Storage of the forest, even and odd levels.
- DenseEdmondsMaximumCardinalityMatching.SimpleMatching - Class in org.jgrapht.alg.matching
-
Simple representation of a matching
- densestSubgraph - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- depth - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- depth - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- depth - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
-
Hierarchical depth of a vertex measured in the number of hops that can be performed while descending into the lower levels of the hierarchy.
- depth - Variable in class org.jgrapht.traverse.BreadthFirstIterator.SearchNodeData
- 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 Class in org.jgrapht.traverse
-
Standard vertex visit state enumeration.
- desarguesGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DESCENDING - Enum constant in enum class org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Deprecated.
- descendingIterator() - Method in class org.jgrapht.util.DoublyLinkedList
- description - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- 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(int) - Method in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
-
Find all vertex disjoint augmenting paths of length dist[DUMMY].
- dfs(int, int) - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- dfs(DinicMFImpl.VertexExtension, double) - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Finds a blocking flow in the network.
- dfs(V, V) - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Performs a depth-first search, starting from vertex v
- dfsB(V, Set<V>, DirectedAcyclicGraph.VisitedStrategy, DirectedAcyclicGraph.Region) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Depth first search backward, building up the set (db) of back-connected vertices in the Affected Region
- dfsF(V, Set<V>, DirectedAcyclicGraph.VisitedStrategy, DirectedAcyclicGraph.Region) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Depth first search forward, building up the set (df) of forward-connected vertices in the Affected Region
- dfsIndex - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The dfs index of this node in the graph.
- dfsIterative(int, int) - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
An iterative dfs implementation for computing the paths.
- dfsIterative(int, int) - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- dfsTreeRoots - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
List of the dfs tree roots of the
graph
. - dfsVisit(List<V>, Map<V, Boolean>, V, V, V) - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Computes some cycle in the graph on the vertices from the domain of the map
visited
. - dfsVisit(GabowStrongConnectivityInspector.VertexNumber<V>) - Method in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- dfsVisit(Graph<V, E>, KosarajuStrongConnectivityInspector.VertexData<V>, Set<V>) - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
- diagnostic - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- DIAGNOSTIC_ENABLED - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- diameter - Variable in class org.jgrapht.alg.shortestpath.GraphMeasurer
- diamondGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DIGRAPH - Static variable in class org.jgrapht.io.DOTLexer
- DIGRAPH - Static variable in class org.jgrapht.io.DOTParser
- DIGRAPH - Static variable in class org.jgrapht.nio.dot.DOTLexer
- DIGRAPH - Static variable in class org.jgrapht.nio.dot.DOTParser
- DIGRAPH() - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- DIGRAPH() - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- DijkstraClosestFirstIterator<V,
E> - Class in org.jgrapht.alg.shortestpath -
A light-weight version of the closest-first iterator for a directed or undirected graphs.
- DijkstraClosestFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
-
Creates a new iterator for the specified graph.
- DijkstraClosestFirstIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
-
Creates a new radius-bounded iterator for the specified graph.
- DijkstraClosestFirstIterator(Graph<V, E>, V, double, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
-
Creates a new radius-bounded iterator for the specified graph.
- DijkstraClosestFirstIterator(Graph<V, E>, V, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
-
Creates a new iterator for the specified graph.
- 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
. - DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl - Class in org.jgrapht.alg.shortestpath
-
Implementation of the
ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
. - DijkstraManyToManyShortestPathsImpl(Set<V>, Set<V>, boolean, Map<V, ShortestPathAlgorithm.SingleSourcePaths<V, E>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl
-
Constructs an instance of the algorithm for the given
sources
,targets
,reversed
andsearchSpaces
. - DijkstraSearchFrontier(Graph<V, E>, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- 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.
- dim - Variable in class org.jgrapht.generate.HyperCubeGraphGenerator
- DIMACSEventDrivenImporter - Class in org.jgrapht.nio.dimacs
-
A generic importer using consumers for DIMACS format.
- DIMACSEventDrivenImporter() - Constructor for class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
-
Construct a new importer
- DIMACSExporter<V,
E> - Class in org.jgrapht.nio.dimacs -
Exports a graph into DIMACS format.
- DIMACSExporter() - Constructor for class org.jgrapht.nio.dimacs.DIMACSExporter
-
Constructs a new exporter.
- DIMACSExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.dimacs.DIMACSExporter
-
Constructs a new exporter with a given vertex ID provider.
- DIMACSExporter(Function<V, String>, DIMACSFormat) - Constructor for class org.jgrapht.nio.dimacs.DIMACSExporter
-
Constructs a new exporter with a given vertex ID provider.
- DIMACSExporter.Parameter - Enum Class in org.jgrapht.nio.dimacs
-
Parameters that affect the behavior of the
DIMACSExporter
exporter. - DIMACSFormat - Enum Class in org.jgrapht.nio.dimacs
-
DIMACS challenge format.
- DIMACSFormat(String, String) - Constructor for enum class org.jgrapht.nio.dimacs.DIMACSFormat
- DIMACSImporter<V,
E> - Class in org.jgrapht.nio.dimacs -
Imports a graph specified in DIMACS format.
- DIMACSImporter() - Constructor for class org.jgrapht.nio.dimacs.DIMACSImporter
-
Construct a new DIMACSImporter
- DIMACSImporter(double) - Constructor for class org.jgrapht.nio.dimacs.DIMACSImporter
-
Construct a new DIMACSImporter
- DIMACSImporter.Consumers - Class in org.jgrapht.nio.dimacs
- dimension - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- DIMENSION - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- 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.
- DinicMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
-
Extension for vertex class.
- directed - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
- directed - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- directed - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- directed - Variable in class org.jgrapht.graph.DefaultGraphType
- 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.
- DIRECTED_GRAPH_EDGEOP - Static variable in class org.jgrapht.nio.dot.DOTUtils
-
Edge operation for directed graphs.
- DIRECTED_GRAPH_KEYWORD - Static variable in class org.jgrapht.nio.dot.DOTUtils
-
Keyword for directed graphs.
- 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>, boolean, boolean, GraphSpecificsStrategy<V, E>) - 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(Supplier<V>, Supplier<E>, DirectedAcyclicGraph.VisitedStrategyFactory, DirectedAcyclicGraph.TopoOrderMap<V>, boolean, boolean, GraphSpecificsStrategy<V, E>) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph.CycleFoundException - Exception Class in org.jgrapht.graph
-
Exception used in dfsF when a cycle is found
- DirectedAcyclicGraph.Region - Class in org.jgrapht.graph
-
An inclusive range of indices: [start, finish].
- DirectedAcyclicGraph.TopoComparator - Class in org.jgrapht.graph
-
Comparator for vertices based on their topological ordering
- DirectedAcyclicGraph.TopoIterator - Class in org.jgrapht.graph
-
An iterator which follows topological order
- 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.
- DirectedEdgeContainer(EdgeSetFactory<V, E>, V) - Constructor for class org.jgrapht.graph.specifics.DirectedEdgeContainer
- 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
. - DirectedScaleFreeGraphGenerator.Direction - Enum Class in org.jgrapht.generate
-
An enum to indicate the vertex selection using its inDegree or outDegree
- 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.
- Direction() - Constructor for enum class org.jgrapht.generate.DirectedScaleFreeGraphGenerator.Direction
- dirty - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- discharge(PushRelabelMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- discharges - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- dischargesCounter - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- discTime - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- DISPLAY_DATA_TYPE - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- displayDataType - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- dist - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- dist - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- dist - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- dist - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- dist - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- distance - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
The distance of this vertex to a terminal vertex (network source or sink).
- distance - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.BucketEntry
-
Distance from a vertex this entry is created for to
target
. - distance - Variable in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
- distance - Variable in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree.VertexInfo
- distance - Variable in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- distanceAndMiddleVertexMap - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Stores pair of path weight and middle vertex for each source-target pair.
- distanceAndPredecessorMap - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Map to store predecessor for each vertex in the shortest path tree.
- distanceAndPredecessorMap - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Shortest paths tree in the edge reversed graph
graph
rooted atsink
. - distanceAndPredecessorMap - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
-
Shortest paths tree in the edge reversed graph
graph
rooted atsink
. - distanceToCenter - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
For every vertex stores distance to the closest Voronoi cell center.
- DistinctGraphObject(T, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector.DistinctGraphObject
- Distributor<K> - Class in org.jgrapht.generate.netgen
-
Distributes value units among keys given lower and upper bound constraints.
- Distributor() - Constructor for class org.jgrapht.generate.netgen.Distributor
-
Creates a Distributor using random seed.
- Distributor(long) - Constructor for class org.jgrapht.generate.netgen.Distributor
-
Creates a distributor using the specified
seed
. - Distributor(Random) - Constructor for class org.jgrapht.generate.netgen.Distributor
-
Creates a distributor which uses the random number generatow
rng
. - divideByTwo - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- dodecahedronGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- dominates(double[], double[]) - Static method in class org.jgrapht.alg.shortestpath.MartinShortestPath
-
Return whether a vector dominates another.
- DONT_ALLOW_MULTIPLE_EDGES_KEYWORD - Static variable in class org.jgrapht.nio.dot.DOTUtils
-
Keyword for representing strict graphs.
- DOT_NUMBER - Static variable in class org.jgrapht.nio.dot.DOTUtils
- DOTBaseListener - Class in org.jgrapht.io
-
This class provides an empty implementation of
DOTListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - DOTBaseListener - Class in org.jgrapht.nio.dot
-
This class provides an empty implementation of
DOTListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - DOTBaseListener() - Constructor for class org.jgrapht.io.DOTBaseListener
- DOTBaseListener() - Constructor for class org.jgrapht.nio.dot.DOTBaseListener
- DOTEventDrivenImporter - Class in org.jgrapht.nio.dot
-
Import a graph from a DOT file.
- DOTEventDrivenImporter() - Constructor for class org.jgrapht.nio.dot.DOTEventDrivenImporter
-
Constructs a new importer.
- DOTEventDrivenImporter(boolean, boolean) - Constructor for class org.jgrapht.nio.dot.DOTEventDrivenImporter
-
Constructs a new importer.
- DOTEventDrivenImporter.NotifyDOTListener - Class in org.jgrapht.nio.dot
- DOTEventDrivenImporter.State - Class in org.jgrapht.nio.dot
- DOTEventDrivenImporter.SubgraphScope - Class in org.jgrapht.nio.dot
- DOTEventDrivenImporter.ThrowingErrorListener - Class in org.jgrapht.nio.dot
- DOTExporter<V,
E> - Class in org.jgrapht.nio.dot -
Exports a graph into a DOT file.
- DOTExporter() - Constructor for class org.jgrapht.nio.dot.DOTExporter
-
Constructs a new DOTExporter object with an integer id provider.
- DOTExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.dot.DOTExporter
-
Constructs a new DOTExporter object with the given id provider.
- DOTImporter<V,
E> - Class in org.jgrapht.nio.dot -
Import a graph from a DOT file.
- DOTImporter() - Constructor for class org.jgrapht.nio.dot.DOTImporter
-
Constructs a new importer.
- DOTImporter.Consumers - Class in org.jgrapht.nio.dot
- DOTLexer - Class in org.jgrapht.io
- DOTLexer - Class in org.jgrapht.nio.dot
- DOTLexer(CharStream) - Constructor for class org.jgrapht.io.DOTLexer
- DOTLexer(CharStream) - Constructor for class org.jgrapht.nio.dot.DOTLexer
- DOTListener - Interface in org.jgrapht.io
-
This interface defines a complete listener for a parse tree produced by
DOTParser
. - DOTListener - Interface in org.jgrapht.nio.dot
-
This interface defines a complete listener for a parse tree produced by
DOTParser
. - DOTParser - Class in org.jgrapht.io
- DOTParser - Class in org.jgrapht.nio.dot
- DOTParser(TokenStream) - Constructor for class org.jgrapht.io.DOTParser
- DOTParser(TokenStream) - Constructor for class org.jgrapht.nio.dot.DOTParser
- DOTParser.AListContext - Class in org.jgrapht.io
- DOTParser.AListContext - Class in org.jgrapht.nio.dot
- DOTParser.AttributesListContext - Class in org.jgrapht.io
- DOTParser.AttributesListContext - Class in org.jgrapht.nio.dot
- DOTParser.AttributeStatementContext - Class in org.jgrapht.io
- DOTParser.AttributeStatementContext - Class in org.jgrapht.nio.dot
- DOTParser.CompoundStatementContext - Class in org.jgrapht.io
- DOTParser.CompoundStatementContext - Class in org.jgrapht.nio.dot
- DOTParser.EdgeStatementContext - Class in org.jgrapht.io
- DOTParser.EdgeStatementContext - Class in org.jgrapht.nio.dot
- DOTParser.GraphContext - Class in org.jgrapht.io
- DOTParser.GraphContext - Class in org.jgrapht.nio.dot
- DOTParser.GraphHeaderContext - Class in org.jgrapht.io
- DOTParser.GraphHeaderContext - Class in org.jgrapht.nio.dot
- DOTParser.GraphIdentifierContext - Class in org.jgrapht.io
- DOTParser.GraphIdentifierContext - Class in org.jgrapht.nio.dot
- DOTParser.IdentifierContext - Class in org.jgrapht.io
- DOTParser.IdentifierContext - Class in org.jgrapht.nio.dot
- DOTParser.IdentifierPairContext - Class in org.jgrapht.io
- DOTParser.IdentifierPairContext - Class in org.jgrapht.nio.dot
- DOTParser.IdentifierPairStatementContext - Class in org.jgrapht.io
- DOTParser.IdentifierPairStatementContext - Class in org.jgrapht.nio.dot
- DOTParser.NodeIdentifierContext - Class in org.jgrapht.io
- DOTParser.NodeIdentifierContext - Class in org.jgrapht.nio.dot
- DOTParser.NodeStatementContext - Class in org.jgrapht.io
- DOTParser.NodeStatementContext - Class in org.jgrapht.nio.dot
- DOTParser.NodeStatementNoAttributesContext - Class in org.jgrapht.io
- DOTParser.NodeStatementNoAttributesContext - Class in org.jgrapht.nio.dot
- DOTParser.PortContext - Class in org.jgrapht.io
- DOTParser.PortContext - Class in org.jgrapht.nio.dot
- DOTParser.StatementContext - Class in org.jgrapht.io
- DOTParser.StatementContext - Class in org.jgrapht.nio.dot
- DOTParser.SubgraphStatementContext - Class in org.jgrapht.io
- DOTParser.SubgraphStatementContext - Class in org.jgrapht.nio.dot
- DOTUtils - Class in org.jgrapht.nio.dot
-
Class with DOT format related utilities.
- DOTUtils() - Constructor for class org.jgrapht.nio.dot.DOTUtils
- DOUBLE - Enum constant in enum class org.jgrapht.nio.AttributeType
- DOUBLE - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- DOUBLE_QUOTE - Static variable in class org.jgrapht.nio.dot.DOTUtils
- 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() - Constructor for class org.jgrapht.util.DoublyLinkedList
- DoublyLinkedList.ListNode<V> - Interface in org.jgrapht.util
-
Container for the elements stored in a
DoublyLinkedList
. - DoublyLinkedList.ListNodeImpl<V> - Class in org.jgrapht.util
-
The default
DoublyLinkedList.ListNode
implementation that enables checks and enforcement of a single container list policy. - DoublyLinkedList.ListNodeIterator<E> - Interface in org.jgrapht.util
- DoublyLinkedList.ListNodeIteratorImpl - Class in org.jgrapht.util
-
An implementation of the
DoublyLinkedList.ListNodeIterator
interface. - DoublyLinkedList.NodeIterator<E> - Interface in org.jgrapht.util
- downEdges - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The list containing the edges from descendants of this node in the dfs tree.
- doyleGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
-
Generate the Doyle Graph
- doyleHash(int, int) - Method in class org.jgrapht.generate.NamedGraphGenerator
- drawableArea - Variable in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- drawFirstPartition(Graph<V, E>, List<V>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
- drawSecondPartition(Graph<V, E>, List<V>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.BarycenterGreedyTwoLayeredBipartiteLayout2D
- drawSecondPartition(Graph<V, E>, List<V>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.MedianGreedyTwoLayeredBipartiteLayout2D
- drawSecondPartition(Graph<V, E>, List<V>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
- DSaturComparator(Map<V, Integer>, Map<V, Integer>) - Constructor for class org.jgrapht.alg.color.SaturationDegreeColoring.DSaturComparator
- DSV_CR - Static variable in class org.jgrapht.nio.csv.DSVUtils
- DSV_LF - Static variable in class org.jgrapht.nio.csv.DSVUtils
- DSV_QUOTE - Static variable in class org.jgrapht.nio.csv.DSVUtils
- DSV_QUOTE_AS_STRING - Static variable in class org.jgrapht.nio.csv.DSVUtils
- DSVUtils - Class in org.jgrapht.nio.csv
-
Helper utilities for escaping and unescaping Delimiter-separated values.
- DSVUtils() - Constructor for class org.jgrapht.nio.csv.DSVUtils
- dual - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Current dual variable of this node.
- dualSolution - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Defines solution to the dual linear program formulated on the
graph
- 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
- dualUpdater - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Performs dual updates using the strategy defined by the
options
- dualUpdatesTime - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Time spent during the dual update phase (either single tree or global) in nanoseconds
- dualUpdateStrategy - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
What greedy strategy to use to perform a global dual update
- DualUpdateStrategy() - Constructor for enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
- dualVariables - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
-
Mapping from sets of vertices of odd cardinality to their dual variables.
- 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
- DUMMY - Static variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- dump() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- dumpCapacities() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Dumps the network edge capacities to the underlying graph.
- dumpCosts() - Method in interface org.jgrapht.generate.netgen.BipartiteMatchingProblem
-
Dumps the problem edge costs to the underlying graph.
- dürerGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Dürer Graph.
- DUTCHWINDMILL - Enum constant in enum class org.jgrapht.generate.WindmillGraphsGenerator.Mode
- DynamicProgrammingPathSolver() - Constructor for class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
E
- e - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- e - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- e - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- eccentricityMap - Variable in class org.jgrapht.alg.shortestpath.GraphMeasurer
- edge - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Original edge in
graph
. - edge - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
-
Edge this vertex corresponds to.
- 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 - Variable in enum class org.jgrapht.nio.dimacs.DIMACSFormat
- edge - Variable in class org.jgrapht.traverse.BreadthFirstIterator.SearchNodeData
- Edge(E, BoyerMyrvoldPlanarityInspector.Node) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Creates a new tree edge.
- Edge(E, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Creates a new edge.
- Edge(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Creates a new short-circuit edge with no counterpart in
graph
. - EDGE - Enum constant in enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
- EDGE - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.KeyTarget
- EDGE - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- EDGE - Static variable in class org.jgrapht.io.DOTLexer
- EDGE - Static variable in class org.jgrapht.io.DOTParser
- EDGE - Static variable in class org.jgrapht.nio.dot.DOTLexer
- EDGE - Static variable in class org.jgrapht.nio.dot.DOTParser
- EDGE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- EDGE - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- EDGE - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- EDGE - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- EDGE() - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- EDGE() - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- EDGE_ADDED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge added event.
- EDGE_ATTRS - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- EDGE_DATA_FORMAT - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- EDGE_ID - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- EDGE_ID - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- EDGE_LABEL_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.GraphMLExporter
- EDGE_LIST - Enum constant in enum class org.jgrapht.nio.csv.CSVFormat
-
Edge list
- EDGE_REMOVED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge removed event.
- EDGE_RESERVED_ATTRIBUTES - Static variable in class org.jgrapht.nio.gexf.GEXFExporter
- EDGE_SOURCE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- EDGE_SOURCE - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- EDGE_SOURCE - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- EDGE_TARGET - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- EDGE_TARGET - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- EDGE_TARGET - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- EDGE_WEIGHT - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- EDGE_WEIGHT_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- EDGE_WEIGHT_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.GraphMLExporter
- EDGE_WEIGHT_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.GraphMLImporter
- EDGE_WEIGHT_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
- EDGE_WEIGHT_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
- EDGE_WEIGHT_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
- EDGE_WEIGHT_FORMAT - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- EDGE_WEIGHT_IS_NOT_SUPPORTED - Static variable in class org.jgrapht.graph.AsUnweightedGraph
- EDGE_WEIGHT_TYPE - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- EDGE_WEIGHT_UPDATED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge weight updated event.
- EDGE_WEIGHTS - Enum constant in enum class org.jgrapht.nio.csv.CSVFormat.Parameter
-
Whether to import/export edge weights.
- 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.
- edgeAdded(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.graph.AsSubgraph.BaseGraphListener
-
Notifies that an edge has been added to the graph.
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- edgeAttributeConsumer - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- edgeAttributeConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- edgeAttributeProvider - Variable in class org.jgrapht.nio.BaseExporter
-
An edge attribute provider
- edgeAttrs - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- 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
- EdgeBetweennessCentrality<V,
E> - Class in org.jgrapht.alg.scoring -
Edge betweenness centrality.
- EdgeBetweennessCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
-
Construct a new instance.
- EdgeBetweennessCentrality(Graph<V, E>, EdgeBetweennessCentrality.OverflowStrategy) - Constructor for class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
-
Construct a new instance.
- EdgeBetweennessCentrality(Graph<V, E>, EdgeBetweennessCentrality.OverflowStrategy, Iterable<V>) - Constructor for class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
-
Construct a new instance.
- EdgeBetweennessCentrality.Algorithm - Class in org.jgrapht.alg.scoring
- EdgeBetweennessCentrality.OverflowStrategy - Enum Class in org.jgrapht.alg.scoring
-
Strategy followed when counting paths.
- EdgeBetweennessCentrality.WeightedAlgorithm - Class in org.jgrapht.alg.scoring
- edgeCache - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- edgeClass(Class<E1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the edge class.
- edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2State
- edgeConsumer - Variable in class org.jgrapht.nio.csv.CSVImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.dimacs.DIMACSImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Importer.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- edgeConsumer - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- edgeConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- edgeCount() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Get number of vertex edges
- edgeCount() - Method in interface org.jgrapht.GraphIterables
-
Return the number of edges in the graph.
- edgeCount() - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- edgeCount() - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- edgeCount() - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- edgeCount() - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- edgeCountConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- edgeDataFormat - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- EdgeDegreeComparator() - Constructor for class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching.EdgeDegreeComparator
- edgeExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- edgeExtensionsFactory - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Edge extension factory used during initialization.
- edgeExtensionsFactory - Variable in class org.jgrapht.alg.flow.DinicMFImpl
- edgeExtensionsFactory - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
- edgeExtensionsFactory - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- edgeFromParent - Variable in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree.VertexInfo
- edgeIdProvider - Variable in class org.jgrapht.nio.BaseExporter
-
An edge id provider
- edgeLabelAttributeName - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
- edgeList - Variable in class org.jgrapht.graph.GraphWalk
- edgeMap - Variable in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- edgeMask - Variable in class org.jgrapht.graph.MaskEdgeSet
- edgeMask - Variable in class org.jgrapht.graph.MaskSubgraph
- edgeMinDistancesBackwards(Set<V>, Integer) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Compute the minimum number of edges in a path to the targets through each edge, so long as it is not greater than a bound.
- edgeModified(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheAccess
-
Clear the copies which the edge to be added or removed can affect.
- EdgeNode(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode, E, HierholzerEulerianCycle.EdgeNode, HierholzerEulerianCycle.EdgeNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
-
Create EdgeNode
- edgeNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Number of edges in the graph
- edgeNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Number of edges in the graph
- 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.
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.graph.AsSubgraph.BaseGraphListener
-
Notifies that an edge has been removed from the graph.
- EdgeReversedGraph<V,
E> - Class in org.jgrapht.graph -
Provides an edge-reversed view $g'$ of a directed graph $g$.
- EdgeReversedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.EdgeReversedGraph
-
Creates a new EdgeReversedGraph.
- edges - Variable in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- edges - Variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- edges - Variable in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- edges - Variable in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- edges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
An array of edges that will be passed to the resulting state object
- edges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
An array of edges of the graph
- edges - Variable in class org.jgrapht.graph.MaskSubgraph
- edges - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- edges() - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable over the edges of the graph.
- edges() - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- edges() - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- edgesCollectionName - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter
- edgesCollectionName - Variable in class org.jgrapht.nio.json.JSONExporter
- edgesCollectionName - Variable in class org.jgrapht.nio.json.JSONImporter
- EdgeScoringAlgorithm<E,
D> - Interface in org.jgrapht.alg.interfaces -
An interface for all algorithms which assign scores to edges of a graph.
- edgesCount() - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- edgesCount() - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- edgesCount() - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Get the number of edges.
- edgeSet - Variable in class org.jgrapht.graph.AsSubgraph
- edgeSet - Variable in class org.jgrapht.graph.MaskEdgeSet
- 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.guava.BaseGraphAdapter
- edgeSet() - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- edgeSet() - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- edgeSet() - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- edgeSet() - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- edgeSet() - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- edgeSet() - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- edgeSet() - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- edgeSet() - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- edgeSet() - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- edgeSet() - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- edgeSet() - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- 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.
- edgeSetModified() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Inform allEdgesSet that the backing data has been modified.
- edgeSetToTour(Set<E>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Transform from a Set representation to a graph path.
- edgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- edgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- edgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
- edgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- edgesOf(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns a set of all edges touching the specified vertex.
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- edgesOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- edgesOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- edgesOf(Long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- edgesOf(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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.CacheAccess
-
Get all edges touching the specified vertex in AsSynchronizedGraph's backing graph.
- edgesOf(V) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Get all edges touching the specified vertex in AsSynchronizedGraph's backing graph.
- edgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Get all edges touching the specified vertex in AsSynchronizedGraph's backing graph.
- edgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCopy
-
Get all edges touching the specified vertex in AsSynchronizedGraph's backing graph.
- 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.guava.BaseGraphAdapter
- edgesOf(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- edgesOf(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- edgesOf(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable view over all edges touching the specified vertex.
- edgesOfMap - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheAccess
- edgeSource - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The source vertex of the edge that this event is related to.
- edgeStatement() - Method in class org.jgrapht.io.DOTParser
- edgeStatement() - Method in class org.jgrapht.io.DOTParser.StatementContext
- edgeStatement() - Method in class org.jgrapht.nio.dot.DOTParser
- edgeStatement() - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- EdgeStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.EdgeStatementContext
- EdgeStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- edgeSupplier - Variable in class org.jgrapht.graph.AbstractBaseGraph
- edgeSupplier - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- edgeSupplier - Variable in class org.jgrapht.graph.GraphDelegator
- edgeSupplier - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- edgeSupplier - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- edgeSupplier - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- edgeToEmbed - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
If this node has a back edge incident to the currently processed node $v$, then this variable stores this edge
- edgeToNext() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
Returns an edge connecting previously returned node with node, which will be returned next.
- 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
- edgeValidAttributes - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- edgeValidKeys - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- edgeValidKeys - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- edgeWeight - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The weight of the edge that this event is related to.
- edgeWeightAttributeName - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- edgeWeightAttributeName - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
- edgeWeightAttributeName - Variable in class org.jgrapht.nio.graphml.GraphMLImporter
- edgeWeightAttributeName - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
- edgeWeightAttributeName - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
- edgeWeightAttributeName - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
- edgeWeightFormat - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- edgeWeightFunction - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath
- edgeWeightType - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- edgeWeightUpdated(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
-
Notifies that an edge weight has been updated.
- edgeWithAttributesConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- edgeWithAttributesConsumer - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- edgeWithAttributesConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- edgeWithAttributesFactory - Variable in class org.jgrapht.nio.dot.DOTImporter
- edgeWithAttributesFactory - Variable in class org.jgrapht.nio.json.JSONImporter
- editOperation - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.CacheEntry
-
Edit operation stored in this entry.
- EditOperation(ZhangShashaTreeEditDistance.OperationType, V, V) - Constructor for class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Constructs an instance of edit operation for the given
type
,firstOperand
andsecondOperand
. - editOperationLists - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Array with lists of edit operations which transform subtrees of
tree1
into subtreestree2
. - 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
. - EdmondsKarpMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
- EigenvectorCentrality<V,
E> - Class in org.jgrapht.alg.scoring -
Eigenvector-centrality implementation.
- EigenvectorCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.EigenvectorCentrality
-
Create and execute an instance of EigenvectorCentrality
- EigenvectorCentrality(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.scoring.EigenvectorCentrality
-
Create and execute an instance of EigenvectorCentrality
- EigenvectorCentrality(Graph<V, E>, int, double) - Constructor for class org.jgrapht.alg.scoring.EigenvectorCentrality
-
Create and execute an instance of EigenvectorCentrality.
- element() - Method in class org.jgrapht.util.DoublyLinkedList
- ElementOrder<V> - Class in org.jgrapht.graph.guava
-
Helper class to maintain a total order for a set of elements.
- ElementOrder(Comparator<V>, Map<V, Long>) - Constructor for class org.jgrapht.graph.guava.ElementOrder
-
Create a new element order.
- ElementOrderMethod<T> - Class in org.jgrapht.graph.guava
-
Represents the method of ensuring the existence of a total order of a set of elements.
- ElementOrderMethod(ElementOrderMethod.Type, Comparator<T>) - Constructor for class org.jgrapht.graph.guava.ElementOrderMethod
- ElementOrderMethod.Type - Enum Class in org.jgrapht.graph.guava
-
Element order method type
- elements - Variable in class org.jgrapht.util.ElementsSequenceGenerator
-
Input elements ordered as a list.
- ElementsSequenceGenerator<T> - Class in org.jgrapht.util
-
Generates elements from the input collection in random order.
- ElementsSequenceGenerator(Collection<T>) - Constructor for class org.jgrapht.util.ElementsSequenceGenerator
-
Constructs a new
ElementsSequenceGenerator
. - ElementsSequenceGenerator(Collection<T>, long) - Constructor for class org.jgrapht.util.ElementsSequenceGenerator
-
Constructs a new
ElementsSequenceGenerator
using the specifiedseed
. - ElementsSequenceGenerator(Collection<T>, Random) - Constructor for class org.jgrapht.util.ElementsSequenceGenerator
-
Constructs a new
ElementsSequenceGenerator
using the specified random number generatorrng
. - ellinghamHorton54Graph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- ellinghamHorton78Graph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- embedBackEdge(BoyerMyrvoldPlanarityInspector.Edge, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Adds
edge
to the list of the embedded edges such that theprev
node becomes an inner node. - embedBackEdge(BoyerMyrvoldPlanarityInspector.Node, int, BoyerMyrvoldPlanarityInspector.Edge, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Embeds the back edge
edge
into the list of embedded edges of the source and the virtual target of the edge such that thechildPrev
belongs to the new inner face. - embedded - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Whether the edge is embedded or not.
- embedded - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The list of the embedded edges incident to this node in a clockwise or a counterclockwise order.
- embedding - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The resulting combinatorial embedding.
- EmbeddingImpl(Graph<V, E>, Map<V, List<E>>) - Constructor for class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Creates new embedding of the
graph
- embeddingMap - Variable in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
The map from vertices of the
graph
to the clockwise order of edges - embedShortCircuit(BoyerMyrvoldPlanarityInspector.Node, int, BoyerMyrvoldPlanarityInspector.OuterFaceCirculator) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Embeds a short-circuit edge from the
componentRoot
to the current node of thecirculator
. - EmptyFieldContext(CSVParser.FieldContext) - Constructor for class org.jgrapht.io.CSVParser.EmptyFieldContext
- EmptyFieldContext(CSVParser.FieldContext) - Constructor for class org.jgrapht.nio.csv.CSVParser.EmptyFieldContext
- 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.
- encounterStartVertex() - Method in class org.jgrapht.traverse.CrossComponentIterator
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
Update data structures the first time we see a vertex.
- 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
- encounterVertexAgain(V, E) - Method in class org.jgrapht.alg.cycle.CycleDetector.ProbeIterator
-
Called whenever we re-encounter a vertex.
- encounterVertexAgain(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
Called whenever we re-encounter a vertex.
- 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 - Enum constant in enum class org.jgrapht.nio.ImportEvent
-
End of the import
- END_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the last vertex generated.
- endElement(String, String, String) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- endElement(String, String, String) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- endElement(String, String, String) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- endOfEnumerationReached - Variable in class org.jgrapht.util.PrefetchIterator
- endVertex - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
-
End vertex of the frontier.
- endVertex - Variable in class org.jgrapht.graph.GraphWalk
- enqueue(int) - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Add an element to the queue.
- enqueue(PushRelabelMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- ensureAtLeastOneValidPathInQueue() - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
This method is used to make sure that there exist at least one valid path on the queue.
- enterAList(DOTParser.AListContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.aList()
. - enterAList(DOTParser.AListContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.aList()
. - enterAList(DOTParser.AListContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.aList()
. - enterAList(DOTParser.AListContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterAList(DOTParser.AListContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.aList()
. - enterArray(JsonParser.ArrayContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.array()
. - enterArray(JsonParser.ArrayContext) - Method in interface org.jgrapht.io.JsonListener
-
Enter a parse tree produced by
JsonParser.array()
. - enterArray(JsonParser.ArrayContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.array()
. - enterArray(JsonParser.ArrayContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- enterArray(JsonParser.ArrayContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Enter a parse tree produced by
JsonParser.array()
. - enterAttributesList(DOTParser.AttributesListContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.attributesList()
. - enterAttributesList(DOTParser.AttributesListContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.attributesList()
. - enterAttributesList(DOTParser.AttributesListContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.attributesList()
. - enterAttributesList(DOTParser.AttributesListContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterAttributesList(DOTParser.AttributesListContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.attributesList()
. - enterAttributeStatement(DOTParser.AttributeStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.attributeStatement()
. - enterAttributeStatement(DOTParser.AttributeStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.attributeStatement()
. - enterAttributeStatement(DOTParser.AttributeStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.attributeStatement()
. - enterAttributeStatement(DOTParser.AttributeStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterAttributeStatement(DOTParser.AttributeStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.attributeStatement()
. - enterCompoundStatement(DOTParser.CompoundStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.compoundStatement()
. - enterCompoundStatement(DOTParser.CompoundStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.compoundStatement()
. - enterCompoundStatement(DOTParser.CompoundStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.compoundStatement()
. - enterCompoundStatement(DOTParser.CompoundStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.compoundStatement()
. - enterEdgeStatement(DOTParser.EdgeStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.edgeStatement()
. - enterEdgeStatement(DOTParser.EdgeStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.edgeStatement()
. - enterEdgeStatement(DOTParser.EdgeStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.edgeStatement()
. - enterEdgeStatement(DOTParser.EdgeStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterEdgeStatement(DOTParser.EdgeStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.edgeStatement()
. - enterEmptyField(CSVParser.EmptyFieldContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Enter a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - enterEmptyField(CSVParser.EmptyFieldContext) - Method in interface org.jgrapht.io.CSVListener
-
Enter a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - enterEmptyField(CSVParser.EmptyFieldContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Enter a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - enterEmptyField(CSVParser.EmptyFieldContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Enter a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.CSVBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.DOTBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.GmlBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.JsonBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
- enterEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
- enterFile(CSVParser.FileContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Enter a parse tree produced by
CSVParser.file()
. - enterFile(CSVParser.FileContext) - Method in interface org.jgrapht.io.CSVListener
-
Enter a parse tree produced by
CSVParser.file()
. - enterFile(CSVParser.FileContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Enter a parse tree produced by
CSVParser.file()
. - enterFile(CSVParser.FileContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Enter a parse tree produced by
CSVParser.file()
. - enterGml(GmlParser.GmlContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Enter a parse tree produced by
GmlParser.gml()
. - enterGml(GmlParser.GmlContext) - Method in interface org.jgrapht.io.GmlListener
-
Enter a parse tree produced by
GmlParser.gml()
. - enterGml(GmlParser.GmlContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Enter a parse tree produced by
GmlParser.gml()
. - enterGml(GmlParser.GmlContext) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- enterGml(GmlParser.GmlContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Enter a parse tree produced by
GmlParser.gml()
. - enterGraph(DOTParser.GraphContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.graph()
. - enterGraph(DOTParser.GraphContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.graph()
. - enterGraph(DOTParser.GraphContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.graph()
. - enterGraph(DOTParser.GraphContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterGraph(DOTParser.GraphContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.graph()
. - enterGraphHeader(DOTParser.GraphHeaderContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.graphHeader()
. - enterGraphHeader(DOTParser.GraphHeaderContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.graphHeader()
. - enterGraphHeader(DOTParser.GraphHeaderContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.graphHeader()
. - enterGraphHeader(DOTParser.GraphHeaderContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterGraphHeader(DOTParser.GraphHeaderContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.graphHeader()
. - enterGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.graphIdentifier()
. - enterGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.graphIdentifier()
. - enterGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.graphIdentifier()
. - enterGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.graphIdentifier()
. - enterHeader(CSVParser.HeaderContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Enter a parse tree produced by
CSVParser.header()
. - enterHeader(CSVParser.HeaderContext) - Method in interface org.jgrapht.io.CSVListener
-
Enter a parse tree produced by
CSVParser.header()
. - enterHeader(CSVParser.HeaderContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Enter a parse tree produced by
CSVParser.header()
. - enterHeader(CSVParser.HeaderContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- enterHeader(CSVParser.HeaderContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Enter a parse tree produced by
CSVParser.header()
. - enterIdentifier(DOTParser.IdentifierContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.identifier()
. - enterIdentifier(DOTParser.IdentifierContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.identifier()
. - enterIdentifier(DOTParser.IdentifierContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.identifier()
. - enterIdentifier(DOTParser.IdentifierContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterIdentifier(DOTParser.IdentifierContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.identifier()
. - enterIdentifierPair(DOTParser.IdentifierPairContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.identifierPair()
. - enterIdentifierPair(DOTParser.IdentifierPairContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.identifierPair()
. - enterIdentifierPair(DOTParser.IdentifierPairContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.identifierPair()
. - enterIdentifierPair(DOTParser.IdentifierPairContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterIdentifierPair(DOTParser.IdentifierPairContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.identifierPair()
. - enterIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.identifierPairStatement()
. - enterIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.identifierPairStatement()
. - enterIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.identifierPairStatement()
. - enterIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.identifierPairStatement()
. - enterJson(JsonParser.JsonContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.json()
. - enterJson(JsonParser.JsonContext) - Method in interface org.jgrapht.io.JsonListener
-
Enter a parse tree produced by
JsonParser.json()
. - enterJson(JsonParser.JsonContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.json()
. - enterJson(JsonParser.JsonContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- enterJson(JsonParser.JsonContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Enter a parse tree produced by
JsonParser.json()
. - enterListKeyValue(GmlParser.ListKeyValueContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Enter a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterListKeyValue(GmlParser.ListKeyValueContext) - Method in interface org.jgrapht.io.GmlListener
-
Enter a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterListKeyValue(GmlParser.ListKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Enter a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterListKeyValue(GmlParser.ListKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- enterListKeyValue(GmlParser.ListKeyValueContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Enter a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.nodeIdentifier()
. - enterNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.nodeIdentifier()
. - enterNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.nodeIdentifier()
. - enterNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.nodeIdentifier()
. - enterNodeStatement(DOTParser.NodeStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.nodeStatement()
. - enterNodeStatement(DOTParser.NodeStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.nodeStatement()
. - enterNodeStatement(DOTParser.NodeStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.nodeStatement()
. - enterNodeStatement(DOTParser.NodeStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterNodeStatement(DOTParser.NodeStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.nodeStatement()
. - enterNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - enterNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - enterNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - enterNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - enterNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Enter a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in interface org.jgrapht.io.GmlListener
-
Enter a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Enter a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- enterNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Enter a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterObj(JsonParser.ObjContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.obj()
. - enterObj(JsonParser.ObjContext) - Method in interface org.jgrapht.io.JsonListener
-
Enter a parse tree produced by
JsonParser.obj()
. - enterObj(JsonParser.ObjContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.obj()
. - enterObj(JsonParser.ObjContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- enterObj(JsonParser.ObjContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Enter a parse tree produced by
JsonParser.obj()
. - enterPair(JsonParser.PairContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.pair()
. - enterPair(JsonParser.PairContext) - Method in interface org.jgrapht.io.JsonListener
-
Enter a parse tree produced by
JsonParser.pair()
. - enterPair(JsonParser.PairContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.pair()
. - enterPair(JsonParser.PairContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- enterPair(JsonParser.PairContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Enter a parse tree produced by
JsonParser.pair()
. - enterPort(DOTParser.PortContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.port()
. - enterPort(DOTParser.PortContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.port()
. - enterPort(DOTParser.PortContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.port()
. - enterPort(DOTParser.PortContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.port()
. - enterRecord(CSVParser.RecordContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Enter a parse tree produced by
CSVParser.record()
. - enterRecord(CSVParser.RecordContext) - Method in interface org.jgrapht.io.CSVListener
-
Enter a parse tree produced by
CSVParser.record()
. - enterRecord(CSVParser.RecordContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Enter a parse tree produced by
CSVParser.record()
. - enterRecord(CSVParser.RecordContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- enterRecord(CSVParser.RecordContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Enter a parse tree produced by
CSVParser.record()
. - enterRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.EmptyFieldContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.FileContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.HeaderContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.RecordContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.StringFieldContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.TextFieldContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.AListContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.AttributesListContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.CompoundStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.GraphContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.GraphIdentifierContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.IdentifierPairContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.IdentifierPairStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.NodeIdentifierContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.NodeStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.NodeStatementNoAttributesContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.PortContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.StatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.SubgraphStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.GmlContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.ListKeyValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.NumberKeyValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.StringKeyValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.ArrayContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.JsonContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.ObjContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.PairContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.ValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.EmptyFieldContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.FileContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.HeaderContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.StringFieldContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.TextFieldContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.AListContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.AttributesListContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.CompoundStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.GraphContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.GraphIdentifierContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.NodeIdentifierContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementNoAttributesContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.PortContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.GmlContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.ListKeyValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.NumberKeyValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.StringKeyValueContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.ArrayContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.JsonContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.ObjContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.PairContext
- enterRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- enterStatement(DOTParser.StatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.statement()
. - enterStatement(DOTParser.StatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.statement()
. - enterStatement(DOTParser.StatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.statement()
. - enterStatement(DOTParser.StatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.statement()
. - enterStringField(CSVParser.StringFieldContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Enter a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - enterStringField(CSVParser.StringFieldContext) - Method in interface org.jgrapht.io.CSVListener
-
Enter a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - enterStringField(CSVParser.StringFieldContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Enter a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - enterStringField(CSVParser.StringFieldContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Enter a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - enterStringKeyValue(GmlParser.StringKeyValueContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Enter a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterStringKeyValue(GmlParser.StringKeyValueContext) - Method in interface org.jgrapht.io.GmlListener
-
Enter a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterStringKeyValue(GmlParser.StringKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Enter a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterStringKeyValue(GmlParser.StringKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- enterStringKeyValue(GmlParser.StringKeyValueContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Enter a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - enterSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.subgraphStatement()
. - enterSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Enter a parse tree produced by
DOTParser.subgraphStatement()
. - enterSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Enter a parse tree produced by
DOTParser.subgraphStatement()
. - enterSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- enterSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Enter a parse tree produced by
DOTParser.subgraphStatement()
. - enterTextField(CSVParser.TextFieldContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Enter a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - enterTextField(CSVParser.TextFieldContext) - Method in interface org.jgrapht.io.CSVListener
-
Enter a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - enterTextField(CSVParser.TextFieldContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Enter a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - enterTextField(CSVParser.TextFieldContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Enter a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - enterValue(JsonParser.ValueContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.value()
. - enterValue(JsonParser.ValueContext) - Method in interface org.jgrapht.io.JsonListener
-
Enter a parse tree produced by
JsonParser.value()
. - enterValue(JsonParser.ValueContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Enter a parse tree produced by
JsonParser.value()
. - enterValue(JsonParser.ValueContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- enterValue(JsonParser.ValueContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Enter a parse tree produced by
JsonParser.value()
. - entireGraphVertexIterator - Variable in class org.jgrapht.traverse.CrossComponentIterator
-
Iterator which provides start vertices for cross-component iteration.
- EppsteinGraphPath(Graph<V, E>, List<EppsteinShortestPathIterator.PathsGraphVertex>, Map<V, Pair<Double, E>>, double) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
- 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
. - EppsteinShortestPathIterator.EppsteinGraphPath - Class in org.jgrapht.alg.shortestpath
-
Represents a path that is generated during the computations.
- EppsteinShortestPathIterator.PathsGraphVertex - Class in org.jgrapht.alg.shortestpath
-
Vertex of the paths graph.
- eps - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Dual change that hasn't been spread among the nodes in this tree.
- EPS - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default epsilon used in the algorithm
- epsilon - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- epsilon - Variable in class org.jgrapht.alg.util.ToleranceDoubleComparator
- equalLists(List<V>, List<V>, int) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Checks if the lists have the same content until the
index
(inclusive). - equals(Object) - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey
- 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.ColorRefinementIsomorphismInspector.DistinctGraphObject
- 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.similarity.ZhangShashaTreeEditDistance.EditOperation
- 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.CopyOnDemandSet
-
Compares the specified object with this set for equality.
- 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.nio.DefaultAttribute
- 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
- error(SAXParseException) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- error(SAXParseException) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- error(SAXParseException) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- 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.
- ESCAPE_STRINGS_AS_JAVA - Enum constant in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter escapes all strings as Java strings, otherwise no escaping is performed.
- ESCAPE_STRINGS_AS_JAVA - Enum constant in enum class org.jgrapht.nio.lemon.LemonExporter.Parameter
-
If set the exporter escapes all strings as Java strings, otherwise no escaping is performed.
- escapeDoubleQuotes(String) - Static method in class org.jgrapht.nio.dot.DOTExporter
- escapeDSV(String, char) - Static method in class org.jgrapht.nio.csv.DSVUtils
-
Escape a Delimiter-separated values string.
- 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
- eulerTour - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- 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.
- even - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- EVEN - Enum constant in enum class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm.Label
- eventConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- EventDrivenImporter<V,
E> - Interface in org.jgrapht.nio -
Interface for an importer using consumers.
- excess - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
- excess - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
The excess of this node.
- excessMatrix - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Excess matrix
- execute(Set<V>, V) - Method in class org.jgrapht.alg.cycle.CycleDetector
- executeNeighborhoodOperation(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<Integer, V>, Map<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, Integer>, Map<V, Pair<Set<V>, Double>>, GraphWalk<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, DefaultWeightedEdge>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Executes the move operations induced by the calculated cycle in the improvement graph.
- executor - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Executor to which parallel computation tasks are submitted.
- executor - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Executor which is used for parallelization in this algorithm.
- exitAList(DOTParser.AListContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.aList()
. - exitAList(DOTParser.AListContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.aList()
. - exitAList(DOTParser.AListContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.aList()
. - exitAList(DOTParser.AListContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitAList(DOTParser.AListContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.aList()
. - exitArray(JsonParser.ArrayContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.array()
. - exitArray(JsonParser.ArrayContext) - Method in interface org.jgrapht.io.JsonListener
-
Exit a parse tree produced by
JsonParser.array()
. - exitArray(JsonParser.ArrayContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.array()
. - exitArray(JsonParser.ArrayContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- exitArray(JsonParser.ArrayContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Exit a parse tree produced by
JsonParser.array()
. - exitAttributesList(DOTParser.AttributesListContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.attributesList()
. - exitAttributesList(DOTParser.AttributesListContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.attributesList()
. - exitAttributesList(DOTParser.AttributesListContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.attributesList()
. - exitAttributesList(DOTParser.AttributesListContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitAttributesList(DOTParser.AttributesListContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.attributesList()
. - exitAttributeStatement(DOTParser.AttributeStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.attributeStatement()
. - exitAttributeStatement(DOTParser.AttributeStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.attributeStatement()
. - exitAttributeStatement(DOTParser.AttributeStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.attributeStatement()
. - exitAttributeStatement(DOTParser.AttributeStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitAttributeStatement(DOTParser.AttributeStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.attributeStatement()
. - exitCompoundStatement(DOTParser.CompoundStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.compoundStatement()
. - exitCompoundStatement(DOTParser.CompoundStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.compoundStatement()
. - exitCompoundStatement(DOTParser.CompoundStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.compoundStatement()
. - exitCompoundStatement(DOTParser.CompoundStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.compoundStatement()
. - exitEdgeStatement(DOTParser.EdgeStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.edgeStatement()
. - exitEdgeStatement(DOTParser.EdgeStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.edgeStatement()
. - exitEdgeStatement(DOTParser.EdgeStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.edgeStatement()
. - exitEdgeStatement(DOTParser.EdgeStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitEdgeStatement(DOTParser.EdgeStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.edgeStatement()
. - exitEmptyField(CSVParser.EmptyFieldContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Exit a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - exitEmptyField(CSVParser.EmptyFieldContext) - Method in interface org.jgrapht.io.CSVListener
-
Exit a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - exitEmptyField(CSVParser.EmptyFieldContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Exit a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - exitEmptyField(CSVParser.EmptyFieldContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- exitEmptyField(CSVParser.EmptyFieldContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Exit a parse tree produced by the
EmptyField
labeled alternative inCSVParser.field()
. - exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.CSVBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.DOTBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.GmlBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.io.JsonBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
- exitEveryRule(ParserRuleContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
- exitFile(CSVParser.FileContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Exit a parse tree produced by
CSVParser.file()
. - exitFile(CSVParser.FileContext) - Method in interface org.jgrapht.io.CSVListener
-
Exit a parse tree produced by
CSVParser.file()
. - exitFile(CSVParser.FileContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Exit a parse tree produced by
CSVParser.file()
. - exitFile(CSVParser.FileContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Exit a parse tree produced by
CSVParser.file()
. - exitGml(GmlParser.GmlContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Exit a parse tree produced by
GmlParser.gml()
. - exitGml(GmlParser.GmlContext) - Method in interface org.jgrapht.io.GmlListener
-
Exit a parse tree produced by
GmlParser.gml()
. - exitGml(GmlParser.GmlContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Exit a parse tree produced by
GmlParser.gml()
. - exitGml(GmlParser.GmlContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Exit a parse tree produced by
GmlParser.gml()
. - exitGraph(DOTParser.GraphContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.graph()
. - exitGraph(DOTParser.GraphContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.graph()
. - exitGraph(DOTParser.GraphContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.graph()
. - exitGraph(DOTParser.GraphContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitGraph(DOTParser.GraphContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.graph()
. - exitGraphHeader(DOTParser.GraphHeaderContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.graphHeader()
. - exitGraphHeader(DOTParser.GraphHeaderContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.graphHeader()
. - exitGraphHeader(DOTParser.GraphHeaderContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.graphHeader()
. - exitGraphHeader(DOTParser.GraphHeaderContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitGraphHeader(DOTParser.GraphHeaderContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.graphHeader()
. - exitGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.graphIdentifier()
. - exitGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.graphIdentifier()
. - exitGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.graphIdentifier()
. - exitGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitGraphIdentifier(DOTParser.GraphIdentifierContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.graphIdentifier()
. - exitHeader(CSVParser.HeaderContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Exit a parse tree produced by
CSVParser.header()
. - exitHeader(CSVParser.HeaderContext) - Method in interface org.jgrapht.io.CSVListener
-
Exit a parse tree produced by
CSVParser.header()
. - exitHeader(CSVParser.HeaderContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Exit a parse tree produced by
CSVParser.header()
. - exitHeader(CSVParser.HeaderContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- exitHeader(CSVParser.HeaderContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Exit a parse tree produced by
CSVParser.header()
. - exitIdentifier(DOTParser.IdentifierContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.identifier()
. - exitIdentifier(DOTParser.IdentifierContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.identifier()
. - exitIdentifier(DOTParser.IdentifierContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.identifier()
. - exitIdentifier(DOTParser.IdentifierContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitIdentifier(DOTParser.IdentifierContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.identifier()
. - exitIdentifierPair(DOTParser.IdentifierPairContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.identifierPair()
. - exitIdentifierPair(DOTParser.IdentifierPairContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.identifierPair()
. - exitIdentifierPair(DOTParser.IdentifierPairContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.identifierPair()
. - exitIdentifierPair(DOTParser.IdentifierPairContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitIdentifierPair(DOTParser.IdentifierPairContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.identifierPair()
. - exitIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.identifierPairStatement()
. - exitIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.identifierPairStatement()
. - exitIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.identifierPairStatement()
. - exitIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitIdentifierPairStatement(DOTParser.IdentifierPairStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.identifierPairStatement()
. - exitJson(JsonParser.JsonContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.json()
. - exitJson(JsonParser.JsonContext) - Method in interface org.jgrapht.io.JsonListener
-
Exit a parse tree produced by
JsonParser.json()
. - exitJson(JsonParser.JsonContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.json()
. - exitJson(JsonParser.JsonContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Exit a parse tree produced by
JsonParser.json()
. - exitListKeyValue(GmlParser.ListKeyValueContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Exit a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitListKeyValue(GmlParser.ListKeyValueContext) - Method in interface org.jgrapht.io.GmlListener
-
Exit a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitListKeyValue(GmlParser.ListKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Exit a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitListKeyValue(GmlParser.ListKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- exitListKeyValue(GmlParser.ListKeyValueContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Exit a parse tree produced by the
ListKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.nodeIdentifier()
. - exitNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.nodeIdentifier()
. - exitNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.nodeIdentifier()
. - exitNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitNodeIdentifier(DOTParser.NodeIdentifierContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.nodeIdentifier()
. - exitNodeStatement(DOTParser.NodeStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.nodeStatement()
. - exitNodeStatement(DOTParser.NodeStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.nodeStatement()
. - exitNodeStatement(DOTParser.NodeStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.nodeStatement()
. - exitNodeStatement(DOTParser.NodeStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitNodeStatement(DOTParser.NodeStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.nodeStatement()
. - exitNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - exitNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - exitNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - exitNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitNodeStatementNoAttributes(DOTParser.NodeStatementNoAttributesContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.nodeStatementNoAttributes()
. - exitNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Exit a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in interface org.jgrapht.io.GmlListener
-
Exit a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Exit a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitNumberKeyValue(GmlParser.NumberKeyValueContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Exit a parse tree produced by the
NumberKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitObj(JsonParser.ObjContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.obj()
. - exitObj(JsonParser.ObjContext) - Method in interface org.jgrapht.io.JsonListener
-
Exit a parse tree produced by
JsonParser.obj()
. - exitObj(JsonParser.ObjContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.obj()
. - exitObj(JsonParser.ObjContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- exitObj(JsonParser.ObjContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Exit a parse tree produced by
JsonParser.obj()
. - exitPair(JsonParser.PairContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.pair()
. - exitPair(JsonParser.PairContext) - Method in interface org.jgrapht.io.JsonListener
-
Exit a parse tree produced by
JsonParser.pair()
. - exitPair(JsonParser.PairContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.pair()
. - exitPair(JsonParser.PairContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- exitPair(JsonParser.PairContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Exit a parse tree produced by
JsonParser.pair()
. - exitPort(DOTParser.PortContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.port()
. - exitPort(DOTParser.PortContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.port()
. - exitPort(DOTParser.PortContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.port()
. - exitPort(DOTParser.PortContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.port()
. - exitRecord(CSVParser.RecordContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Exit a parse tree produced by
CSVParser.record()
. - exitRecord(CSVParser.RecordContext) - Method in interface org.jgrapht.io.CSVListener
-
Exit a parse tree produced by
CSVParser.record()
. - exitRecord(CSVParser.RecordContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Exit a parse tree produced by
CSVParser.record()
. - exitRecord(CSVParser.RecordContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- exitRecord(CSVParser.RecordContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Exit a parse tree produced by
CSVParser.record()
. - exitRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.EmptyFieldContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.FileContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.HeaderContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.RecordContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.StringFieldContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.CSVParser.TextFieldContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.AListContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.AttributesListContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.CompoundStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.GraphContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.GraphIdentifierContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.IdentifierPairContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.IdentifierPairStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.NodeIdentifierContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.NodeStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.NodeStatementNoAttributesContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.PortContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.StatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.DOTParser.SubgraphStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.GmlContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.ListKeyValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.NumberKeyValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.GmlParser.StringKeyValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.ArrayContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.JsonContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.ObjContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.PairContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.io.JsonParser.ValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.EmptyFieldContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.FileContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.HeaderContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.StringFieldContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.csv.CSVParser.TextFieldContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.AListContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.AttributesListContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.CompoundStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.GraphContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.GraphIdentifierContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.NodeIdentifierContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementNoAttributesContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.PortContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.GmlContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.ListKeyValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.NumberKeyValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.gml.GmlParser.StringKeyValueContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.ArrayContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.JsonContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.ObjContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.PairContext
- exitRule(ParseTreeListener) - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- exitStatement(DOTParser.StatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.statement()
. - exitStatement(DOTParser.StatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.statement()
. - exitStatement(DOTParser.StatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.statement()
. - exitStatement(DOTParser.StatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.statement()
. - exitStringField(CSVParser.StringFieldContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Exit a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - exitStringField(CSVParser.StringFieldContext) - Method in interface org.jgrapht.io.CSVListener
-
Exit a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - exitStringField(CSVParser.StringFieldContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Exit a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - exitStringField(CSVParser.StringFieldContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- exitStringField(CSVParser.StringFieldContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Exit a parse tree produced by the
StringField
labeled alternative inCSVParser.field()
. - exitStringKeyValue(GmlParser.StringKeyValueContext) - Method in class org.jgrapht.io.GmlBaseListener
-
Exit a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitStringKeyValue(GmlParser.StringKeyValueContext) - Method in interface org.jgrapht.io.GmlListener
-
Exit a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitStringKeyValue(GmlParser.StringKeyValueContext) - Method in class org.jgrapht.nio.gml.GmlBaseListener
-
Exit a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitStringKeyValue(GmlParser.StringKeyValueContext) - Method in interface org.jgrapht.nio.gml.GmlListener
-
Exit a parse tree produced by the
StringKeyValue
labeled alternative inGmlParser.keyValuePair()
. - exitSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in class org.jgrapht.io.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.subgraphStatement()
. - exitSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in interface org.jgrapht.io.DOTListener
-
Exit a parse tree produced by
DOTParser.subgraphStatement()
. - exitSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in class org.jgrapht.nio.dot.DOTBaseListener
-
Exit a parse tree produced by
DOTParser.subgraphStatement()
. - exitSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- exitSubgraphStatement(DOTParser.SubgraphStatementContext) - Method in interface org.jgrapht.nio.dot.DOTListener
-
Exit a parse tree produced by
DOTParser.subgraphStatement()
. - exitTextField(CSVParser.TextFieldContext) - Method in class org.jgrapht.io.CSVBaseListener
-
Exit a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - exitTextField(CSVParser.TextFieldContext) - Method in interface org.jgrapht.io.CSVListener
-
Exit a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - exitTextField(CSVParser.TextFieldContext) - Method in class org.jgrapht.nio.csv.CSVBaseListener
-
Exit a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - exitTextField(CSVParser.TextFieldContext) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- exitTextField(CSVParser.TextFieldContext) - Method in interface org.jgrapht.nio.csv.CSVListener
-
Exit a parse tree produced by the
TextField
labeled alternative inCSVParser.field()
. - exitValue(JsonParser.ValueContext) - Method in class org.jgrapht.io.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.value()
. - exitValue(JsonParser.ValueContext) - Method in interface org.jgrapht.io.JsonListener
-
Exit a parse tree produced by
JsonParser.value()
. - exitValue(JsonParser.ValueContext) - Method in class org.jgrapht.nio.json.JsonBaseListener
-
Exit a parse tree produced by
JsonParser.value()
. - exitValue(JsonParser.ValueContext) - Method in interface org.jgrapht.nio.json.JsonListener
-
Exit a parse tree produced by
JsonParser.value()
. - exogenousFactorDefaultFunction() - Static method in class org.jgrapht.alg.scoring.KatzCentrality
-
Exogenous factor default function (the constant function returning 1).
- expand(BlossomVNode, boolean) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Performs expand operation.
- expandEvenBranch(BlossomVNode, BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Expands an even branch of the blossom.
- expandInfinityNode(BlossomVNode, BlossomVTree) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Expands an infinity node from the odd branch
- expandInit(BlossomVNode, BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Expands a 1/2-valued odd circuit.
- expandMinusNode(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Expands a minus node from the odd branch.
- expandNode(AddressableHeap.Handle<Double, V>, V) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
- expandNum - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Number of expand operations
- expandOddBranch(BlossomVNode, BlossomVNode, BlossomVTree) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Expands the nodes on an odd branch.
- expandPlusNode(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Changes dual information of the
plusNode
and edge incident to it. - expandTime - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Time spent during the expand operation in nanoseconds
- expectedModCount - Variable in class org.jgrapht.util.AVLTree.TreeNodeIterator
-
Number of modifications of the tree at the time this iterator is created.
- expectedModCount - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
The number of modifications the list have had at the moment when this iterator was created
- expectedTopoModCount - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- EXPORT_CUSTOM_EDGE_ATTRIBUTES - Enum constant in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs all custom edge attributes.
- EXPORT_CUSTOM_VERTEX_ATTRIBUTES - Enum constant in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs all custom vertex attributes.
- EXPORT_EDGE_LABELS - Enum constant in enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs edge labels.
- EXPORT_EDGE_LABELS - Enum constant in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs edge labels.
- EXPORT_EDGE_TYPES - Enum constant in enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs edge types.
- EXPORT_EDGE_WEIGHTS - Enum constant in enum class org.jgrapht.nio.dimacs.DIMACSExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_EDGE_WEIGHTS - Enum constant in enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_EDGE_WEIGHTS - Enum constant in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_EDGE_WEIGHTS - Enum constant in enum class org.jgrapht.nio.lemon.LemonExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_META - Enum constant in enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs the metadata information.
- EXPORT_VERTEX_LABELS - Enum constant in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs vertex labels.
- exportAdjacencyMatrix(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.matrix.MatrixExporter
- exportAdjacencyMatrixVertex(PrintWriter, V, List<V>) - Method in class org.jgrapht.nio.matrix.MatrixExporter
- exportAsAdjacencyList(Graph<V, E>, PrintWriter) - Method in class org.jgrapht.nio.csv.CSVExporter
- exportAsEdgeList(Graph<V, E>, PrintWriter) - Method in class org.jgrapht.nio.csv.CSVExporter
- exportAsMatrix(Graph<V, E>, PrintWriter) - Method in class org.jgrapht.nio.csv.CSVExporter
- exportAttribute(PrintWriter, String, Attribute) - Method in class org.jgrapht.nio.gml.GmlExporter
- exportEdge(PrintWriter, E, Graph<V, E>) - Method in class org.jgrapht.nio.csv.VisioExporter
- exportEdge(PrintWriter, Graph<V, E>, E) - Method in class org.jgrapht.nio.json.JSONExporter
- exportEdgeAttributes(PrintWriter, Graph<V, E>, E) - Method in class org.jgrapht.nio.json.JSONExporter
- exportEdgeLabels - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
-
Whether to try to print edge labels.
- exportEdges(PrintWriter, Graph<V, E>) - Method in class org.jgrapht.nio.gml.GmlExporter
- exportEdges(PrintWriter, Graph<V, E>) - Method in class org.jgrapht.nio.lemon.LemonExporter
- exportEdgeWeights - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
-
Whether to print edge weights in case the graph is weighted.
- exportEntry(PrintWriter, String, String, String) - Method in class org.jgrapht.nio.matrix.MatrixExporter
- exportEscapedField(PrintWriter, String) - Method in class org.jgrapht.nio.csv.CSVExporter
- ExportException - Exception Class in org.jgrapht.nio
-
An exception that the library throws in case of graph export errors.
- ExportException() - Constructor for exception class org.jgrapht.nio.ExportException
-
Constructs an
ExportException
withnull
as its error detail message. - ExportException(String) - Constructor for exception class org.jgrapht.nio.ExportException
-
Constructs an
ExportException
with the specified detail message. - ExportException(String, Throwable) - Constructor for exception class org.jgrapht.nio.ExportException
-
Constructs an
ExportException
with the specified detail message and cause. - ExportException(Throwable) - Constructor for exception class org.jgrapht.nio.ExportException
-
Constructs an
ExportException
with the specified cause and a detail message of(cause==null ? null : cause.toString())
(which typically contains the class and detail message ofcause
). - exportGraph(Graph<V, E>, File) - Method in interface org.jgrapht.nio.GraphExporter
-
Export a graph to the given
File
. - exportGraph(Graph<V, E>, OutputStream) - Method in interface org.jgrapht.nio.GraphExporter
-
Export a graph to the given
OutputStream
. - exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.csv.CSVExporter
-
Exports a graph
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.csv.VisioExporter
-
Exports the specified graph into a Visio CSV file format.
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.dimacs.DIMACSExporter
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.dot.DOTExporter
-
Exports a graph into a plain text file in DOT format.
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Exports a graph in GraphML format.
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.gml.GmlExporter
-
Exports an graph into a plain text GML format.
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- exportGraph(Graph<V, E>, Writer) - Method in interface org.jgrapht.nio.GraphExporter
-
Export a graph using the given
Writer
. - exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Exports a graph in GraphML format.
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.json.JSONExporter
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.lemon.LemonExporter
- exportGraph(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.matrix.MatrixExporter
- exportHeader(PrintWriter) - Method in class org.jgrapht.nio.gml.GmlExporter
- exportHeader(PrintWriter) - Method in class org.jgrapht.nio.lemon.LemonExporter
- exportLaplacianMatrix(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.matrix.MatrixExporter
- exportNormalizedLaplacianMatrix(Graph<V, E>, Writer) - Method in class org.jgrapht.nio.matrix.MatrixExporter
- exportVertex(PrintWriter, Graph<V, E>, V) - Method in class org.jgrapht.nio.json.JSONExporter
- exportVertex(PrintWriter, V) - Method in class org.jgrapht.nio.csv.VisioExporter
- exportVertexAttributes(PrintWriter, Graph<V, E>, V) - Method in class org.jgrapht.nio.json.JSONExporter
- exportVertexLabels - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
-
Whether to try to print vertex labels.
- exportVertices(PrintWriter, Graph<V, E>) - Method in class org.jgrapht.nio.gml.GmlExporter
- exportVertices(PrintWriter, Graph<V, E>) - Method in class org.jgrapht.nio.lemon.LemonExporter
- exposed - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
- extend(int) - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
-
Performs DFS to seek after matching-augmenting path starting at the initial-vertex
- extendEqualityGraph() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Extends equality-graph subtracting minimal excess from all the COLUMNS UNCOVERED and adding it to the all ROWS COVERED
- extendMatchingEL(int) - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
-
DFS helper #1 (applicable for ODD-LENGTH paths ONLY)
- extendMatchingOL(int, int) - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
-
DFS helper #1 (applicable for ODD-LENGTH paths ONLY)
- Extension - Interface in org.jgrapht.alg.util.extension
-
Class which represents an abstract extension/encapsulation object.
- extensionFactory - Variable in class org.jgrapht.alg.util.extension.ExtensionManager
- ExtensionFactory<B> - Interface in org.jgrapht.alg.util.extension
-
Factory class which creates extension/encapsulation objects
- ExtensionManager<T,
B> - 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.
- extractValueBeforeWhitespace(String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
F
- factorial(int) - Static method in class org.jgrapht.util.MathUtil
-
Calculate the factorial of $n$.
- failedV - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The node $v$, which has an unembedded back edge incident to it.
- fair - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
- Fast adjacency check - Search tag in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- Section
- Fast adjacency check - Search tag in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- Section
- 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.
- FastutilFastLookupGSS<V,
E> - Class in org.jgrapht.opt.graph.fastutil -
The fast lookup specifics strategy implementation using fastutil maps for storage..
- FastutilFastLookupGSS() - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilFastLookupGSS
- FastutilFastLookupIntVertexGSS<E> - Class in org.jgrapht.opt.graph.fastutil
-
A specifics strategy implementation using fastutil maps for storage specialized for integer vertices.
- FastutilFastLookupIntVertexGSS() - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilFastLookupIntVertexGSS
- FastutilGSS<V,
E> - Class in org.jgrapht.opt.graph.fastutil -
A specifics strategy implementation using fastutil maps for storage.
- FastutilGSS() - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilGSS
- FastutilIntVertexGSS<E> - Class in org.jgrapht.opt.graph.fastutil
-
A specifics strategy implementation using fastutil maps for storage specialized for integer vertices.
- FastutilIntVertexGSS() - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilIntVertexGSS
- FastutilMapGraph<V,
E> - Class in org.jgrapht.opt.graph.fastutil -
A graph implementation using fastutil's map implementations for storage.
- FastutilMapGraph(Supplier<V>, Supplier<E>, GraphType) - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilMapGraph
-
Construct a new graph.
- FastutilMapGraph(Supplier<V>, Supplier<E>, GraphType, boolean) - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilMapGraph
-
Construct a new graph.
- FastutilMapIntVertexGraph<E> - Class in org.jgrapht.opt.graph.fastutil
-
A graph implementation using fastutil's map implementations for storage specialized for integer vertices.
- FastutilMapIntVertexGraph(Supplier<Integer>, Supplier<E>, GraphType) - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilMapIntVertexGraph
-
Construct a new graph.
- FastutilMapIntVertexGraph(Supplier<Integer>, Supplier<E>, GraphType, boolean) - Constructor for class org.jgrapht.opt.graph.fastutil.FastutilMapIntVertexGraph
-
Construct a new graph.
- fatalError(SAXParseException) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- fatalError(SAXParseException) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- fatalError(SAXParseException) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- fetch(V, Map<V, NeighborCache.Neighbors<V>>, Function<V, NeighborCache.Neighbors<V>>) - Method in class org.jgrapht.alg.util.NeighborCache
- field() - Method in class org.jgrapht.io.CSVParser
- field() - Method in class org.jgrapht.io.CSVParser.RecordContext
- field() - Method in class org.jgrapht.nio.csv.CSVParser
- field() - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- field(int) - Method in class org.jgrapht.io.CSVParser.RecordContext
- field(int) - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- FieldContext() - Constructor for class org.jgrapht.io.CSVParser.FieldContext
- FieldContext() - Constructor for class org.jgrapht.nio.csv.CSVParser.FieldContext
- FieldContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.CSVParser.FieldContext
- FieldContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.csv.CSVParser.FieldContext
- file() - Method in class org.jgrapht.io.CSVParser
- file() - Method in class org.jgrapht.nio.csv.CSVParser
- FileContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.CSVParser.FileContext
- FileContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.csv.CSVParser.FileContext
- fill(double[][], double) - Static method in class org.jgrapht.alg.tour.HeldKarpTSP
- fillContractionGraphAndVerticesArray() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Fills
contractionGraph
andvertices
. - fillContractionVerticesList() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Fills
contractionVertices
with vertices fromcontractionGraph
. - fillDistanceAndPredecessorMap() - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Fills
DeltaSteppingShortestPath.distanceAndPredecessorMap
concurrently. - fillEdges - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Fill edges
- find(int) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
- find(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the representative element of the set that element is in.
- findAllAnticomponentsOfY(Graph<V, E>, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Returns all anticomponents of a graph and a vertex set.
- findAllComponents(Graph<V, E>, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Finds all Components of a set F contained in V(g)
- findAndRelaxHeavyRequests(List<Set<V>>) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Manages execution of edges relaxation.
- findAndRelaxLightRequests(Set<V>) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Manages edge relaxations.
- findAntiHole(V, V) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Finds an anti-hole in the inspected
graph
. - findAttribute(String, Attributes) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- findAttribute(String, Attributes) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- findAttribute(String, Attributes) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- findBlossomRoot(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Finds a blossom root of the circuit created by the
edge
. - findBlossomRootInit(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Finds blossom root during the fractional matching initialization
- findBottleneck(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Finds augmenting path bottleneck by traversing the path edges.
- findCliques(List<V>, List<V>, List<V>, long) - Method in class org.jgrapht.alg.clique.BronKerboschCliqueFinder
- findCliques(Set<V>, Set<V>, Set<V>, long) - Method in class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Recursive implementation of the Bron-Kerbosch with pivot.
- findCycle(Set<V>, Graph<V, E>, V, V, V, V) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Starts the iterative depth-first traversal from
sourInSep
vertex. - 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.
- findCyclesInSCG(int, int, Graph<V, E>) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- findDelta() - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Calculates value of
DeltaSteppingShortestPath.delta
. - findFailedEdge(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Finds an unembedded back edge to
v
, which can be used to extract the Kuratowski subdivision. - findHighestObstructingPath(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Finds the highest obstructing path in the component rooted at
componentRoot
. - findHole(Graph<V, E>, V, V, V, V) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Finds a hole in the specified
graph
. - findHole(V, V, V) - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Computes a hole from the vertices of
subgraph
of the inspectedgraph
with verticesa
,b
andc
on this cycle (there must be no edge betweena
andc
. - findHole(V, V, V, V) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Finds a hole in the inspected
graph
. - findItem(int) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
- findMaximalConnectedSubset(Graph<V, E>, Set<V>, V, V, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
For each anticomponent X, find the maximal connected subset F' containing v5 with the properties that v1,v2 have no neighbours in F' and no vertex of F'\v5 is X-complete
- findMinSCSG(int) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- findPath(Deque<Integer>, int, int) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- findPathBetween(SimpleWeightedGraph<V, DefaultWeightedEdge>, V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
BFS method to find the edges in the shortest path from a source to a target vertex in a tree graph.
- findPathBetween(Graph<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.
- findPathDfs(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Edge, Predicate<BoyerMyrvoldPlanarityInspector.Node>, Predicate<BoyerMyrvoldPlanarityInspector.Node>, List<BoyerMyrvoldPlanarityInspector.Edge>) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Generically searches a path from the
current
node to the first node satisfying theisFinish
predicate consisting of all the nodes satisfying thecanGo
predicate. - findPathToV(List<BoyerMyrvoldPlanarityInspector.Edge>, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Finds a path from some intermediate nodes on the path represented by the list
path
to the nodev
. - findSCCS(int) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- findSeparators(Graph<V, E>, E) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Computes and returns all minimal separators in the neighborhood of the
edge
in thegraph
. - findSimpleCycles() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(Consumer<List<V>>) - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Find the simple cycles of the graph.
- findValidEdges() - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
-
Iterate over all paths and remove all edges used an even number of times.
- finish - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.Region
- finish() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Finishes the computation by checking the flow feasibility, computing arc flows, and creating an instance of
MinimumCostFlowAlgorithm.MinimumCostFlow
. - finish() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Finishes the fractional matching initialization.
- finish() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Finishes the algorithm after all nodes are matched.
- finish(Set<BoyerMyrvoldPlanarityInspector.Edge>) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Finishes the Kuratowski subdivision extraction by constructing the desired subgraph
- finishedData - Variable in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData1
- finishVertex(BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Makes the
vertex
inactive. - 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.
- fired - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- 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.matching.blossom.v5.BlossomVNode
-
Two-element array of references of the first elements in the linked lists of edges that are incident to this node.
- first - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Two-element array of the first elements in the circular doubly linked lists of incident tree edges in each direction.
- 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 - Variable in class org.jgrapht.util.UnmodifiableUnionSet
- 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.
- firstDeviations - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
For each path $P$, stores its deviation point.
- firstNodeInPath - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- firstNodeInPath - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- firstNonSaturated - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Reference of the first outgoing non-saturated arc (with positive residual capacity) incident to this node.
- firstOperand - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Vertex of a tree which is the first operand of this operations.
- firstSaturated - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Reference of the first outgoing saturated arc (with zero residual capacity) incident to this node
- firstStrictlyHigher(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Checks whether the first node
a
is strictly higher than nodesb
andc
- firstTreeChild - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
The first child in the linked list of children of this node.
- fixBoundaryOrder(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Orient the connections on the outer face of the component rooted at
componentRoot
such that they are ordered - fixdown(int) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- 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.
- fixup(int) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- fixup(SaturationDegreeColoring.HeapHandle) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- fl - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- flagIsEnumerationStartedEmpty - Variable in class org.jgrapht.util.PrefetchIterator
- FLOAT - Enum constant in enum class org.jgrapht.nio.AttributeType
- FLOAT - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- floatValue() - Method in class org.jgrapht.util.ModifiableInteger
- flow - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- 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
- flowMap - Variable in class org.jgrapht.alg.interfaces.FlowAlgorithm.FlowImpl
-
A mapping defining the flow on the network
- flowMatrix - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- flowMatrix - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- FloydWarshallShortestPaths<V,
E> - Class in org.jgrapht.alg.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.
- FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths - Class in org.jgrapht.alg.shortestpath
- FloydWarshallSingleSourcePaths(V) - Constructor for class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
- FlyweightEdgeEvent(Object, int, EE) - Constructor for class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
- FlyweightEdgeEvent(Object, E) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.FlyweightEdgeEvent
-
Creates a new FlyweightEdgeEvent.
- FlyweightVertexEvent(Object, int, VV) - Constructor for class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
- FlyweightVertexEvent(Object, V) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator.FlyweightVertexEvent
-
Creates a new FlyweightVertexEvent.
- folkmanGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- FORBIDDEN_EDGE_CUSTOM_ATTRIBUTE_KEYS - Static variable in class org.jgrapht.nio.gml.GmlExporter
- FORBIDDEN_VERTEX_CUSTOM_ATTRIBUTE_KEYS - Static variable in class org.jgrapht.nio.gml.GmlExporter
- forceFixup(int) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- forEach(Consumer<? super E>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- forest1 - Variable in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- forest2 - Variable in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- 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.
- format - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter
- format - Variable in class org.jgrapht.nio.csv.CSVExporter
- format - Variable in class org.jgrapht.nio.csv.CSVImporter
- format - Variable in class org.jgrapht.nio.dimacs.DIMACSExporter
- format - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- format - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- format - Variable in class org.jgrapht.nio.matrix.MatrixExporter
- Format() - Constructor for enum class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Format
- Format() - Constructor for enum class org.jgrapht.nio.graph6.Graph6Sparse6Exporter.Format
- Format() - Constructor for enum class org.jgrapht.nio.matrix.MatrixExporter.Format
- forward - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.TerminationCriterion
- forwardAccessVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertices
-
For each vertex in
contractionGraph
stores corresponding forward access vertices. - forwardAccessVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
For every vertex in
contractionGraph
stores a list of forward access vertices. - forwardBFS - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
-
Is used to run forward CH BFS query over the
contractionGraph
. - forwardDirection(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Checks whether the direction of blossomSibling references is suitable for the expand operation, i.e.
- forwardHeuristic - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Heuristic used for forward search.
- forwardMapping - Variable in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- forwardMapping - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- forwardSearch(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, List<CHManyToManyShortestPaths.BucketEntry>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>>, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>, boolean) - Method in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Performs forward search from the given
source
totargets
. - forwardSearchSpaces - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Stores forward search space for each start vertex.
- foundSCCs - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- FRACTIONAL - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- fractionalMatchingInitialization(BlossomVOptions) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Performs fractional matching initialization, see
BlossomVInitializer.initFractional()
for the description. - franklinGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- FREE_NODE_TIMESTAMP - Static variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
The timestamp used for free nodes.
- FREE_VERTEX - Enum constant in enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
- 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, BiFunction<LayoutModel2D<V>, Integer, FRLayoutAlgorithm2D.TemperatureModel>, Random, double) - 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(int, double, Random, double) - 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.
- fromLandmark - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
- fromPrevious - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath.Label
- frozen - Variable in class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
-
True once spanningTreeEdge is guaranteed to be the true minimum.
- FRQuadTree - Class in org.jgrapht.alg.drawing
-
A simple QuadTree for indexing during force calculations in the Fruchterman and Reingold Force-Directed Placement Algorithm.
- FRQuadTree(Box2D) - Constructor for class org.jgrapht.alg.drawing.FRQuadTree
-
Create a new tree for a certain area.
- FRQuadTree.Node - Class in org.jgrapht.alg.drawing
-
The Quad-Tree node.
- fruchtGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- FULL_INCOMING_EDGES - Enum constant in enum class org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
-
Support incoming edges.
- fullComponentCount - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Map for each separator how many components it produces.
- fullyComputedMap - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
- function - Variable in class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
-
Provides implementation of
ShortestPathAlgorithm
for a given graph.
G
- g - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- g - Variable in class org.jgrapht.alg.scoring.Coreness
- g - Variable in class org.jgrapht.alg.scoring.EigenvectorCentrality
- g - Variable in class org.jgrapht.alg.scoring.KatzCentrality
- g - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
The graph
- g - Variable in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree
- g1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- g1 - Variable in class org.jgrapht.graph.AsGraphUnion
- g2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- g2 - Variable in class org.jgrapht.graph.AsGraphUnion
- 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
- GabowStrongConnectivityInspector.VertexNumber<V> - Class in org.jgrapht.alg.connectivity
- gapHeuristic(int) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- 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)$.
- generate(Graph<V, E>) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Runs all the steps of the generator algorithm.
- generateArcs(List<NetworkGenerator.Node>, List<NetworkGenerator.Node>, int) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates
arcsToGenerate
number of arcs between nodes fromtails
andheads
. - generateBetween(int, int) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates a random number using random number generator between
startInclusive
andendInclusive
. - generateBidiakisCubeGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Bidiakis cube Graph.
- generateBipartiteMatchingProblem(Graph<V, E>) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates a bipartite matching problem satisfying the parameters specified in the config provided to this generator.
- 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.
- generateChains() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates source chains using all t-nodes.
- 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.
- generateGeneralizedPetersenGraph(Graph<V, E>, int, int) - Method in class org.jgrapht.generate.NamedGraphGenerator
- 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.
- generateMaxFlowProblem(Graph<V, E>) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates a maximum flow problem satisfying the parameters specified in the config provided to this generator.
- generateMinimumCostFlowProblem(Graph<V, E>) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates a minimum cost flow problem satisfying the parameters specified in the config provided to this generator.
- 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.
- generateNonSimpleRegularGraph(Graph<V, E>) - Method in class org.jgrapht.generate.RandomRegularGraphGenerator
- generatePappusGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Pappus Graph.
- generatePaths(Set<V>, Set<V>, boolean, Integer, Map<E, Integer>) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Generate all paths from the sources to the targets, using pre-computed minimum distances.
- generatePetersenGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Petersen Graph.
- generatePositiveRandom(int) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
- generatePoussinGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Poussin Graph.
- generateRandom(int) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates a random number using random number generator between 0 and
endExclusive
. - generateSchläfliGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Schläfli Graph.
- generateSelfLoops - Variable in class org.jgrapht.generate.ComplementGraphGenerator
- generateSimpleRegularGraph(Graph<V, E>) - Method in class org.jgrapht.generate.RandomRegularGraphGenerator
- 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.
- generateZacharyKarateClubGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Zachary's karate club Graph.
- generators - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
List of all vertices that generate a minimal separator of
chordGraph
- get() - Method in class org.jgrapht.util.SupplierUtil.ConstructorSupplier
- get(int) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- 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
- getAccessVertices() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Returns access vertices of this transit node routing.
- getActiveSuccessorOnOuterFace(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Returns an active node on the outer face in the direction
dir
starting from thestart
node - getAllEdges(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getAllEdges(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(Integer, Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.
- getAllEdges(Integer, Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- getAllEdges(Integer, Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- getAllEdges(Long, Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- 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.guava.BaseGraphAdapter
- getAllEdges(V, V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- getAllEdges(V, V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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(Graph<V, E>, V) - Method in class org.jgrapht.alg.lca.NaiveLCAFinder
-
Returns a set of nodes reachable from the
start
. - 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.
- getArcCosts() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns a function which specifies the network arc costs.
- getArcCosts() - Method in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Returns a function which specifies the network arc costs.
- getArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of arcs in the network.
- getArcTo(TreeDynamicConnectivity.Node) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Returns an arc, which target is equal to the
node
- getATN() - Method in class org.jgrapht.io.CSVLexer
- getATN() - Method in class org.jgrapht.io.CSVParser
- getATN() - Method in class org.jgrapht.io.DOTLexer
- getATN() - Method in class org.jgrapht.io.DOTParser
- getATN() - Method in class org.jgrapht.io.GmlLexer
- getATN() - Method in class org.jgrapht.io.GmlParser
- getATN() - Method in class org.jgrapht.io.JsonLexer
- getATN() - Method in class org.jgrapht.io.JsonParser
- getATN() - Method in class org.jgrapht.nio.csv.CSVLexer
- getATN() - Method in class org.jgrapht.nio.csv.CSVParser
- getATN() - Method in class org.jgrapht.nio.dot.DOTLexer
- getATN() - Method in class org.jgrapht.nio.dot.DOTParser
- getATN() - Method in class org.jgrapht.nio.gml.GmlLexer
- getATN() - Method in class org.jgrapht.nio.gml.GmlParser
- getATN() - Method in class org.jgrapht.nio.json.JsonLexer
- getATN() - Method in class org.jgrapht.nio.json.JsonParser
- 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.
- getBackwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertices
-
Given a contraction vertex
vertex
returns its backward access vertices - 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
- getBits(int) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
-
Converts the next k bits of data to an integer
- 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.
- getBlossomNodes(BlossomVNode, Map<BlossomVNode, Set<V>>) - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes the set of original contracted vertices in the
pseudonode
and puts computes value into theblossomNodes
. - getBox() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Get the area represented by this node.
- getBridges() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns the graph's bridges.
- getBSet(V) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- getBSet(V) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- getBucketsSupplier(V) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Creates a supplier of sets for the
bucketStructure
. - getCandidatePath(GraphPath<V, E>, int, GraphPath<V, E>) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Builds a candidate path based on the information provided in the methods parameters.
- 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.
- getCapacities() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Returns the capacity function of this problem.
- getCapacities() - Method in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Returns the capacity function of this problem.
- getCapacity() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates an arc capacity.
- getCapacity() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the CAPACITY keyword in the imported file.
- getCentroid() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Get the centroid of all points contained in this node.
- 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
. - getChainLength() - Method in class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
Returns the length of this node's chain.
- getChannelNames() - Method in class org.jgrapht.io.CSVLexer
- getChannelNames() - Method in class org.jgrapht.io.DOTLexer
- getChannelNames() - Method in class org.jgrapht.io.GmlLexer
- getChannelNames() - Method in class org.jgrapht.io.JsonLexer
- getChannelNames() - Method in class org.jgrapht.nio.csv.CSVLexer
- getChannelNames() - Method in class org.jgrapht.nio.dot.DOTLexer
- getChannelNames() - Method in class org.jgrapht.nio.gml.GmlLexer
- getChannelNames() - Method in class org.jgrapht.nio.json.JsonLexer
- getChildren() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Get the children of this node as a list.
- 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.
- getClosest(List<V>, Set<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Initialise the Map storing closest unvisited vertex for each tour vertex
- getClosest(V, Set<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Determines closest unvisited vertex to a vertex in the current tour
- getClustering() - Method in class org.jgrapht.alg.clustering.GirvanNewmanClustering
- getClustering() - Method in class org.jgrapht.alg.clustering.KSpanningTreeClustering
- getClustering() - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering
- 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.
- getComments() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the
List
of values for the COMMENT keyword in the imported file. - 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.
- getComponentRoot(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Returns a component root of component the
node
is contained in. - getCondensation() - Method in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- 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.
- getContentAndReplace(int) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Replaces the bucket at the
bucketIndex
with a new instance of the concurrent set. - getContractionGraph() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns contracted graph.
- getContractionHierarchy() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Returns contraction hierarchy of this transit node routing.
- 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.
- getCoordinates() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
-
Returns a copy of the coordinates of this node.
- getCoordinatesLength() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
-
Returns the number of elements the coordinates of this node have (either two or three).
- getCoordinateValue(int) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
-
Returns the value of the coordinate element with zero-based index i of this node.
- getCopy() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
Get the backing set's unmodifiable copy, or a direct reference to the backing set if in copyless mode.
- 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
- getCost() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Generates an arc cost.
- 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.
- getCostEstimate(V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ReversedGraphHeuristic
- getCosts() - Method in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
-
Returns a cost function of this problem.
- getCosts() - Method in interface org.jgrapht.generate.netgen.BipartiteMatchingProblem
-
Returns a cost function of this problem.
- getCPPSolution(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.ChinesePostman
-
Solves the Chinese Postman Problem on the given graph.
- getCreator() - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Get the creator for the meta field.
- getCurrent() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
Returns the node this circulator has just traversed
- getCurrentDirection() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
- getCurrentDirection() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
-
Returns the direction of the current edge
- getCurrentMapping() - Method in class org.jgrapht.alg.isomorphism.VF2State
- getCurrentMinusPlusHeap(int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Returns the current heap of (-, +) cross-tree edges.
- getCurrentOriginal(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Returns the original endpoint of this edge for some current
endpoint
. - getCurrentPlusMinusHeap(int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Returns the current heap of (+, -) cross-tree edges.
- 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 class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Computes cycle with minimum mean.
- getCycle() - Method in interface org.jgrapht.alg.interfaces.MinimumCycleMeanAlgorithm
-
Computes cycle with minimum mean.
- getCycle() - Method in exception class 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.
- getCycleMean() - Method in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Computes minimum mean among all cycle.
- getCycleMean() - Method in interface org.jgrapht.alg.interfaces.MinimumCycleMeanAlgorithm
-
Computes minimum mean among all cycle.
- 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.
- getDefaultAlpha(Set<V>) - Static method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Returns a coloring such that all vertices have the same (zero) color.
- 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).
- getDelimiter() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Get the delimiter (comma, semicolon, pipe, etc).
- getDelimiter() - Method in class org.jgrapht.nio.csv.CSVExporter
-
Get the delimiter (comma, semicolon, pipe, etc).
- getDelimiter() - Method in class org.jgrapht.nio.csv.CSVImporter
-
Get the delimiter (comma, semicolon, pipe, etc).
- 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() - Method in class org.jgrapht.traverse.BreadthFirstIterator.SearchNodeData
-
Depth of node in search tree
- 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.
- getDescription() - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Get the description for the meta field.
- 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.
- getDimension() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the DIMENSION keyword in the imported file.
- getDir() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
-
Returns the direction of the edge returned by this iterator
- getDirFrom(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Returns the direction to the opposite node with respect to the
current
. - getDisjointGraphUnion(Graph<V, E>, Graph<V, E>) - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Calculates and returns a disjoint graph union of
graph1
andgraph2
- getDisplayDataType() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the DISPLAY_DATA_TYPE keyword in the imported file.
- getDistance() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Computes edit distance for
tree1
andtree2
. - getDistance() - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- getDistance(V) - Method in class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
-
Returns distance to vertex
v
computed so far. - getDistance(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
- getDistance(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- getDistance(V, V) - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
- getDistanceAndPredecessorMap() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
-
Return all paths using the traditional representation of the shortest path tree, which stores for each vertex (a) the distance of the path from the source vertex and (b) the last edge used to reach the vertex from the source vertex.
- getDistanceAndPredecessorMap() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Get the internal map used for representing the paths.
- getDistanceAndPredecessorMap(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>) - Method in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Computes distance and predecessor map for a single source shortest paths search starting at source and finishing the search as soon as all
targets
are reached. - getDistinctObjectGraph(Graph<V, E>) - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
- getDistribution(List<K>, int) - Method in class org.jgrapht.generate.netgen.Distributor
-
Computes and returns a value distribution for the list of keys.
- 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() - Method in class org.jgrapht.traverse.BreadthFirstIterator.SearchNodeData
-
Edge to parent
- getEdge(int, int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- getEdge(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getEdge(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(Integer, Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns an edge connecting source vertex to target vertex if such vertices and such edge exist in this graph.
- getEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- getEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- getEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- getEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- getEdge(Integer, Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- getEdge(Long, Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- 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.guava.BaseGraphAdapter
- getEdge(V, V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- getEdge(V, V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- getEdgeAttribute(E, String) - Method in class org.jgrapht.nio.BaseExporter
-
Get an optional of an edge attribute
- getEdgeAttributeProvider() - Method in class org.jgrapht.nio.BaseExporter
-
Get the edge attribute provider
- getEdgeAttributes(E) - Method in class org.jgrapht.nio.BaseExporter
-
Get edge attributes
- 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
- getEdgeDataFormat() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the EDGE_DATA_FORMAT keyword in the imported file.
- getEdgeDescriptor() - Method in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Get the edge descriptor used in the format.
- getEdgeFromIndex(long) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Returns the edge with given index.
- getEdgeFromIndex(long) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
Returns the edge with given index.
- getEdgeId(E) - Method in class org.jgrapht.nio.BaseExporter
-
Get an optional of the edge id
- getEdgeIdProvider() - Method in class org.jgrapht.nio.BaseExporter
-
Get the edge id provider
- getEdgeLabelAttributeName() - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Get the attribute name for edge labels
- getEdgeList() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
-
Given the implicit representation of the path between
source
andsink
constructs the edge list of the path. - getEdgeList() - Method in class org.jgrapht.graph.GraphWalk
- getEdgeList() - Method in interface org.jgrapht.GraphPath
-
Returns the edges making up the path.
- getEdgeNumbers(E) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- getEdges() - Method in 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
- getEdgesCollectionName() - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Get the name used for the edges collection in the file.
- getEdgesCollectionName() - Method in class org.jgrapht.nio.json.JSONExporter
-
Get the name used for the edges collection in the file.
- getEdgesCollectionName() - Method in class org.jgrapht.nio.json.JSONImporter
-
Get the name used for the edges collection in the file.
- getEdgeScore(E) - Method in interface org.jgrapht.alg.interfaces.EdgeScoringAlgorithm
-
Get an edge score
- getEdgeScore(E) - Method in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- 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(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
- getEdgeSource(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- getEdgeSource(E) - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
- 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 class org.jgrapht.graph.guava.BaseNetworkAdapter
- 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.
- getEdgeSource(E) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- getEdgeSource(E) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- getEdgeSource(IntIntPair) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- getEdgeSource(IntIntSortedPair) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- getEdgeSource(LongLongSortedPair) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- getEdgeSource(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getEdgeSource(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- getEdgeSource(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- getEdgeSource(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns the source vertex of an edge.
- getEdgeSource(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- getEdgeSource(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- 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.guava.BaseGraphAdapter
- getEdgeSupplier() - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- getEdgeSupplier() - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- getEdgeSupplier() - Method in class org.jgrapht.graph.MaskSubgraph
-
Return the edge supplier that the graph uses whenever it needs to create new edges.
- getEdgeSupplier() - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getEdgeSupplier() - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- getEdgeSupplier() - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- getEdgeSupplier() - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- getEdgeTarget() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the target vertex that this event is related to.
- getEdgeTarget(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
- getEdgeTarget(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- getEdgeTarget(E) - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
- 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 class org.jgrapht.graph.guava.BaseNetworkAdapter
- 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.
- getEdgeTarget(E) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- getEdgeTarget(E) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- getEdgeTarget(IntIntPair) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- getEdgeTarget(IntIntSortedPair) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- getEdgeTarget(LongLongSortedPair) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- getEdgeTarget(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getEdgeTarget(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- getEdgeTarget(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- getEdgeTarget(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns the target vertex of an edge.
- getEdgeTarget(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- getEdgeTarget(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- getEdgeWeight() - Method in class org.jgrapht.event.GraphEdgeChangeEvent
-
Returns the weight of the edge that this event is related to.
- getEdgeWeight(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
- getEdgeWeight(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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 class org.jgrapht.graph.guava.BaseNetworkAdapter
- getEdgeWeight(E) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- 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
- getEdgeWeight(E) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- getEdgeWeight(E) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- getEdgeWeight(E) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- getEdgeWeight(LongLongSortedPair) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- getEdgeWeight(Integer) - Method in class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
- getEdgeWeight(Integer) - Method in class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
- getEdgeWeight(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getEdgeWeight(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns the weight assigned to a given edge.
- getEdgeWeightAttributeName() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
-
Get the attribute name for edge weights
- getEdgeWeightAttributeName() - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Get the attribute name for edge weights
- getEdgeWeightAttributeName() - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Get the attribute name for edge weights
- getEdgeWeightAttributeName() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
-
Get the attribute name for edge weights
- getEdgeWeightAttributeName() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
-
Get the attribute name for edge weights
- getEdgeWeightAttributeName() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Get the attribute name for edge weights
- getEdgeWeightFormat() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the EDGE_WEIGHT_FORMAT keyword in the imported file.
- 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
- getEdgeWeightFunction(String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getEdgeWeightType() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the EDGE_WEIGHT_TYPE keyword in the imported file.
- getEdgeWithAttributesFactory() - Method in class org.jgrapht.nio.dot.DOTImporter
-
Get the user custom edges factory with attributes.
- getEdgeWithAttributesFactory() - Method in class org.jgrapht.nio.json.JSONImporter
-
Get the user custom edges factory with attributes.
- getEditOperationLists() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Computes a list of edit operations which transform
tree1
intotree2
. - getElement(Iterable<E>, int) - Static method in class org.jgrapht.util.CollectionUtil
-
Returns from the given
Iterable
the element with the givenindex
. - getElement(List<E>, int) - Static method in class org.jgrapht.nio.dimacs.DIMACSImporter
- 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.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
- 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
. - getEps(BlossomVTree) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Computes and returns the value which can be assigned to the
tree.eps
so that it doesn't violate in-tree constraints. - 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.
- getEven(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- getExpandNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getExpandTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getExposed() - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
- 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.
- getExternallyActiveSuccessorOnOuterFace(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Returns acirculator to the externally active node on the outer face between the
start
andend
nodes in the directiondir
. - 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).
- getFinishedData() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- getFinishedData() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData1
- getFinishedData() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData2
- 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.
- getFirstOperand() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Returns first operand of this operation
- 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.
- getFirstVertexIndex(List<V>) - Method in class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Returns the start vertex of the tour about to compute.
- 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.
- getFormat() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Get the format that the importer is using.
- getFormat() - Method in class org.jgrapht.nio.csv.CSVExporter
-
Get the format of the exporter
- getFormat() - Method in class org.jgrapht.nio.csv.CSVImporter
-
Get the format that the importer is using.
- getFormat() - Method in class org.jgrapht.nio.dimacs.DIMACSExporter
-
Get the format of the exporter
- getFormat() - Method in class org.jgrapht.nio.matrix.MatrixExporter
-
Get the format that the exporter is using.
- getForwardAccessVertices(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertices
-
Given a contraction vertex
vertex
returns its forward access vertices - 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).
- getGrammarFileName() - Method in class org.jgrapht.io.CSVLexer
- getGrammarFileName() - Method in class org.jgrapht.io.CSVParser
- getGrammarFileName() - Method in class org.jgrapht.io.DOTLexer
- getGrammarFileName() - Method in class org.jgrapht.io.DOTParser
- getGrammarFileName() - Method in class org.jgrapht.io.GmlLexer
- getGrammarFileName() - Method in class org.jgrapht.io.GmlParser
- getGrammarFileName() - Method in class org.jgrapht.io.JsonLexer
- getGrammarFileName() - Method in class org.jgrapht.io.JsonParser
- getGrammarFileName() - Method in class org.jgrapht.nio.csv.CSVLexer
- getGrammarFileName() - Method in class org.jgrapht.nio.csv.CSVParser
- getGrammarFileName() - Method in class org.jgrapht.nio.dot.DOTLexer
- getGrammarFileName() - Method in class org.jgrapht.nio.dot.DOTParser
- getGrammarFileName() - Method in class org.jgrapht.nio.gml.GmlLexer
- getGrammarFileName() - Method in class org.jgrapht.nio.gml.GmlParser
- getGrammarFileName() - Method in class org.jgrapht.nio.json.JsonLexer
- getGrammarFileName() - Method in class org.jgrapht.nio.json.JsonParser
- getGraph() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the original graph.
- getGraph() - Method in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- 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.isomorphism.ColorRefinementIsomorphismInspector.DistinctGraphObject
- getGraph() - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- 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.EppsteinShortestPathIterator.EppsteinGraphPath
- getGraph() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
- getGraph() - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- getGraph() - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths.JohnsonSingleSourcePaths
- 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.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
-
Returns the graph, which defines the problem
- getGraph() - Method in interface org.jgrapht.generate.netgen.BipartiteMatchingProblem
-
Returns the graph, which defines the problem
- getGraph() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Returns the network the problem is defined on.
- getGraph() - Method in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Returns the network the problem is defined on.
- getGraph() - Method in class org.jgrapht.graph.DefaultGraphIterables
- getGraph() - Method in class org.jgrapht.graph.GraphWalk
- getGraph() - Method in interface org.jgrapht.GraphIterables
-
Get the underlying graph.
- getGraph() - Method in interface org.jgrapht.GraphPath
-
Returns the graph over which this path is defined.
- getGraph() - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- getGraph() - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- getGraph() - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- getGraph() - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- getGraph() - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Get the graph being traversed.
- getGraphAttribute(String) - Method in class org.jgrapht.nio.BaseExporter
-
Get an optional of a graph attribute
- getGraphAttributeProvider() - Method in class org.jgrapht.nio.BaseExporter
-
Get the graph attribute provider.
- 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.
- getGraphId() - Method in class org.jgrapht.nio.BaseExporter
-
Get the graph id if present
- getGraphIdProvider() - Method in class org.jgrapht.nio.BaseExporter
-
Get the graph id provider.
- 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
- getHead() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
Returns the start vertex of the path
- 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
- getHeight() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a height of this node
- 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).
- getId() - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- getImportException(Exception, String) - Static method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getImprovementGraphLabelMap() - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Returns the mapping that is used in the valid cycle detection algorithm, i.e.
- 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.
- getIndexFromEdge(IntIntPair) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Returns the index associated with the given edge.
- getIndexFromEdge(IntIntSortedPair) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
Returns the index associated with the given edge.
- 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. - getInEdges(int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- getInitializationType() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Returns initialization type
- getInitializer() - Method in class org.jgrapht.alg.drawing.BaseLayoutAlgorithm2D
-
Get the initializer
- getInitialSolution() - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Calculates an initial solution depending on whether an initial solution was transferred while construction of the algorithm.
- 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.
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilFastLookupGSS
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilFastLookupIntVertexGSS
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilGSS
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilIntVertexGSS
- getInverse() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- getIterationOrder() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Returns the type of iterator used in this
ChordalityInspector
- getKey(String[]) - Static method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getKeywords() - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Get the keywords for the meta field.
- 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
. - getL1Distance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getL2Distance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getLabel(V) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the label of the subset that contains
vertex
. - getLabeling(E) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Computes the labeling of the neighborhood of
edge
on the verticessource
andtarget
. - 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$.
- getLastInChain() - Method in class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
Returns the last node of this node's chain.
- getLastNode() - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the last
node
of this list. - getLastValidDeviation(GraphPath<V, E>, V) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Computes vertex $u$ such that $pathValidator#isValidPath([start_vertex, u], (u,v)) = false$, where $[start_vertex, u]$ denotes the subpath of $P$ from its start to vertex $u$ and $v$ is the next vertex in $P$ after $u$.
- 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 - getLeft() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a left child of this node
- getLeftHeight() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a height of the left subtree
- getLeftSubtreeSize() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a size of the left subtree
- 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.
- getLineIterator(Reader) - Static method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getLInfDistance(TSPLIBImporter.Node, TSPLIBImporter.Node) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getListOfBestOptions(Map<V, Double>) - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Returns the list of the best options as stored in
savings
. - getLocalAugmentationCycle() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Calculates a valid subset-disjoint negative cycle.
- getLocalityFilter() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Returns locality filter of this transit node routing.
- 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
- getMaskedVerticesAndEdges(GraphPath<V, E>, V, int) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
For the given
path
builds sets of vertices and edges to be masked. - 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.
- getMax() - Method in class org.jgrapht.util.AVLTree
-
Returns the maximum node in this tree or null if the tree is empty.
- getMaxCap() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns arc capacity upper bound.
- getMaxCost() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns arc cost upper bound.
- getMaxEdgeWeight() - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Calculates max edge weight in the
BaseShortestPathAlgorithm.graph
. - getMaxFailures() - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Returns the maximum allowed number of consecutive failed attempts to add an edge.
- getMaximumArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of nodes this network can contain.
- getMaximumArcNum(long, long, long) - Static method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs a network with specified node parameters can contain.
- getMaximumArcNum(long, long, long, long, long) - Static method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs a network with specified node parameters can contain.
- getMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - 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
. - getMaximumWeightMatching(Graph<V, E>, LinkedList<E>) - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
-
Find the maximum weight matching of a path using dynamic programming.
- getMaxLabelVertex(Map<V, Integer>) - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the vertex with the maximal label.
- getMaxSink2ALlArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between network sinks and all other nodes.
- getMaxSource2AllArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between network sources and all other nodes.
- getMaxSource2SinkArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between network sources and network sinks.
- getMaxSource2TNodeArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs this network can contain between network sources and transshipment nodes.
- getMaxSource2TSourceArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum possible number of arcs this network can contain between the source nodes.
- getMaxTNode2SinkArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between transshipment nodes and network sinks.
- getMaxTNode2TNodeArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between transshipment nodes of this network
- getMaxTNode2TSourceArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between transshipment nodes and network sources.
- getMaxTransshipNode2AllArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between transshipment nodes and all other nodes.
- getMaxTSink2SinkArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between network sinks.
- getMaxTSink2TNodeArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between network sinks and transshipment nodes.
- getMaxTSink2TSourceArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns maximum number of arcs between network sinks and network sources.
- 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.
- getMetadata() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Returns the
TSPLIBImporter.Metadata
of the latest imported file or null, if no import completed yet or the latest import failed. - getMin() - Method in class org.jgrapht.util.AVLTree
-
Returns the minimum node in this tree or null if the tree is empty.
- getMinCap() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns arc capacity lower bound.
- getMinCost() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns arc cost lower bound.
- getMinimalCapacity() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- 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.
- getMinimumArcNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns minimum number of nodes this network can contain.
- getMinimumArcNum(long, long, long) - Static method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns minimum number of arcs a network with specifies node parameters can contain.
- 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.
- getMinWeightAccessVertices(V, V) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
For vertices
source
andsink
finds pair of access vertices with smallest weight over all pairs. - 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
- getModeNames() - Method in class org.jgrapht.io.CSVLexer
- getModeNames() - Method in class org.jgrapht.io.DOTLexer
- getModeNames() - Method in class org.jgrapht.io.GmlLexer
- getModeNames() - Method in class org.jgrapht.io.JsonLexer
- getModeNames() - Method in class org.jgrapht.nio.csv.CSVLexer
- getModeNames() - Method in class org.jgrapht.nio.dot.DOTLexer
- getModeNames() - Method in class org.jgrapht.nio.gml.GmlLexer
- getModeNames() - Method in class org.jgrapht.nio.json.JsonLexer
- getName() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the NAME keyword in the imported file.
- getNearestNeighbor(V, V[], int, Graph<V, E>) - Static method in class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Find the vertex in the range staring at
from
that is closest to the element at index from-1. - getNeighborLabelCountsAndMaximum(V) - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Compute the frequency of the labels of all neighbors of a vertex and the maximum frequency of the vertices, which have a label not equal to the input vertex label.
- getNeighborList() - Method in class org.jgrapht.alg.util.NeighborCache.Neighbors
- getNeighbors() - Method in class org.jgrapht.alg.util.NeighborCache.Neighbors
- getNetworkInfo() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns the network information computed for the last generated problem.
- getNext() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNode
-
Returns the next node in the list structure with respect to this node
- getNext() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
-
Returns the next node in the list structure with respect to this node
- getNextArc(TreeDynamicConnectivity.Arc) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Returns an arc which is stored right after the
arc
. - getNextElementFromInnerFunctor() - Method in class org.jgrapht.util.PrefetchIterator
-
Serves as one contact place to the functor; all must use it and not directly the NextElementFunctor.
- getNextFreeLabel() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the next free label in the label map respectively partition
- getNextIndex() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- getNextLastResult - Variable in class org.jgrapht.util.PrefetchIterator
- getNextOnPath(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Edge) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Effectively is a method for finding node
z
in the notations of the original paper. - getNode(int) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the
node
at the specified position in this list. - getNode(T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Returns an internal representation of the
element
- getNodeAt(int) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the
node
at the specified position in this list. - getNodeCoordType() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the NODE_COORD_TYPE keyword in the imported file.
- getNodeNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of nodes in the network.
- getNodeSupply() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns a function which defines the supply and demand of each node in that 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 that network.
- getNumber() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
-
Returns the number of this node as specified in the source TSPLIB95-file.
- 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.
- getNumberOfPoints() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Get the total number of points under this node.
- 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
- getObject() - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector.DistinctGraphObject
- getOdd(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- getOddSetCover() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
-
Get an odd set cover which proves the optimality of the computed matching.
- getOpposite(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Returns the opposite edge with respect to the
endpoint
. - getOpposite(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Returns the opposite node of the
node
- getOppositeMatched() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Helper method, returns a node this node is matched to.
- 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.
- getOrderedVertices(Map<V, TSPLIBImporter.Node>) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getOutEdges(int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- getOutgoing() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
- getOutrootAndRestHeapRoot(V) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Builds outroot and heapification of other sidetracks of
v
. - getParent() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Returns the parent of this vertex.
- getParent() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Returns the parent of this node in the dfs tree.
- getParent() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a parent of this node
- 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).
- getPartition1() - Method in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
-
Returns one of the 2 partitions of the graph (no 2 vertices in this set share an edge)
- getPartition1() - Method in interface org.jgrapht.generate.netgen.BipartiteMatchingProblem
-
Returns one of the 2 partitions of the graph (no 2 vertices in this set share an edge)
- getPartition1DominatedSet() - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
-
Gets the subset dominated by partition1.
- getPartition2() - Method in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
-
Returns one of the 2 partitions of the graph (no 2 vertices in this set share an edge)
- getPartition2() - Method in interface org.jgrapht.generate.netgen.BipartiteMatchingProblem
-
Returns one of the 2 partitions of the graph (no 2 vertices in this set share an edge)
- 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() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex
-
Returns path between a vertex in the graph and
vertex
. - getPath(Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- getPath(Integer, Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- 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.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
- getPath(V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths.JohnsonSingleSourcePaths
- 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.BaseManyToManyShortestPaths
-
Get a shortest path from a source vertex to a sink vertex.
- 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.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
Return the path from the
source
vertex to thetarget
vertex. - 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.DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl
-
Return the path from the
source
vertex to thetarget
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.DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl
-
Return the path from the
source
vertex to thetarget
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.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
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.
- getPathAvoidingX(Graph<V, E>, V, V, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Returns a path in g from start to end avoiding the vertices in X
- 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() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
-
Return the paths computed by this iterator.
- getPaths(Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- 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.BaseManyToManyShortestPaths
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BaseMultiObjectiveShortestPathAlgorithm
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.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.BaseKDisjointShortestPathsAlgorithm
-
Returns the $k$ shortest simple paths in increasing order of weight.
- 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.YenKShortestPath
-
Computes
k
shortest loopless paths betweensource
andsink
. - getPathsWithIdMap(Integer, Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- getPathsWithoutIdMap(Integer, Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- 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.BaseManyToManyShortestPaths
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- 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.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPenultimateBlossom() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Computes and returns the penultimate blossom of this node, i.e.
- getPenultimateBlossomAndFixBlossomGrandparent() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Computes and returns the penultimate blossom of this node.
- getPercentCapacitated() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns percent of arcs that have finite capacity.
- getPercentWithInfCost() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns percent of arcs that have infinite cost.
- 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.
- getPoints() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Get a list of all points contained in this node.
- getPositionInPathArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal positionInPath array.
- getPossibleArcNum(NetworkGenerator.Node, Set<NetworkGenerator.Node>) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns the number of arcs it is possible to generate from
node
to thenodes
set. - getPotentials() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Get the vertex potentials.
- getPredecessor() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a predecessor of this node according to the tree in order traversal, or
null
if this node is a minimum node in the tree - getPredecessors(Map<V, Integer>, V) - Method in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Returns the predecessors of
vertex
in the order defined bymap
. - getPredecessors(Map<V, Integer>, V) - Method in class org.jgrapht.alg.color.ChordalGraphColoring
-
Returns the predecessors of
vertex
in the order defined bymap
. - getPredecessors(Map<V, Integer>, V) - Method in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Returns the predecessors of
vertex
in the order defined bymap
. - getPredecessors(Map<V, Integer>, V) - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Returns the predecessors of
vertex
in the order defined bymap
. - getPrev() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
Returns a node adjacent to the current node along the boundary, which is not equal to the next node along the traversal.
- getPrev() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNode
-
Returns the previous node in the list structure with respect to this node
- getPrev() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
-
Returns the previous node in the list structure with respect to this node
- getProblem() - Method in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Get the name of the problem.
- getPrunedAccessVertices(V, Set<V>, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E>, boolean) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVerticesBuilder
-
Selects redundant access vertices from
vertices
. - getPureSinkNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns number of pure sinks in the network.
- getPureSinks() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Returns a list containing network pure sinks.
- getPureSourceNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns number of pure sources in the network.
- getPureSources() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Returns a list containing network pure sources.
- 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
- getReducedCost() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
Returns reduced cost of this arc.
- getRemoved(V) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- getRemoved(V) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- getResidualCapacity() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- getRestHeap(List<EppsteinShortestPathIterator.PathsGraphVertex>, int, int) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Constructs an explicit tree-like representation of the binary heap contained in
vertices
starting at positioni
. - getRight() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a right child of this node
- getRightHeight() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a height of the right subtree
- getRightSubtreeSize() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a size of the right subtree
- getRoot() - Method in class org.jgrapht.alg.drawing.FRQuadTree
-
Get the root node of the tree.
- getRoot() - Method in class org.jgrapht.util.AVLTree
-
Returns the root of this tree or null if this tree is empty.
- getRoot() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a root of the tree this node is stored in
- getRuleIndex() - Method in class org.jgrapht.io.CSVParser.FieldContext
- getRuleIndex() - Method in class org.jgrapht.io.CSVParser.FileContext
- getRuleIndex() - Method in class org.jgrapht.io.CSVParser.HeaderContext
- getRuleIndex() - Method in class org.jgrapht.io.CSVParser.RecordContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.AListContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.AttributesListContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.CompoundStatementContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.GraphContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.GraphIdentifierContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.IdentifierPairContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.IdentifierPairStatementContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.NodeIdentifierContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.NodeStatementContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.NodeStatementNoAttributesContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.PortContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.StatementContext
- getRuleIndex() - Method in class org.jgrapht.io.DOTParser.SubgraphStatementContext
- getRuleIndex() - Method in class org.jgrapht.io.GmlParser.GmlContext
- getRuleIndex() - Method in class org.jgrapht.io.GmlParser.KeyValuePairContext
- getRuleIndex() - Method in class org.jgrapht.io.JsonParser.ArrayContext
- getRuleIndex() - Method in class org.jgrapht.io.JsonParser.JsonContext
- getRuleIndex() - Method in class org.jgrapht.io.JsonParser.ObjContext
- getRuleIndex() - Method in class org.jgrapht.io.JsonParser.PairContext
- getRuleIndex() - Method in class org.jgrapht.io.JsonParser.ValueContext
- getRuleIndex() - Method in class org.jgrapht.nio.csv.CSVParser.FieldContext
- getRuleIndex() - Method in class org.jgrapht.nio.csv.CSVParser.FileContext
- getRuleIndex() - Method in class org.jgrapht.nio.csv.CSVParser.HeaderContext
- getRuleIndex() - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.AListContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.AttributesListContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.CompoundStatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.GraphContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.GraphIdentifierContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairStatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.NodeIdentifierContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementNoAttributesContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.PortContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- getRuleIndex() - Method in class org.jgrapht.nio.gml.GmlParser.GmlContext
- getRuleIndex() - Method in class org.jgrapht.nio.gml.GmlParser.KeyValuePairContext
- getRuleIndex() - Method in class org.jgrapht.nio.json.JsonParser.ArrayContext
- getRuleIndex() - Method in class org.jgrapht.nio.json.JsonParser.JsonContext
- getRuleIndex() - Method in class org.jgrapht.nio.json.JsonParser.ObjContext
- getRuleIndex() - Method in class org.jgrapht.nio.json.JsonParser.PairContext
- getRuleIndex() - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- getRuleNames() - Method in class org.jgrapht.io.CSVLexer
- getRuleNames() - Method in class org.jgrapht.io.CSVParser
- getRuleNames() - Method in class org.jgrapht.io.DOTLexer
- getRuleNames() - Method in class org.jgrapht.io.DOTParser
- getRuleNames() - Method in class org.jgrapht.io.GmlLexer
- getRuleNames() - Method in class org.jgrapht.io.GmlParser
- getRuleNames() - Method in class org.jgrapht.io.JsonLexer
- getRuleNames() - Method in class org.jgrapht.io.JsonParser
- getRuleNames() - Method in class org.jgrapht.nio.csv.CSVLexer
- getRuleNames() - Method in class org.jgrapht.nio.csv.CSVParser
- getRuleNames() - Method in class org.jgrapht.nio.dot.DOTLexer
- getRuleNames() - Method in class org.jgrapht.nio.dot.DOTParser
- getRuleNames() - Method in class org.jgrapht.nio.gml.GmlLexer
- getRuleNames() - Method in class org.jgrapht.nio.gml.GmlParser
- getRuleNames() - Method in class org.jgrapht.nio.json.JsonLexer
- getRuleNames() - Method in class org.jgrapht.nio.json.JsonParser
- getSavedComparisons() - Method in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Get the total number of saved comparisons due to the Barnes-Hut technique.
- getSCCs(int, int) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- getScores() - Method in interface org.jgrapht.alg.interfaces.EdgeScoringAlgorithm
-
Get a map with the scores of all edges
- 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.ApBetweennessCentrality
-
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.EdgeBetweennessCentrality.Algorithm
- getScores() - Method in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- getScores() - Method in class org.jgrapht.alg.scoring.EigenvectorCentrality
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.KatzCentrality
-
Get a map with the scores of all vertices
- getScores() - Method in class org.jgrapht.alg.scoring.PageRank.Algorithm
- 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
- getSecondOperand() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Returns second operand of this operation.
- 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.
- getSep() - Method in class org.jgrapht.io.CSVLexer
- getSep() - Method in class org.jgrapht.nio.csv.CSVLexer
- getSeparator(Graph<V, E>, V, Map<V, Byte>) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Performs iterative depth-first search starting from the
startVertex
in thegraph
. - getSeparators() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the clique minimal separators.
- getSerializedATN() - Method in class org.jgrapht.io.CSVLexer
- getSerializedATN() - Method in class org.jgrapht.io.CSVParser
- getSerializedATN() - Method in class org.jgrapht.io.DOTLexer
- getSerializedATN() - Method in class org.jgrapht.io.DOTParser
- getSerializedATN() - Method in class org.jgrapht.io.GmlLexer
- getSerializedATN() - Method in class org.jgrapht.io.GmlParser
- getSerializedATN() - Method in class org.jgrapht.io.JsonLexer
- getSerializedATN() - Method in class org.jgrapht.io.JsonParser
- getSerializedATN() - Method in class org.jgrapht.nio.csv.CSVLexer
- getSerializedATN() - Method in class org.jgrapht.nio.csv.CSVParser
- getSerializedATN() - Method in class org.jgrapht.nio.dot.DOTLexer
- getSerializedATN() - Method in class org.jgrapht.nio.dot.DOTParser
- getSerializedATN() - Method in class org.jgrapht.nio.gml.GmlLexer
- getSerializedATN() - Method in class org.jgrapht.nio.gml.GmlParser
- getSerializedATN() - Method in class org.jgrapht.nio.json.JsonLexer
- getSerializedATN() - Method in class org.jgrapht.nio.json.JsonParser
- getShortcuts(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes shortcuts for vertex
vertex
wrt the overlay graph. - 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.
- getShortestPathsTree(Graph<V, E>, V, Set<V>) - Static method in class org.jgrapht.alg.shortestpath.BaseManyToManyShortestPaths
-
Computes shortest paths tree starting at
source
and stopping as soon as all of thetargets
are reached. - getShrinkNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getShrinkTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getSidetracks(List<EppsteinShortestPathIterator.PathsGraphVertex>) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
-
Builds sequence of sidetracks in the
graph
this path corresponds to. - getSingletonTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Creates a tour for a graph with 1 vertex
- getSink() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Returns one sink of this problem (a problem is guaranteed to have at least one sink).
- getSinkNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of sinks in the network.
- 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)
- getSinks() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Returns the sink set of this problem.
- getSinks() - Method in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Returns the sink set of this problem.
- getSinks() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns a list containing generated sinks (pure sinks + t-sinks).
- getSinks() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Returns a list containing network sinks (pure sinks + t-sinks).
- getSize() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Get the size of the region.
- getSize() - Method in class org.jgrapht.util.AVLTree
-
Returns the size of this tree
- 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.
- getSkeletonArcs() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Return a list of network skeleton arcs.
- getSolution() - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Calculates a partition representation of the capacitated spanning tree.
- getSortedStack(VertexColoringAlgorithm.Coloring<V>) - Method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Returns a canonically sorted stack of all colors of alpha.
- getSource() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- getSource() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Returns one source of this problem (a problem is guaranteed to have at least one source).
- 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.
- getSourceNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of sources in the network.
- 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.
- getSources() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Returns the source set of this problem.
- getSources() - Method in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Returns the source set of this problem.
- getSources() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns a list containing generated source (pure sources + t-sources).
- getSources() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Returns a list containing network sources (pure sources + t-sources).
- 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.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
- getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- getSourceVertex() - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths.JohnsonSingleSourcePaths
- 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.
- getSpecification() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
-
Returns the
TSPLIBImporter.Specification
instance containing all values from the specification part of a TSPLIB95 file. - 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.
- getSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilFastLookupGSS
- getSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilFastLookupIntVertexGSS
- getSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilGSS
- getSpecificsFactory() - Method in class org.jgrapht.opt.graph.fastutil.FastutilIntVertexGSS
- 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.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
- 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.
- getStatistics(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes statistics for specified
vertex
. - getStronglyConnectedComponents() - Method in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- getStronglyConnectedComponents() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Computes a list of subgraphs of the given graph.
- getSubtreeMax() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a maximum node stored in the subtree rooted at this node
- getSubtreeMin() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a minimum node stored in the subtree rooted at this node
- getSubtreeSize() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a subtree size of the tree rooted at this node
- getSuccessor() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a successor of this node according to the tree in order traversal, or
null
if this node is a maximum node in the tree - getSupplier() - Method in class org.jgrapht.util.LiveIterableWrapper
-
Get the supplier
- getTail() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
Returns the end vertex of the path
- getTarget() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- 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
- getThrowingSupplier(Throwable) - Static method in class org.jgrapht.util.SupplierUtil
- getTokenNames() - Method in class org.jgrapht.io.CSVLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.CSVParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.DOTLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.DOTParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.GmlLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.GmlParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.JsonLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.io.JsonParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.csv.CSVLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.csv.CSVParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.dot.DOTLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.dot.DOTParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.gml.GmlLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.gml.GmlParser
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.json.JsonLexer
-
Deprecated.
- getTokenNames() - Method in class org.jgrapht.nio.json.JsonParser
-
Deprecated.
- 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
- getTotalSupply() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the total supply of the network.
- getTour() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
-
Returns the
List
of vertices in the order of the tour defined in an imported TSPLIB95 file or null if no tour was imported. - 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.
- getTourVertex() - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- getTransitVertices() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Returns transit vertices of this transit node routing.
- getTransitVerticesPaths() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Returns paths between every pair of
transitVertices
. - getTransshipmentNodes() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Returns a list containing network t-nodes.
- getTransshipmentSinks() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Return a list containing network t-sinks.
- getTransshipmentSources() - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Returns a list containing network t-sources.
- getTransshipNodeNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of transshipment nodes in the network.
- getTransshipNodes() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns a list containing generated t-nodes.
- getTransshipSinkNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of transshipment sinks in the network.
- getTransshipSinks() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns a list containing generated transshipment sinks.
- getTransshipSourceNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of transshipment sources in the network.
- getTransshipSources() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Returns a list containing generated transshipment sources.
- getTree(TreeDynamicConnectivity.Node) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Returns a binary tree, which contains an Euler tour of the tree the
node
belong to - getTreeEdge(V) - Method in class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
-
Returns edge which connects
v
to its predecessor in the shortest paths tree of this frontier. - getTreeEdge(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
- getTreeEdge(V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- getTreeGrandparent() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Helper method, returns the tree grandparent of this node
- getTreeMax() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a maximum node stored in the tree
- getTreeMin() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a minimum node stored in the tree
- getTreeParent() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Helper method, returns the tree parent of this node or null if this node has no tree parent
- getTrueDual() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Returns the true dual variable of this node.
- getTrueSlack() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Returns the true slack of this edge, i.e.
- getType() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Returns type of this operation.
- 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.guava.BaseGraphAdapter
- getType() - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- getType() - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- getType() - Method in class org.jgrapht.graph.guava.ElementOrderMethod
-
Get the type
- getType() - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- getType() - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- getType() - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- getType() - Method in class org.jgrapht.graph.MaskSubgraph
-
Get the graph type.
- getType() - Method in interface org.jgrapht.nio.Attribute
-
Get the type of the attribute
- getType() - Method in class org.jgrapht.nio.DefaultAttribute
-
Get the type of the attribute
- getType() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the TYPE keyword in the imported file.
- getType() - Method in class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
- getType() - Method in class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
- getType() - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getType() - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- getType() - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- getType() - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Get the graph type.
- getType() - Method in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph
- getType() - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph
- getType() - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- getType() - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- getType() - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- getType() - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- getU() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Returns the largest magnitude of any supply/demand or finite arc capacity.
- getUnmatched(MatchingAlgorithm.Matching<V, E>, Set<V>, Set<V>) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
- 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
- getUnvisitedNeighbours(V) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator
-
Computes and returns neighbours of
vertex
which haven't been visited by this iterator. - getUnvisitedVertex() - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- 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.nio.Attribute
-
Get the value of the attribute
- getValue() - Method in class org.jgrapht.nio.DefaultAttribute
-
Get the string value of the attribute
- getValue() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a value stored in this node
- getValue() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNode
-
Returns the immutable value this
ListNode
contains. - getValue() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
-
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()
. - getValue(String[]) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getVertex() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- getVertex() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData1
- getVertex() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData2
- getVertex() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex
-
Returns a transit vertex of this access vertex.
- getVertex() - Method in class org.jgrapht.event.GraphVertexChangeEvent
-
Returns the vertex that this event is related to.
- getVertex() - Method in class org.jgrapht.event.VertexTraversalEvent
-
Returns the traversed vertex.
- getVertex(int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
-
be careful: there's no check against an invalid vertexNumber
- getVertex(Integer) - Method in interface org.jgrapht.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
- getVertex(Integer) - Method in class org.jgrapht.nio.gml.GmlImporter.Consumers
- getVertexAttribute(V, String) - Method in class org.jgrapht.nio.BaseExporter
-
Get an optional of a vertex attribute
- getVertexAttributeProvider() - Method in class org.jgrapht.nio.BaseExporter
-
Get the vertex attribute provider
- getVertexAttributes(V) - Method in class org.jgrapht.nio.BaseExporter
-
Get vertex attributes
- getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- getVertexCorrespondence(V, boolean) - Method in class org.jgrapht.graph.DefaultGraphMapping
- getVertexCorrespondence(V, boolean) - Method in interface org.jgrapht.GraphMapping
-
Gets the mapped value where the key is
vertex
- getVertexCount() - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- getVertexCover() - 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
- getVertexData(ContractionHierarchyPrecomputation.ContractionVertex<V>, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Creates an instance of
VertexData
forvertex
using specified random number and sets itspriority
value. - getVertexEccentricityMap() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the eccentricity of each vertex in the graph.
- getVertexExtension(V) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Returns a vertex extension which corresponds to the network
vertex
. - getVertexExtension(V) - Method in class org.jgrapht.alg.flow.DinicMFImpl
- getVertexExtension(V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
- getVertexExtension(V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- getVertexFactory() - Method in class org.jgrapht.nio.csv.CSVImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.dimacs.DIMACSImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.dot.DOTImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.gml.GmlImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Importer
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Get the user custom vertex factory.
- getVertexFactory() - Method in class org.jgrapht.nio.json.JSONImporter
-
Get the user custom vertex factory.
- getVertexId(V) - Method in class org.jgrapht.nio.BaseExporter
-
Get the vertex id
- getVertexID(V) - Method in class org.jgrapht.nio.dot.DOTExporter
-
Return a valid vertex ID (with respect to the .dot language definition as described in http://www.graphviz.org/doc/info/lang.html
- getVertexIdProvider() - Method in class org.jgrapht.nio.BaseExporter
-
Get vertex id provider.
- getVertexInOrder(List<V>) - Method in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Returns a map containing vertices from the
vertexOrder
mapped to their indices invertexOrder
. - getVertexInOrder(List<V>) - Method in class org.jgrapht.alg.color.ChordalGraphColoring
-
Returns a map containing vertices from the
vertexOrder
mapped to their indices invertexOrder
. - getVertexInOrder(List<V>) - Method in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Returns a map containing vertices from the
vertexOrder
mapped to their indices invertexOrder
. - getVertexInOrder(List<V>) - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Returns a map containing vertices from the
vertexOrder
mapped to their indices invertexOrder
. - getVertexLabelAttributeName() - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Get the attribute name for vertex labels
- 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. - getVertexNumber(V) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- 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.
- getVertexPair() - Method in exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
-
Get the vertex pair which caused the error.
- getVertexScore(V) - Method in interface org.jgrapht.alg.interfaces.VertexScoringAlgorithm
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
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.EigenvectorCentrality
-
Get a vertex score
- getVertexScore(V) - Method in class org.jgrapht.alg.scoring.KatzCentrality
-
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.guava.BaseGraphAdapter
- getVertexSupplier() - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- getVertexSupplier() - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- getVertexSupplier() - Method in class org.jgrapht.graph.MaskSubgraph
-
Return the vertex supplier that the graph uses whenever it needs to create new vertices.
- getVertexSupplier() - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- getVertexSupplier() - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- getVertexSupplier() - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- getVertexSupplier() - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- 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.
- getVertexToNodeMapping() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
-
Returns the mapping of vertex to corresponding node imported from the NODE_COORD_SECTION of a TSPLIB95 file.
- getVertexTour(List<Integer>, Map<V, TSPLIBImporter.Node>) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- getVertexWithAttributesFactory() - Method in class org.jgrapht.nio.dot.DOTImporter
-
Get the user custom vertex factory with attributes.
- getVertices() - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- getVerticesCollectionName() - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Get the name used for the vertices collection in the file.
- getVerticesCollectionName() - Method in class org.jgrapht.nio.json.JSONExporter
-
Get the name used for the vertices collection in the file.
- getVerticesCollectionName() - Method in class org.jgrapht.nio.json.JSONImporter
-
Get the name used for the vertices collection in the file.
- 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
. - getVocabulary() - Method in class org.jgrapht.io.CSVLexer
- getVocabulary() - Method in class org.jgrapht.io.CSVParser
- getVocabulary() - Method in class org.jgrapht.io.DOTLexer
- getVocabulary() - Method in class org.jgrapht.io.DOTParser
- getVocabulary() - Method in class org.jgrapht.io.GmlLexer
- getVocabulary() - Method in class org.jgrapht.io.GmlParser
- getVocabulary() - Method in class org.jgrapht.io.JsonLexer
- getVocabulary() - Method in class org.jgrapht.io.JsonParser
- getVocabulary() - Method in class org.jgrapht.nio.csv.CSVLexer
- getVocabulary() - Method in class org.jgrapht.nio.csv.CSVParser
- getVocabulary() - Method in class org.jgrapht.nio.dot.DOTLexer
- getVocabulary() - Method in class org.jgrapht.nio.dot.DOTParser
- getVocabulary() - Method in class org.jgrapht.nio.gml.GmlLexer
- getVocabulary() - Method in class org.jgrapht.nio.gml.GmlParser
- getVocabulary() - Method in class org.jgrapht.nio.json.JsonLexer
- getVocabulary() - Method in class org.jgrapht.nio.json.JsonParser
- getVoronoiCellId(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagram
-
Returns Voronoi cell id which corresponds to
vertex
. - getVoronoiDiagram() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Returns Voronoi diagram of this transit node routing.
- 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.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
- 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(Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- getWeight(Collection<V>) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Returns the weight of a collection of vertices.
- getWeight(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Return the weight of the path from the source vertex to the sink vertex.
- getWeight(V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
- getWeight(V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths.JohnsonSingleSourcePaths
- 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. - getWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
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. - getWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl
-
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. - getWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl
-
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
- GEXFAttributeType - Enum Class in org.jgrapht.nio.gexf
-
Attribute types supported by GEXF.
- GEXFAttributeType(String) - Constructor for enum class org.jgrapht.nio.gexf.GEXFAttributeType
- GEXFExporter<V,
E> - Class in org.jgrapht.nio.gexf -
Exports a graph as GEXF (Graph Exchange XML Format).
- GEXFExporter() - Constructor for class org.jgrapht.nio.gexf.GEXFExporter
-
Constructs a new exporter with integer id providers for the vertices and the edges.
- GEXFExporter(Function<V, String>, Function<E, String>) - Constructor for class org.jgrapht.nio.gexf.GEXFExporter
-
Constructs a new exporter.
- GEXFExporter.AttributeCategory - Enum Class in org.jgrapht.nio.gexf
-
Denotes the category of a GEXF-Attribute.
- GEXFExporter.AttributeDetails - Class in org.jgrapht.nio.gexf
- GEXFExporter.Parameter - Enum Class in org.jgrapht.nio.gexf
-
Parameters that affect the behavior of the exporter.
- GEXFHandler() - Constructor for class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- GirvanNewmanClustering<V,
E> - Class in org.jgrapht.alg.clustering -
The Girvan-Newman clustering algorithm.
- GirvanNewmanClustering(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.clustering.GirvanNewmanClustering
-
Create a new clustering algorithm.
- GirvanNewmanClustering(Graph<V, E>, int, EdgeBetweennessCentrality.OverflowStrategy, Iterable<V>) - Constructor for class org.jgrapht.alg.clustering.GirvanNewmanClustering
-
Create a new clustering algorithm.
- globalClusteringCoefficient - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
- gml() - Method in class org.jgrapht.io.GmlParser
- gml() - Method in class org.jgrapht.nio.gml.GmlParser
- GmlBaseListener - Class in org.jgrapht.io
-
This class provides an empty implementation of
GmlListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - GmlBaseListener - Class in org.jgrapht.nio.gml
-
This class provides an empty implementation of
GmlListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - GmlBaseListener() - Constructor for class org.jgrapht.io.GmlBaseListener
- GmlBaseListener() - Constructor for class org.jgrapht.nio.gml.GmlBaseListener
- GmlContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.GmlParser.GmlContext
- GmlContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.gml.GmlParser.GmlContext
- GmlEventDrivenImporter - Class in org.jgrapht.nio.gml
-
Imports a graph from a GML file (Graph Modeling Language).
- GmlEventDrivenImporter() - Constructor for class org.jgrapht.nio.gml.GmlEventDrivenImporter
-
Constructs a new importer.
- GmlEventDrivenImporter.NotifyGmlListener - Class in org.jgrapht.nio.gml
- GmlEventDrivenImporter.Singleton - Class in org.jgrapht.nio.gml
- GmlEventDrivenImporter.ThrowingErrorListener - Class in org.jgrapht.nio.gml
- GmlExporter<V,
E> - Class in org.jgrapht.nio.gml -
Exports a graph into a GML file (Graph Modeling Language).
- GmlExporter() - Constructor for class org.jgrapht.nio.gml.GmlExporter
-
Creates a new GmlExporter object with integer id providers for the vertex identifiers.
- GmlExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.gml.GmlExporter
-
Constructs a new GmlExporter object with the given id providers.
- GmlExporter.Parameter - Enum Class in org.jgrapht.nio.gml
-
Parameters that affect the behavior of the
GmlExporter
exporter. - GmlImporter<V,
E> - Class in org.jgrapht.nio.gml -
Imports a graph from a GML file (Graph Modeling Language).
- GmlImporter() - Constructor for class org.jgrapht.nio.gml.GmlImporter
-
Constructs a new importer.
- GmlImporter.Consumers - Class in org.jgrapht.nio.gml
- GmlLexer - Class in org.jgrapht.io
- GmlLexer - Class in org.jgrapht.nio.gml
- GmlLexer(CharStream) - Constructor for class org.jgrapht.io.GmlLexer
- GmlLexer(CharStream) - Constructor for class org.jgrapht.nio.gml.GmlLexer
- GmlListener - Interface in org.jgrapht.io
-
This interface defines a complete listener for a parse tree produced by
GmlParser
. - GmlListener - Interface in org.jgrapht.nio.gml
-
This interface defines a complete listener for a parse tree produced by
GmlParser
. - GmlParser - Class in org.jgrapht.io
- GmlParser - Class in org.jgrapht.nio.gml
- GmlParser(TokenStream) - Constructor for class org.jgrapht.io.GmlParser
- GmlParser(TokenStream) - Constructor for class org.jgrapht.nio.gml.GmlParser
- GmlParser.GmlContext - Class in org.jgrapht.io
- GmlParser.GmlContext - Class in org.jgrapht.nio.gml
- GmlParser.KeyValuePairContext - Class in org.jgrapht.io
- GmlParser.KeyValuePairContext - Class in org.jgrapht.nio.gml
- GmlParser.ListKeyValueContext - Class in org.jgrapht.io
- GmlParser.ListKeyValueContext - Class in org.jgrapht.nio.gml
- GmlParser.NumberKeyValueContext - Class in org.jgrapht.io
- GmlParser.NumberKeyValueContext - Class in org.jgrapht.nio.gml
- GmlParser.StringKeyValueContext - Class in org.jgrapht.io
- GmlParser.StringKeyValueContext - Class in org.jgrapht.nio.gml
- 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,
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,
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
- gomoryHuTree - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- gomoryHuTree - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
- gossetGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- graph - Variable in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
The underlying graph
- graph - Variable in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
- graph - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Source graph to operate on
- graph - Variable in class org.jgrapht.alg.clustering.GirvanNewmanClustering
- graph - Variable in class org.jgrapht.alg.clustering.KSpanningTreeClustering
- graph - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering
- graph - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
- graph - Variable in class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
- graph - Variable in class org.jgrapht.alg.color.ChordalGraphColoring
- graph - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm
- graph - Variable in class org.jgrapht.alg.color.GreedyColoring
-
The input graph
- graph - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring
- graph - Variable in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- graph - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- graph - Variable in class org.jgrapht.alg.connectivity.BlockCutpointGraph
- graph - Variable in class org.jgrapht.alg.connectivity.ConnectivityInspector
- graph - Variable in class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
- graph - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
the input graph
- graph - Variable in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
The graph in which minimal vertex separators to searched in
- graph - Variable in class org.jgrapht.alg.cycle.ChordalityInspector
-
The inspected graph.
- graph - Variable in class org.jgrapht.alg.cycle.CycleDetector
-
Graph on which cycle detection is being performed.
- graph - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- graph - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
The underlying graph.
- graph - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- graph - Variable in class org.jgrapht.alg.cycle.PatonCycleBase
- graph - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- graph - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- graph - Variable in class org.jgrapht.alg.cycle.TiernanSimpleCycles
- graph - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
The inspected graph
- graph - Variable in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
- graph - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- graph - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- graph - Variable in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
- graph - Variable in class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
- graph - Variable in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
- graph - Variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- graph - Variable in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
The underlying
graph
- graph - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- graph - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- graph - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- graph - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- graph - Variable in class org.jgrapht.alg.lca.NaiveLCAFinder
- graph - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- graph - Variable in class org.jgrapht.alg.linkprediction.AdamicAdarIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.CommonNeighborsLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.HubDepressedIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.HubPromotedIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.JaccardCoefficientLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.LeichtHolmeNewmanIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.PreferentialAttachmentLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.ResourceAllocationIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.SaltonIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.linkprediction.SørensenIndexLinkPrediction
- graph - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
The graph for which to find a matching
- graph - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
The graph for which to find a matching
- graph - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
The graph created during the reduction
- graph - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
-
The graph on which both primal and dual linear programs are formulated
- graph - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
The graph we are matching on
- graph - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- graph - Variable in class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching
- graph - Variable in class org.jgrapht.alg.matching.GreedyWeightedMatching
- graph - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- graph - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
- graph - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- graph - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
- graph - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- graph - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
- graph - Variable in class org.jgrapht.alg.partition.BipartitePartitioning
- graph - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The graph we're testing planarity of
- graph - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Underlying graph
- graph - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality
-
Underlying graph
- graph - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Underlying graph
- graph - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Underlying graph
- graph - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- graph - Variable in class org.jgrapht.alg.scoring.PageRank
-
The input graph
- graph - Variable in class org.jgrapht.alg.shortestpath.AllDirectedPaths
- graph - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
- graph - Variable in class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier
-
Frontier`s graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.BaseManyToManyShortestPaths
- graph - Variable in class org.jgrapht.alg.shortestpath.BaseMultiObjectiveShortestPathAlgorithm
-
The underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
The underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl
-
The underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
The underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
The underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- graph - Variable in class org.jgrapht.alg.shortestpath.EppsteinKShortestPath
-
Underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
-
The graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.GraphMeasurer
- 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.shortestpath.TreeMeasurer
- graph - Variable in class org.jgrapht.alg.shortestpath.YenKShortestPath
-
Underlying graph.
- graph - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Underlying graph.
- graph - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the input graph.
- graph - Variable in class org.jgrapht.alg.spanning.BoruvkaMinimumSpanningTree
- graph - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
- graph - Variable in class org.jgrapht.alg.spanning.KruskalMinimumSpanningTree
- graph - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- graph - Variable in class org.jgrapht.alg.transform.LineGraphConverter
- graph - Variable in class org.jgrapht.alg.util.NeighborCache
- graph - Variable in class org.jgrapht.alg.util.VertexDegreeComparator
-
The graph that contains the vertices to be compared.
- graph - Variable in class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
- graph - Variable in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
- graph - Variable in class org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl
- graph - Variable in class org.jgrapht.alg.vertexcover.GreedyVCImpl
- graph - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Input graph
- graph - Variable in class org.jgrapht.generate.ComplementGraphGenerator
- graph - Variable in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
- graph - Variable in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
- graph - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
A network that is being generated.
- graph - Variable in class org.jgrapht.graph.builder.AbstractGraphBuilder
- graph - Variable in class org.jgrapht.graph.DefaultGraphIterables
-
The underlying graph
- graph - Variable in class org.jgrapht.graph.GraphWalk
- graph - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- graph - Variable in class org.jgrapht.graph.MaskEdgeSet
- graph - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
- graph - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
- graph - Variable in class org.jgrapht.nio.csv.CSVImporter.Consumers
- graph - Variable in class org.jgrapht.nio.dimacs.DIMACSImporter.Consumers
- graph - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- graph - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- graph - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- graph - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Importer.Consumers
- graph - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- graph - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- graph - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- graph - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- graph - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- graph - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- graph - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- graph - Variable in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- graph - Variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- graph - Variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- graph - Variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- graph - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- graph - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- graph() - Method in class org.jgrapht.io.DOTParser
- graph() - Method in class org.jgrapht.nio.dot.DOTParser
- Graph<V,
E> - Interface in org.jgrapht -
The root interface in the graph hierarchy.
- GRAPH - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- GRAPH - Static variable in class org.jgrapht.io.DOTLexer
- GRAPH - Static variable in class org.jgrapht.io.DOTParser
- GRAPH - Static variable in class org.jgrapht.nio.dot.DOTLexer
- GRAPH - Static variable in class org.jgrapht.nio.dot.DOTParser
- GRAPH - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- GRAPH - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- GRAPH - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- GRAPH - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- GRAPH - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- GRAPH() - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- GRAPH() - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- GRAPH() - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- GRAPH() - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- GRAPH_ATTRS - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- GRAPH_CANNOT_BE_NULL - Static variable in class org.jgrapht.GraphTests
- GRAPH_CONTAINS_A_NEGATIVE_WEIGHT_CYCLE - Static variable in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Error message for reporting the existence of a negative-weight cycle.
- GRAPH_EDGE_DEFAULT - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- GRAPH_ID - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- GRAPH_ID - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- GRAPH_IS_IMMUTABLE - Static variable in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- GRAPH_IS_IMMUTABLE - Static variable in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- GRAPH_IS_IMMUTABLE - Static variable in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- GRAPH_IS_NOT_A_DAG - Static variable in exception class org.jgrapht.traverse.NotDirectedAcyclicGraphException
- GRAPH_IS_UNWEIGHTED - Static variable in class org.jgrapht.graph.guava.MutableNetworkAdapter
- GRAPH_MUST_BE_DIRECTED - Static variable in class org.jgrapht.GraphTests
- GRAPH_MUST_BE_DIRECTED_OR_UNDIRECTED - Static variable in class org.jgrapht.GraphTests
- GRAPH_MUST_BE_UNDIRECTED - Static variable in class org.jgrapht.GraphTests
- GRAPH_MUST_BE_WEIGHTED - Static variable in class org.jgrapht.GraphTests
- GRAPH_MUST_CONTAIN_THE_SINK_VERTEX - Static variable in class org.jgrapht.alg.shortestpath.BaseMultiObjectiveShortestPathAlgorithm
-
Error message for reporting that a sink vertex is missing.
- GRAPH_MUST_CONTAIN_THE_SINK_VERTEX - Static variable in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Error message for reporting that a sink vertex is missing.
- GRAPH_MUST_CONTAIN_THE_SOURCE_VERTEX - Static variable in class org.jgrapht.alg.shortestpath.BaseMultiObjectiveShortestPathAlgorithm
-
Error message for reporting that a source vertex is missing.
- GRAPH_MUST_CONTAIN_THE_SOURCE_VERTEX - Static variable in class org.jgrapht.alg.shortestpath.BaseShortestPathAlgorithm
-
Error message for reporting that a source vertex is missing.
- GRAPH_SPECIFICS_MUST_NOT_BE_NULL - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- GRAPH_SPECIFICS_STRATEGY_REQUIRED - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- GRAPH_STRING_SEEMS_TO_BE_CORRUPT_INVALID_NUMBER_OF_VERTICES - Static variable in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter
- graph1 - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
The input graphs
- graph1 - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- graph1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- graph1 - Variable in class org.jgrapht.graph.DefaultGraphMapping
- graph2 - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
The input graphs
- graph2 - Variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- graph2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- graph2 - Variable in class org.jgrapht.graph.DefaultGraphMapping
- GRAPH6 - Enum constant in enum class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Format
- GRAPH6 - Enum constant in enum class org.jgrapht.nio.graph6.Graph6Sparse6Exporter.Format
- Graph6Sparse6EventDrivenImporter - Class in org.jgrapht.nio.graph6
-
Importer which reads graphs in graph6 or sparse6 format.
- Graph6Sparse6EventDrivenImporter() - Constructor for class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter
-
Construct a new importer
- Graph6Sparse6EventDrivenImporter.Format - Enum Class in org.jgrapht.nio.graph6
- Graph6Sparse6EventDrivenImporter.Parser - Class in org.jgrapht.nio.graph6
-
The actual parser.
- Graph6Sparse6Exporter<V,
E> - Class in org.jgrapht.nio.graph6 -
Exporter which exports graphs in graph6 or sparse6 format.
- Graph6Sparse6Exporter() - Constructor for class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
-
Constructs a new exporter with a given vertex ID provider.
- Graph6Sparse6Exporter(Graph6Sparse6Exporter.Format) - Constructor for class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
-
Constructs a new exporter with a given vertex ID provider.
- Graph6Sparse6Exporter.Format - Enum Class in org.jgrapht.nio.graph6
-
Format type: graph6 (g6) or sparse6(s6)
- Graph6Sparse6Importer<V,
E> - Class in org.jgrapht.nio.graph6 -
Importer which reads graphs in graph6 or sparse6 format.
- Graph6Sparse6Importer() - Constructor for class org.jgrapht.nio.graph6.Graph6Sparse6Importer
-
Construct a new importer
- Graph6Sparse6Importer.Consumers - Class in org.jgrapht.nio.graph6
- graphAttributeConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- graphAttributeConsumer - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- graphAttributeConsumer - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- graphAttributeConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- graphAttributeConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- graphAttributeProvider - Variable in class org.jgrapht.nio.BaseExporter
-
A graph attribute provider
- graphAttrs - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- GraphBuilder<V,
E, - Class in org.jgrapht.graph.builderG> -
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.
- GraphContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.GraphContext
- GraphContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.GraphContext
- GraphCycleProhibitedException - Exception Class in org.jgrapht.graph
-
Exception indicating that the vertexes supplied to
DirectedAcyclicGraph
would cause a cycle. - GraphCycleProhibitedException() - Constructor for exception class org.jgrapht.graph.GraphCycleProhibitedException
- 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
- graphEdge - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
The counterpart of this edge in the
graph
. - 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.
- graphEdges - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
List of edges of the flow network.
- graphEdges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Generic edges of the
graph
in the same order as internal edges in the arrayedges
. - graphEdges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Initial edges of the graph
- GraphElement(String) - Constructor for class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphElement
- GraphElement(String, String) - Constructor for class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphElement
- GraphExporter<V,
E> - Interface in org.jgrapht.nio -
Interface for graph exporters
- GraphGenerator<V,
E, - Interface in org.jgrapht.generateT> -
An interface for generating new graph structures.
- graphHeader() - Method in class org.jgrapht.io.DOTParser.GraphContext
- graphHeader() - Method in class org.jgrapht.io.DOTParser
- graphHeader() - Method in class org.jgrapht.nio.dot.DOTParser.GraphContext
- graphHeader() - Method in class org.jgrapht.nio.dot.DOTParser
- GraphHeaderContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.GraphHeaderContext
- GraphHeaderContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- graphIdentifier() - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- graphIdentifier() - Method in class org.jgrapht.io.DOTParser
- graphIdentifier() - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- graphIdentifier() - Method in class org.jgrapht.nio.dot.DOTParser
- GraphIdentifierContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.GraphIdentifierContext
- GraphIdentifierContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.GraphIdentifierContext
- graphIdProvider - Variable in class org.jgrapht.nio.BaseExporter
-
A graph id provider
- GraphImporter<V,
E> - Interface in org.jgrapht.nio -
Interface for graph importers
- graphIterables - Variable in class org.jgrapht.graph.AbstractBaseGraph
- GraphIterables<V,
E> - Interface in org.jgrapht -
Presents a graph as a collection of views suitable for graphs which contain a very large number of vertices or edges.
- GraphIterator<V,
E> - Interface in org.jgrapht.traverse -
A graph iterator.
- GraphListener<V,
E> - Interface in org.jgrapht.event -
A listener that is notified when the graph changes.
- graphListeners - Variable in class org.jgrapht.graph.DefaultListenableGraph
- GraphMapping<V,
E> - Interface in org.jgrapht -
GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or edge in either direction, from graph1 to graph2, or from graph2 to graph1.
- graphMappingForward - Variable in class org.jgrapht.graph.DefaultGraphMapping
- graphMappingReverse - Variable in class org.jgrapht.graph.DefaultGraphMapping
- 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
- GRAPHML_SCHEMA_FILENAME - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- GRAPHML_SCHEMA_FILENAME - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
- GraphMLEventDrivenImporter - Class in org.jgrapht.nio.graphml
-
Imports a graph from a GraphML data source.
- GraphMLEventDrivenImporter() - Constructor for class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
-
Constructs a new importer.
- GraphMLEventDrivenImporter.Data - Class in org.jgrapht.nio.graphml
- GraphMLEventDrivenImporter.GraphElement - Class in org.jgrapht.nio.graphml
- GraphMLEventDrivenImporter.GraphMLHandler - Class in org.jgrapht.nio.graphml
- GraphMLEventDrivenImporter.Key - Class in org.jgrapht.nio.graphml
- GraphMLEventDrivenImporter.KeyTarget - Enum Class in org.jgrapht.nio.graphml
- GraphMLExporter<V,
E> - Class in org.jgrapht.nio.graphml -
Exports a graph as GraphML.
- GraphMLExporter() - Constructor for class org.jgrapht.nio.graphml.GraphMLExporter
-
Constructs a new GraphMLExporter with integer id provider for the vertices.
- GraphMLExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.graphml.GraphMLExporter
-
Constructs a new GraphMLExporter.
- GraphMLExporter.AttributeCategory - Enum Class in org.jgrapht.nio.graphml
-
Denotes the category of a GraphML-Attribute.
- GraphMLExporter.AttributeDetails - Class in org.jgrapht.nio.graphml
- GraphMLHandler() - Constructor for class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- GraphMLHandler() - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- GraphMLImporter<V,
E> - Class in org.jgrapht.nio.graphml -
Imports a graph from a GraphML data source.
- GraphMLImporter() - Constructor for class org.jgrapht.nio.graphml.GraphMLImporter
-
Constructs a new importer.
- GraphMLImporter.Consumers - Class in org.jgrapht.nio.graphml
- GraphOrdering<V,
E> - Class in org.jgrapht.alg.isomorphism -
This class represents the order on the graph vertices.
- GraphOrdering(Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.GraphOrdering
- GraphOrdering(Graph<V, E>, boolean, boolean) - Constructor for class org.jgrapht.alg.isomorphism.GraphOrdering
- GraphPath<V,
E> - Interface in org.jgrapht - graphPaths - Variable in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
- Graphs - Class in org.jgrapht
-
A collection of utilities to assist with graph manipulation.
- Graphs() - Constructor for class org.jgrapht.Graphs
- graphSpecificsStrategy - Variable in class org.jgrapht.graph.AbstractBaseGraph
- 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 - Variable in class org.jgrapht.nio.csv.CSVImporter.Consumers
- graphType - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- graphType - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- 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. - GraphTypeBuilder(boolean, boolean) - Constructor for class org.jgrapht.graph.builder.GraphTypeBuilder
- graphValidKeys - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- graphVertex - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The counterpart of this node in the
graph
. - graphVertex - Variable in class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
Graph vertex counterpart of this node.
- 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.
- graphVertexMapping - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Mapping for converting graph vertices to their internal representation as nodes.
- graphVertices - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
List of vertices of the flow network.
- graphVertices - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Generic vertices of the
graph
in the same order as internal nodes in the arraynodes
. - graphVertices - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Initial generic vertices of the graph
- 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 - Enum constant in enum class org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has been returned via iterator, but we're not done with all of its out-edges yet.
- GREEDY - Enum constant in enum class 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
- greedyInitialization(BlossomVOptions) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Performs greedy initialization of the algorithm.
- 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.
- GreedyMaximumCardinalityMatching.EdgeDegreeComparator - Class in org.jgrapht.alg.matching
- 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.
- GreedyMultiplicativeSpanner.SpannerAlgorithmBase - Class in org.jgrapht.alg.spanning
- GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm - Class in org.jgrapht.alg.spanning
- GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm - Class in org.jgrapht.alg.spanning
- GreedyVCImpl<V,
E> - Class in org.jgrapht.alg.vertexcover -
Greedy algorithm to find a vertex cover for a graph.
- GreedyVCImpl(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
-
Generates a Grötzsch Graph.
- grow() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Performs an algorithm grow phase.
- grow(BlossomVEdge, boolean, boolean) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Performs grow operation.
- growNum - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Number of grow operations
- growTime - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Time spent during the grow operation in nanoseconds
- gScoreMap - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- gScoreMap - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
-
Tentative distance to the vertices in tha graph computed so far.
- GUAVA_COMPARATOR - Enum constant in enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
-
Use the Guava node order comparator.
- guavaComparator() - Static method in class org.jgrapht.graph.guava.ElementOrderMethod
-
Get the guava comparator ordering method.
- 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.
- gusfieldGomoryHuCutTreeAlgorithm - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
H
- hadOneMapping - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- 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.
- handle - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Reference to the
invalid reference
FibonacciHeapNode
- handle - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
A heap node from the heap this edge is stored in.
- handle - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Node from the heap this node is stored in
- handleInfinityEdgeInit(AddressableHeap<Double, BlossomVEdge>, BlossomVEdge, int, double, double) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Handles encountered infinity edges incident to "+" nodes of the alternating tree.
- handleRow() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.AdjacencyListCSVListener
- handleRow() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- handleRow() - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- 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.
- hasANeighbour(Graph<V, E>, Set<V>, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Reports whether v has at least one neighbour in set
- hasANonneighbourInX(Graph<V, E>, V, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Reports whether a vertex has at least one nonneighbour in X
- hasBackEdgeWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Checks whether this node has a back edge to the
node
. - hasCapacity() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- hasConfigurationType1(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a graph has a configuration of type T1.
- hasConfigurationType2(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a graph is of configuration type T2.
- hasConfigurationType3(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a graph is of configuration type T3.
- hasConnectionToTerminal(BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Checks if the
vertex
is connected to a terminal vertex (source or sink). - hasDistinctLocations - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- hasDistinctNeighborDistances - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- hasDistinctNeighborDistances() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
-
Returns true if for the imported graph each vertex all touching edges have different weights.
- hasDistinctNodeLocations() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
-
Returns true if for the imported graph all vertices have distinct coordinates and non of them have
equal
coordinate values
, else false. - hasEdge(int, int) - Method in class org.jgrapht.alg.isomorphism.GraphOrdering
- hasEdgeCorrespondence(E) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Checks if a edge e from the first graph has a corresponding edge in the second graph
- hasElement(E) - Method in class org.jgrapht.alg.util.Pair
-
Assess if this pair contains an element.
- hasElement(E) - Method in class org.jgrapht.alg.util.Triple
-
Assess if this triple contains an element.
- hasExcess() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- hash(int) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- hashCode() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey
- 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.ColorRefinementIsomorphismInspector.DistinctGraphObject
- 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.similarity.ZhangShashaTreeEditDistance.EditOperation
- 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.CopyOnDemandSet
-
Return the backing set's hashcode.
- 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.nio.DefaultAttribute
- 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
- hasLimit - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- 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.isomorphism.VF2MappingIterator
- hasNext() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
- hasNext() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
- hasNext() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
- hasNext() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
- hasNext() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
- hasNext() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- hasNext() - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
- hasNext() - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
- hasNext() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- hasNext() - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix.NonZerosIterator
- hasNext() - Method in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- hasNext() - Method in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- hasNext() - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- hasNext() - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- 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.RandomWalkVertexIterator
- hasNext() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
- hasNext() - Method in class org.jgrapht.util.AVLTree.TreeNodeIterator
- hasNext() - Method in class org.jgrapht.util.AVLTree.TreeValuesIterator
- hasNext() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- hasNext() - Method in class org.jgrapht.util.ElementsSequenceGenerator
- hasNext() - Method in class org.jgrapht.util.PrefetchIterator
- hasNext() - Method in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- hasOreProperty(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Tests whether an undirected graph meets Ore's condition to be Hamiltonian.
- hasPoints() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Check if the node contains any points.
- hasPrevious() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- hasRootNeighbor() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Checks whether this node has a neighbor, which is a root of a biconnected component
- 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.
- head - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey
-
the head of the paths indexed by this key
- head - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
The head (target) of this arc.
- head - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
A two-element array of current endpoints of this edge.
- head - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Two-element array of trees this edge is incident to.
- head - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList
-
Bucket with the vertices that have lexicographically largest label.
- head - Variable in class org.jgrapht.util.DoublyLinkedList
-
The first element of the list,
null
if this list is empty. - header - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- header() - Method in class org.jgrapht.io.CSVParser.FileContext
- header() - Method in class org.jgrapht.io.CSVParser
- header() - Method in class org.jgrapht.nio.csv.CSVParser.FileContext
- header() - Method in class org.jgrapht.nio.csv.CSVParser
- HEADER - Static variable in class org.jgrapht.nio.dimacs.DIMACSExporter
- HeaderContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.CSVParser.HeaderContext
- HeaderContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.csv.CSVParser.HeaderContext
- headOriginal - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
A two-element array of original endpoints of this edge.
- heap - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- heap - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- heap - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- heap - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- heap - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath
- heap - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
Priority queue which stores vertices ordered by theirs distances to the corresponding Voronoi cell center.
- heap - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
- heap - Variable in class org.jgrapht.traverse.ClosestFirstIterator
-
Priority queue of fringe vertices.
- Heap(int, Comparator<V>) - Constructor for class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- HeapHandle(V) - Constructor for class org.jgrapht.alg.color.SaturationDegreeColoring.HeapHandle
- heapify(List<EppsteinShortestPathIterator.PathsGraphVertex>, int) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Builds a min-heap out of the
vertices
list - heapSupplier - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Supplier for preferable heap implementation.
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
- heapSupplier - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Supplier for the preferable heap implementation.
- heavyEdges - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- 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.
- heavyRelaxTask - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Task for light edges relaxation.
- HeavyRelaxTask(Queue<V>) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.HeavyRelaxTask
-
Constructs instance of a new task.
- heawoodGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- height - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- height - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The height of the node in the created dfs tree.
- height - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Height of the node
- 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
- herschelGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- heuristic - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
-
Heuristic used in this frontier.
- heuristic - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ReversedGraphHeuristic
- 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
- highest(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Returns the highest of the two input node, i.e.
- hMapping - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
For each vertex $v$ in
graph
maintains the root of the balanced heap, which corresponds to it. - hoffmanGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- hole - Variable in class org.jgrapht.alg.cycle.ChordalityInspector
-
A hole contained in the inspected
graph
. - 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.
- hops - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- HowardMinimumMeanCycle<V,
E> - Class in org.jgrapht.alg.cycle -
Implementation of Howard`s algorithm for finding minimum cycle mean in a graph.
- HowardMinimumMeanCycle(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Constructs an instance of the algorithm for the given
graph
. - HowardMinimumMeanCycle(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Constructs an instance of the algorithm for the given
graph
andmaximumIterations
. - HowardMinimumMeanCycle(Graph<V, E>, int, StrongConnectivityAlgorithm<V, E>, double) - Constructor for class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Constructs an instance of the algorithm for the given
graph
,maximumIterations
,strongConnectivityAlgorithm
andtoleranceEpsilon
. - HTML - Enum constant in enum class org.jgrapht.nio.AttributeType
- HTML - Static variable in class org.jgrapht.nio.dot.DOTUtils
- HtmlString - Static variable in class org.jgrapht.io.DOTLexer
- HtmlString - Static variable in class org.jgrapht.io.DOTParser
- HtmlString - Static variable in class org.jgrapht.nio.dot.DOTLexer
- HtmlString - Static variable in class org.jgrapht.nio.dot.DOTParser
- HtmlString() - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- HtmlString() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- HUB_VERTEX - Static variable in class org.jgrapht.generate.WheelGraphGenerator
-
Role for the hub vertex.
- HubDepressedIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Hub Depressed Index.
- HubDepressedIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.HubDepressedIndexLinkPrediction
-
Create a new prediction
- HubPromotedIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Hub Promoted Index.
- HubPromotedIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.HubPromotedIndexLinkPrediction
-
Create a new prediction
- 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
- i - Variable in class org.jgrapht.alg.util.FixedSizeIntegerQueue
- i - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- i - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- i - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- id - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Variable for debug purposes
- id - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- id - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Variable for debug purposes
- id - Variable in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree.VertexInfo
- id - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
unique id, used to guarantee that compareTo never returns 0
- id - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.Attribute
- id - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- id - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.Key
- Id - Static variable in class org.jgrapht.io.DOTLexer
- Id - Static variable in class org.jgrapht.io.DOTParser
- Id - Static variable in class org.jgrapht.nio.dot.DOTLexer
- Id - Static variable in class org.jgrapht.nio.dot.DOTParser
- Id() - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- Id() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- ID - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Deprecated, for removal: This API element is subject to removal in a future version.use
RatioVertex.id
instead - ID - Static variable in class org.jgrapht.io.GmlLexer
- ID - Static variable in class org.jgrapht.io.GmlParser
- ID - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- ID - Static variable in class org.jgrapht.nio.gml.GmlLexer
- ID - Static variable in class org.jgrapht.nio.gml.GmlParser
- ID - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- ID() - Method in class org.jgrapht.io.GmlParser.ListKeyValueContext
- ID() - Method in class org.jgrapht.io.GmlParser.NumberKeyValueContext
- ID() - Method in class org.jgrapht.io.GmlParser.StringKeyValueContext
- ID() - Method in class org.jgrapht.nio.gml.GmlParser.ListKeyValueContext
- ID() - Method in class org.jgrapht.nio.gml.GmlParser.NumberKeyValueContext
- ID() - Method in class org.jgrapht.nio.gml.GmlParser.StringKeyValueContext
- id1 - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphElement
- id2 - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphElement
- identifier() - Method in class org.jgrapht.io.DOTParser.GraphIdentifierContext
- identifier() - Method in class org.jgrapht.io.DOTParser
- identifier() - Method in class org.jgrapht.io.DOTParser.IdentifierPairContext
- identifier() - Method in class org.jgrapht.io.DOTParser.NodeIdentifierContext
- identifier() - Method in class org.jgrapht.io.DOTParser.PortContext
- identifier() - Method in class org.jgrapht.io.DOTParser.SubgraphStatementContext
- identifier() - Method in class org.jgrapht.nio.dot.DOTParser.GraphIdentifierContext
- identifier() - Method in class org.jgrapht.nio.dot.DOTParser
- identifier() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairContext
- identifier() - Method in class org.jgrapht.nio.dot.DOTParser.NodeIdentifierContext
- identifier() - Method in class org.jgrapht.nio.dot.DOTParser.PortContext
- identifier() - Method in class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- identifier(int) - Method in class org.jgrapht.io.DOTParser.IdentifierPairContext
- identifier(int) - Method in class org.jgrapht.io.DOTParser.PortContext
- identifier(int) - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairContext
- identifier(int) - Method in class org.jgrapht.nio.dot.DOTParser.PortContext
- IDENTIFIER - Enum constant in enum class org.jgrapht.nio.AttributeType
- IdentifierContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.IdentifierContext
- IdentifierContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- IdentifierMap(int) - Constructor for class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- identifierPair() - Method in class org.jgrapht.io.DOTParser.AListContext
- identifierPair() - Method in class org.jgrapht.io.DOTParser
- identifierPair() - Method in class org.jgrapht.io.DOTParser.IdentifierPairStatementContext
- identifierPair() - Method in class org.jgrapht.nio.dot.DOTParser.AListContext
- identifierPair() - Method in class org.jgrapht.nio.dot.DOTParser
- identifierPair() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierPairStatementContext
- identifierPair(int) - Method in class org.jgrapht.io.DOTParser.AListContext
- identifierPair(int) - Method in class org.jgrapht.nio.dot.DOTParser.AListContext
- IdentifierPairContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.IdentifierPairContext
- IdentifierPairContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.IdentifierPairContext
- identifierPairStatement() - Method in class org.jgrapht.io.DOTParser
- identifierPairStatement() - Method in class org.jgrapht.io.DOTParser.StatementContext
- identifierPairStatement() - Method in class org.jgrapht.nio.dot.DOTParser
- identifierPairStatement() - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- IdentifierPairStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.IdentifierPairStatementContext
- IdentifierPairStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.IdentifierPairStatementContext
- identity(Graph<V, E>) - Static method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Computes an identity automorphism (i.e.
- idMap - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- idMap - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- idMap - Variable in class org.jgrapht.nio.IntegerIdProvider
- ids - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- IGNORE_OVERFLOW - Enum constant in enum class org.jgrapht.alg.scoring.BetweennessCentrality.OverflowStrategy
-
Do not check for overflow in counters.
- IGNORE_OVERFLOW - Enum constant in enum class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.OverflowStrategy
-
Do not check for overflow in counters.
- ImmutableDirectedBigGraphAdapter - Class in org.jgrapht.webgraph
-
An adapter class for directed graphs using WebGraph (big)'s
ImmutableGraph
. - ImmutableDirectedBigGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
-
Creates an adapter for a directed big immutable graph implementing only methods based on outgoing edges.
- ImmutableDirectedBigGraphAdapter(ImmutableGraph, ImmutableGraph) - Constructor for class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
-
Creates an adapter for a directed big immutable graph.
- ImmutableDirectedGraphAdapter - Class in org.jgrapht.webgraph
-
An adapter class for directed graphs using WebGraph's
ImmutableGraph
. - ImmutableDirectedGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
-
Creates an adapter for a directed immutable graph implementing only methods based on outgoing edges.
- ImmutableDirectedGraphAdapter(ImmutableGraph, ImmutableGraph) - Constructor for class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
-
Creates an adapter for a directed immutable graph.
- ImmutableDoubleValueGraphAdapter<V> - Class in org.jgrapht.graph.guava
-
A graph adapter class using Guava's
ImmutableValueGraph
specialized with double values. - ImmutableDoubleValueGraphAdapter(ImmutableValueGraph<V, Double>) - Constructor for class org.jgrapht.graph.guava.ImmutableDoubleValueGraphAdapter
-
Create a new adapter.
- immutableGraph - Variable in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
-
The underlying graph.
- immutableGraph - Variable in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
-
The underlying graph.
- ImmutableGraphAdapter<V> - Class in org.jgrapht.graph.guava
-
A graph adapter class using Guava's
ImmutableGraph
. - ImmutableGraphAdapter(ImmutableGraph<V>) - Constructor for class org.jgrapht.graph.guava.ImmutableGraphAdapter
-
Create a new adapter.
- ImmutableNetworkAdapter<V,
E> - Class in org.jgrapht.graph.guava -
A graph adapter class using Guava's
ImmutableNetwork
. - ImmutableNetworkAdapter(ImmutableNetwork<V, E>) - Constructor for class org.jgrapht.graph.guava.ImmutableNetworkAdapter
-
Create a new network adapter.
- immutableTranspose - Variable in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- immutableTranspose - Variable in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
-
The transpose of
AbstractImmutableGraphAdapter.immutableGraph
, for a directed graph with full support;null
, for a directed graph with access to outgoing edges, only. - ImmutableUndirectedBigGraphAdapter - Class in org.jgrapht.webgraph
-
An adapter class for undirected graphs using WebGraph (big)'s
ImmutableGraph
. - ImmutableUndirectedBigGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
-
Creates an adapter for an undirected (i.e., symmetric) big immutable graph.
- ImmutableUndirectedGraphAdapter - Class in org.jgrapht.webgraph
-
An adapter class for undirected graphs using WebGraph's
ImmutableGraph
. - ImmutableUndirectedGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
-
Creates an adapter for an undirected (i.e., symmetric) immutable graph.
- ImmutableValueGraphAdapter<V,
W> - Class in org.jgrapht.graph.guava -
A graph adapter class using Guava's
ImmutableValueGraph
. - ImmutableValueGraphAdapter(ImmutableValueGraph<V, W>, ToDoubleFunction<W>) - Constructor for class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
-
Create a new adapter.
- Implementation(Graph<V, E>, Random, int) - Constructor for class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Initialize the computation
- ImportEvent - Enum Class in org.jgrapht.nio
-
Special events which may happen during import.
- ImportEvent() - Constructor for enum class org.jgrapht.nio.ImportEvent
- importEventConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- ImportException - Exception Class in org.jgrapht.nio
-
An exception that the library throws in case of graph import errors.
- ImportException() - Constructor for exception class org.jgrapht.nio.ImportException
-
Constructs an
ImportException
withnull
as its error detail message. - ImportException(String) - Constructor for exception class org.jgrapht.nio.ImportException
-
Constructs an
ImportException
with the specified detail message. - ImportException(String, Throwable) - Constructor for exception class org.jgrapht.nio.ImportException
-
Constructs an
ImportException
with the specified detail message and cause. - ImportException(Throwable) - Constructor for exception class org.jgrapht.nio.ImportException
-
Constructs an
ImportException
with the specified cause and a detail message of(cause==null ? null : cause.toString())
(which typically contains the class and detail message ofcause
). - importGraph(Graph<V, E>, File) - Method in interface org.jgrapht.nio.GraphImporter
-
Import a graph from the given
File
. - importGraph(Graph<V, E>, InputStream) - Method in interface org.jgrapht.nio.GraphImporter
-
Import a graph from the given
InputStream
. - importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.csv.CSVImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.dimacs.DIMACSImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.dot.DOTImporter
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.gml.GmlImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Importer
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in interface org.jgrapht.nio.GraphImporter
-
Import a graph using the given
Reader
. - importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.json.JSONImporter
-
Import a graph.
- importGraph(Graph<V, E>, Reader) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Import a graph using the given
Reader
. - importInput(File) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Import a graph
- importInput(InputStream) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Import a graph
- importInput(Reader) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter
- importInput(Reader) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Import a graph
- importInput(Reader) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
- importInput(Reader) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
- importInput(Reader) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter
- importTour(TSPLIBImporter.Metadata<V, E>, Reader) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- improve(int[]) - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Improve the tour using the 2-opt heuristic.
- improvementGraph - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
the improvement graph itself
- ImprovementGraph(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Constructs an new improvement graph object for this CMST algorithm instance.
- improvementGraphVertexMapping - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
mapping from the vertex index in the improvement graph to the vertex in the base graph
- ImprovementGraphVertexType() - Constructor for enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
- 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.
- IN - Enum constant in enum class org.jgrapht.generate.DirectedScaleFreeGraphGenerator.Direction
- in1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- in2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- inBiggerSet - Variable in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- incidenceMatrix - Variable in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- IncidenceMatrixSparseUndirectedSpecifics - Class in org.jgrapht.opt.graph.sparse.specifics
-
Specifics for a sparse undirected graph using an incidence matrix representation.
- IncidenceMatrixSparseUndirectedSpecifics(int, int, Supplier<Stream<Pair<Integer, Integer>>>) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
-
Create a new graph from an edge stream
- IncidentEdgeIterator() - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
-
Constructs a new instance of the IncidentEdgeIterator.
- incidentEdgesIterator() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Returns an iterator over all incident edges of this node
- incoming - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Whether to use incoming or outgoing paths
- incoming - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
- incomingEdges - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- incomingEdgesMap - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheAccess
- incomingEdgesOf(int, boolean) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- incomingEdgesOf(int, boolean) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- incomingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- incomingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- incomingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
- incomingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- incomingEdgesOf(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- incomingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- incomingEdgesOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- incomingEdgesOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- incomingEdgesOf(Long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- incomingEdgesOf(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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.CacheAccess
-
Get a set of all edges in AsSynchronizedGraph's backing graph incoming into the specified vertex.
- incomingEdgesOf(V) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Get a set of all edges in AsSynchronizedGraph's backing graph 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.concurrent.AsSynchronizedGraph.NoCache
-
Get a set of all edges in AsSynchronizedGraph's backing graph incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCopy
-
Get a set of all edges in AsSynchronizedGraph's backing graph incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of all edges incoming into the specified vertex.
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- incomingEdgesOf(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- incomingEdgesOf(V) - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable view over all edges incoming into the specified vertex.
- IncomingEdgesSupport - Enum Class in org.jgrapht.opt.graph.sparse
-
Enumeration for different kind of incoming edges support.
- IncomingEdgesSupport() - Constructor for enum class org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
- IncomingNoReindexSparseDirectedSpecifics - Class in org.jgrapht.opt.graph.sparse.specifics
-
Specifics for a sparse directed graph which does not re-index the edges and supports incoming edges.
- IncomingNoReindexSparseDirectedSpecifics(int, int, Supplier<Stream<Pair<Integer, Integer>>>, boolean) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
-
Create a new graph from an edge list.
- InconsistentTerminationCriterion(BidirectionalAStarShortestPath.AStarSearchFrontier, BidirectionalAStarShortestPath.AStarSearchFrontier) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.InconsistentTerminationCriterion
- increaseResidualCapacity(int) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
Increases residual capacity of this arc by
value
units of flow. - increment() - Method in class org.jgrapht.util.ModifiableInteger
-
Adds one to the value of this modifiable integer.
- incrementDischarges(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- incrementRelabels(int, int) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- inDegreeMap - Variable in class org.jgrapht.traverse.TopologicalOrderIterator
- inDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- inDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- inDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
- inDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- inDegreeOf(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns the "in degree" of the specified vertex.
- inDegreeOf(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph
- inDegreeOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- inDegreeOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- inDegreeOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- inDegreeOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- inDegreeOf(Long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- inDegreeOf(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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 class org.jgrapht.graph.guava.BaseGraphAdapter
- inDegreeOf(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- inDegreeOf(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- inDegreeOf(V) - Method in interface org.jgrapht.GraphIterables
-
Returns the "in degree" of the specified vertex.
- INDENT - Static variable in class org.jgrapht.nio.dot.DOTExporter
- 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
- index - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring.HeapHandle
- index - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- index - Variable in class org.jgrapht.alg.flow.DinicMFImpl.VertexExtension
-
Stores index of the first unexplored edge from current vertex.
- index - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- 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
- indexIncomingEdges() - Method in class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
-
Build the index for the incoming edges.
- indexList - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- indexList - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- indexList - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- indexList - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- indexList - Variable in class org.jgrapht.util.VertexToIntegerMapping
- indexMap - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- indexMap - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- indexMap - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- 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
. - indexToLValueList - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
List which at every position $i$ stores value of $l()$ function for a vertex from
tree
whihc has ordering index equal to $i$. - indexToVertexList - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
List which at very position $i$ stores a vertex from
tree
which has ordering index equal to $i$. - indices - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Inverse of the bijective mapping of vertices onto $\left[0,n-1\right]$
- indices - Variable in class org.jgrapht.graph.guava.ElementOrder
- INF - Static variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- INFINITY - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.Label
-
This node doesn't belong to any tree and is matched to some other node
- INFINITY - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default infinity value used in the algorithm
- inIncidenceMatrix - Variable in class org.jgrapht.opt.graph.sparse.specifics.IncomingNoReindexSparseDirectedSpecifics
-
Incidence matrix with incoming edges
- init() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- init() - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- init() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Converts the flow network in the form convenient for the algorithm.
- init() - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Prepares the data structures
- init() - Method in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
-
Initialize data structures
- init(Graph<V, E>) - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Initialize graph and mapping to integer vertices.
- init(Graph<V, E>) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Initializes internal datastructures.
- init(Graph<V, E>, double, ThreadPoolExecutor, Comparator<V>) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Initializes
delta
,parallelism
,distanceAndPredecessorMap
,completionService
,verticesQueue
,lightRelaxTask
andheavyRelaxTask
fields. - init(Graph<V, E>, Supplier<Random>, Supplier<AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>, ThreadPoolExecutor) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Initialized field of this algorithm.
- init(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.BaseLayoutAlgorithm2D
-
Initialize a model using the initializer.
- init(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Prepares all data structures to start a new invocation of the Maximum Flow or Minimum Cut algorithms
- init(V, V, ExtensionFactory<VE>, ExtensionFactory<MaximumFlowAlgorithmBase.AnnotatedFlowEdge>) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Prepares all data structures to start a new invocation of the Maximum Flow or Minimum Cut algorithms
- initAuxiliaryGraph() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Initializes an auxiliary graph by adding tree edges between trees and adding (+, +) cross-tree edges and (+, inf) edges to the appropriate heaps
- initChains() - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Initializes source chains by adding source nodes as 1-st nodes of their chains.
- initFractional() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Solves the fractional matching problem formulated on the initial graph.
- initGraph() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Converts the generic graph representation into the form convenient for the algorithm
- initGreedy() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Performs greedy matching initialization.
- INITIAL_TIMESTAMP - Static variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
A timestamp for the first algorithm loop iteration.
- initialComponentRoot - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The component root the node is created in.
- initialGraph - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
The graph we are matching on
- initialGraph - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Initial graph specified during the construction time
- initializationType - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
What strategy to choose to initialize the matching before the main phase of the algorithm
- InitializationType() - Constructor for enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- initialize() - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
- initialize() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- initialize(Set<? extends V>, Set<? extends E>) - Method in class org.jgrapht.graph.AsSubgraph
- initialize(PushRelabelMFImpl.VertexExtension, PushRelabelMFImpl.VertexExtension, Queue<PushRelabelMFImpl.VertexExtension>) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Initialization
- initialize(AStarAdmissibleHeuristic<V>) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Initializes the data structures.
- initialize(BlossomVOptions) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Converts the generic graph representation into the data structure form convenient for the algorithm, and initializes the matching according to the strategy specified in
options
. - initialize(TransitNodeRoutingPrecomputation.TransitNodeRouting<V, E>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Initializes fields
contractionHierarchy
,localityFilter
,accessVertices
,manyToManyShortestPaths
andlocalQueriesAlgorithm
. - initialize(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Index the graph and create a double-linked list representation suitable for vertex and edge removals in constant time.
- initialized - Variable in class org.jgrapht.traverse.ClosestFirstIterator
- initializeNetwork() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Initializes network (only once) for Min-Cut computation Adds s,t to vertex set Adds every v in V to vertex set Adds edge sv and vt for each v in V to edge set Adds every edge uv and vu from E to edge set Sets edge weights for all edges from E
- initializer - Variable in class org.jgrapht.alg.drawing.BaseLayoutAlgorithm2D
-
A model initializer
- initializer - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- initializer - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- initializer - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
- initializer - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- initialSolution - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
the initial solution
- initialVertexMapping - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
mapping from the base graph vertex to the vertex index in the improvement graph
- initiaVertex - Variable in class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Nulled, if it has no next
- initMappings() - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Initializes the mappings of the vertices
- initMinSCGState() - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- initState() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- initState(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- initState(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- initState(Consumer<List<V>>) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- initVisibleVertices() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Compute all vertices that have positive degree by iterating over the edges on purpose.
- innerEnum - Variable in class org.jgrapht.util.PrefetchIterator
- innerFunctorUsageCounter - Variable in class org.jgrapht.util.PrefetchIterator
- inputPruferSeq - Variable in class org.jgrapht.generate.PruferTreeGenerator
- inSameSet(T, T) - Method in class org.jgrapht.alg.util.UnionFind
-
Tests whether two elements are contained in the same set.
- insert(SaturationDegreeColoring.HeapHandle) - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- insert(Point2D) - Method in class org.jgrapht.alg.drawing.FRQuadTree
-
Insert a new point.
- insert(T, D) - Method in interface org.jgrapht.alg.scoring.ApBetweennessCentrality.MyQueue
- insert(T, D) - Method in interface org.jgrapht.alg.scoring.BetweennessCentrality.MyQueue
- insert(V, Double) - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.UnweightedQueue
- insert(V, Double) - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- insert(V, Double) - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.UnweightedQueue
- insert(V, Double) - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- INSERT - Enum constant in enum class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
-
Indicates that an edit operation is inserting a vertex into a tree.
- insertBefore(LexBreadthFirstIterator.BucketList.Bucket) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Inserts this bucket in the data structure before the
bucket
. - insertCost - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Function which computes cost of inserting a particular vertex into
tree2
. - insertLocation - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- insertPersistently(EppsteinShortestPathIterator.PathsGraphVertex, EppsteinShortestPathIterator.PathsGraphVertex) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Inserts
vertex
into the balanced heap rooted atroot
in a persistent (non-destructive) way. - insertVertex(V, EppsteinShortestPathIterator.PathsGraphVertex) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Guides the process of adding the sidetracks of
v
to the paths graph. - insideAttribute - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideAttributes - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideAttValue - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideAttValues - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideData - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- insideData - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- insideDefault - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- insideEdge - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideEdge - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- insideEdge - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- insideEdge - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- insideEdges - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- insideEdgesArray - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- insideGraph - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideGraph - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- insideGraph - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- insideNode - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- insideNode - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- insideNode - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- insideNode - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- insideNodes - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- insideNodesArray - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- INSTANCE - Static variable in class org.jgrapht.alg.TransitiveClosure
-
Singleton instance.
- INSTANCE - Static variable in class org.jgrapht.alg.TransitiveReduction
-
Singleton instance.
- INT - Enum constant in enum class org.jgrapht.nio.AttributeType
- INTEGER - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- INTEGER_PAIR_LEX_COMPARATOR - Static variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
- IntegerIdProvider<T> - Class in org.jgrapht.nio
-
Assign a unique integer identifier to a set of elements.
- IntegerIdProvider() - Constructor for class org.jgrapht.nio.IntegerIdProvider
-
Create a new provider
- IntegerIdProvider(int) - Constructor for class org.jgrapht.nio.IntegerIdProvider
-
Create a new provider.
- internal() - Static method in class org.jgrapht.graph.guava.ElementOrder
-
Create an internal element order which maintains a map from elements to long values.
- internal() - Static method in class org.jgrapht.graph.guava.ElementOrderMethod
-
Get the internal ordering method.
- INTERNAL - Enum constant in enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
-
An internal numbering scheme backed by a map.
- InternalState() - Constructor for class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
- intersectGraphPaths(GraphPath<V, E>, GraphPath<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Lists the vertices which are covered by two paths
- intersection(Set<V>, Set<V>) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Efficient way to compute the intersection between two sets
- IntrusiveEdge - Class in org.jgrapht.graph
-
IntrusiveEdge encapsulates the internals for the default edge implementation.
- IntrusiveEdge() - Constructor for class org.jgrapht.graph.IntrusiveEdge
- IntrusiveEdgeException - Exception Class in org.jgrapht.graph
-
Special
RuntimeException
to signal thatIntrusiveEdge
is used incorrectly. - IntrusiveEdgeException(V, V) - Constructor for exception class org.jgrapht.graph.IntrusiveEdgeException
- intrusiveEdgesSpecifics - Variable in class org.jgrapht.graph.AbstractBaseGraph
- IntrusiveEdgesSpecifics<V,
E> - Interface in org.jgrapht.graph -
An interface for the set of intrusive edges of a graph.
- IntrusiveWeightedEdge - Class in org.jgrapht.graph
-
IntrusiveEdge extension for weighted edges.
- IntrusiveWeightedEdge() - Constructor for class org.jgrapht.graph.IntrusiveWeightedEdge
- 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.
- IntVertexDijkstraShortestPath.Algorithm - Class in org.jgrapht.alg.shortestpath
-
The actual implementation class.
- IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl - Class in org.jgrapht.alg.shortestpath
- IntVertexDijkstraShortestPath.IdentifierMap - Class in org.jgrapht.alg.shortestpath
-
A very special case linear probing hash table, fit for this particular use case.
- INVALID_PARTITION_OF_VERTICES - Static variable in class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
- INVALID_VERTEX_SUPPLIER_DOES_NOT_RETURN_UNIQUE_VERTICES_ON_EACH_CALL - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- InvalidGraphWalkException - Exception Class in org.jgrapht.graph
-
Exception thrown in the event that the path is invalid.
- InvalidGraphWalkException(String) - Constructor for exception class org.jgrapht.graph.InvalidGraphWalkException
- invalidParam(String) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Throws
IllegalArgumentException
with the specifiedmessage
. - inverse - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- 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.
- inwardSpokes - Variable in class org.jgrapht.generate.WheelGraphGenerator
- isActiveWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Check whether this node is active.
- isAdmissible(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- isAlgorithmExecuted - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
contains whether the algorithm was executed
- isAlgorithmExecuted - Variable in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
contains whether the algorithm was executed
- 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. - isAlphaConsistent(VertexColoringAlgorithm.Coloring<V>, Graph<V, E>) - Method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Checks whether alpha is a valid surjective l-coloring for the given graph
- isAncestor(int, int) - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- isAssignmentProblem() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Checks if the network is a bipartite matching problem (assignment problem).
- 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.
- isBlossom - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
True if this node is a blossom node (also called a "pseudonode", the notions are equivalent)
- 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.CacheAccess
-
Return whether the graph uses cache for
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - isCacheEnabled() - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Return whether the graph uses cache for
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - isCacheEnabled() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Return whether the graph uses cache for
edgesOf
,incomingEdgesOf
andoutgoingEdgesOf
methods. - isCacheEnabled() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
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 - Variable in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
- 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.
- isClique(Graph<V, E>, Set<V>) - Static method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Check whether the subgraph of
graph
induced by the givenvertices
is complete, i.e. - isCloserToTerminal(BoykovKolmogorovMFImpl.VertexExtension, BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Checks if the vertex
p
is closer to terminal than the vertext
using the distance heuristic. - isColoringDiscrete - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
contains whether the two graphs produce a discrete coloring.
- isColoringDiscrete() - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Returns whether the coarse colorings of the two given graphs are discrete.
- 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
-
Returns
true
if there are no more uniterated vertices in the currently iterated connected component;false
otherwise. - 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
. - isContracted - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
-
Determines if a vertex is already contracted or not.
- 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.CopyOnDemandSet
-
Return whether copyless mode is used for iteration.
- isCopyless() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Return whether copyless mode is used for collection-returning methods.
- isCostWeighted() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Checks if the network allows different arc costs.
- 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.
- isCurrentCycleFound - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Determines if a cycle is found on current iteration.
- 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.
- isDiscovered() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- isEmpty() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
Returns whether the path is empty, i.e.
- isEmpty() - Method in interface org.jgrapht.alg.scoring.ApBetweennessCentrality.MyQueue
- isEmpty() - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.UnweightedQueue
- isEmpty() - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- isEmpty() - Method in interface org.jgrapht.alg.scoring.BetweennessCentrality.MyQueue
- isEmpty() - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.UnweightedQueue
- isEmpty() - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- isEmpty() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Check if the queue has any items.
- isEmpty() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- 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.graph.MaskEdgeSet
- isEmpty() - Method in class org.jgrapht.graph.MaskVertexSet
- isEmpty() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Checks whether this bucket is empty.
- isEmpty() - Method in class org.jgrapht.util.AVLTree
-
Check if this tree is empty
- 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.
- isEqualsStraightOrInverted(Object, Object, E) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
- isEulerian(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Test whether a graph is Eulerian.
- isEulerian(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is Eulerian.
- isEven(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- isExportEdgeLabels() - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Whether the exporter will print edge labels.
- isExportEdgeWeights() - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Whether the exporter will print edge weights.
- isExportVertexLabels() - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Whether the exporter will print vertex labels.
- isExposed(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
-
Test whether a vertex is exposed (i.e.
- isExternallyActiveWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Checks whether this node is externally active with respect to the
node
. - 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.
- isFeasiblePair() - Method in class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismState
- isFeasiblePair() - Method in class org.jgrapht.alg.isomorphism.VF2State
- isFeasiblePair() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismState
- isFinished - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra.ContractionSearchFrontier
- isFinished() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- 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 - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
contains whether the two graphs are forests.
- isForest() - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Returns whether the two given graphs are forests.
- isForest(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether an undirected graph is a forest.
- isFreeVertex() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Checks if this vertex belongs to no tree, i.e.
- isGetNextLastResultUpToDate - Variable in class org.jgrapht.util.PrefetchIterator
- isGoal() - Method in class org.jgrapht.alg.isomorphism.VF2State
- isGreater(ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Determines if priority of
vertex1
is greater than the priority ofvertex2
. - isIn(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Check if index is in the region.
- isInactiveWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Check whether this node is inactive.
- isIncidentTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
True if this edge is incident to the node
node
, false otherwise - isIndependent - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
-
Determines if a vertex is independent or not.
- isInduced - Variable in class org.jgrapht.graph.AsSubgraph
- isInfiniteCapacityArc() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
Returns true if the arc has infinite capacity, false otherwise.
- isInfinityNode() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Checks whether this node is an infinity node
- isInternallyActiveWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Check whether this node is internally active.
- isInverted() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
Returns true if the traversal was inverted when descending to the child biconnected component, false otherwise
- isIsomorphic - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
contains whether the graphs are isomorphic or not.
- 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. - isKeyroot - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Indites if
v
is a keyroot wrttree
. - isKeyrootArg - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Indicates if the next vertex returned by
vChildIterator
will be a keyroot. - isKuratowskiSubdivision(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Checks whether the
graph
is a Kuratowski subdivision. - isLeaf() - Method in class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Check if a node is a leaf.
- isLeftChild() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns
true
if this node is a left child of its parent,false
otherwise - isLeftDoubleHeavy() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns
true
if this node is unbalanced and the left child's height is greater,false otherwise
- isLeftHeavy() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns
true
if the height of the left child is greater than the height of the right child - isLocal(V, V) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilter
-
Returns $true$ when no shortest paths between
source
andsink
contains a transit vertex. - isMarked - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Support variable.
- isMatched(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
-
Test whether a vertex is matched (i.e.
- 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.
- isMaxFlowProblem() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Checks if a network can be interpreted as a maximum flow problem.
- isMaximumMatching(MatchingAlgorithm.Matching<V, E>) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Checks whether the given matching is of maximum cardinality.
- isMinusNode() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Checks whether this node is a minus node
- 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. - isOdd(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- isOddOrUnreached(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- 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 - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
The isomorphism that is calculated by this color refinement isomorphism inspector
- 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
- isomorphicMapping - Variable in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- 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
- isomorphismExists(V, V) - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- IsomorphismInspector<V,
E> - Interface in org.jgrapht.alg.isomorphism -
General interface for graph and subgraph isomorphism.
- isomorphismTestExecuted - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
contains whether the isomorphism test is executed to ensure that every operation is defined all the time
- IsomorphismUndecidableException - Exception Class in org.jgrapht.alg.isomorphism
-
Implementation of IsomorphismUndecidableException to indicate undecidable isomorphism cases in isomorphism inspectors
- IsomorphismUndecidableException() - Constructor for exception class org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with null as its detail message.
- IsomorphismUndecidableException(String) - Constructor for exception class org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with the specified detail message.
- IsomorphismUndecidableException(String, Throwable) - Constructor for exception class org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
-
Constructs a new exception with the specified detail message and cause.
- IsomorphismUndecidableException(Throwable) - Constructor for exception class 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.
- isOuter - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
True if this node is outer, i.e.
- isOverfull(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether a graph is overfull.
- isParameter(CSVFormat.Parameter) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Return if a particular parameter of the exporter is enabled
- isParameter(CSVFormat.Parameter) - Method in class org.jgrapht.nio.csv.CSVExporter
-
Return if a particular parameter of the exporter is enabled
- isParameter(CSVFormat.Parameter) - Method in class org.jgrapht.nio.csv.CSVImporter
-
Return if a particular parameter of the exporter is enabled
- isParameter(DIMACSExporter.Parameter) - Method in class org.jgrapht.nio.dimacs.DIMACSExporter
-
Return if a particular parameter of the exporter is enabled
- isParameter(GEXFExporter.Parameter) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Return if a particular parameter of the exporter is enabled
- isParameter(GmlExporter.Parameter) - Method in class org.jgrapht.nio.gml.GmlExporter
-
Return if a particular parameter of the exporter is enabled
- isParameter(LemonExporter.Parameter) - Method in class org.jgrapht.nio.lemon.LemonExporter
-
Return if a particular parameter of the exporter is enabled
- 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. - isPerfectEliminationOrder(List<V>, boolean) - 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. - isPertinentWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Checks whether this node is pertinent in the context of processing the node
node
. - 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.
- isPlusNode() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Checks whether this node is a plus node
- isProcessed - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Support variable to identify the nodes which have been "processed" in some sense by the algorithm.
- 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. - isRightChild() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns
true
if this node is a right child of its parent,false
otherwise - isRightDoubleHeavy() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns
true
if this node is unbalanced and the right child's height is greater,false otherwise
- isRightHeavy() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns
true
if the height of the right child is greater than the height of the left child - isRootVertex() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Returns true if the node is a component root, false otherwise
- isSchemaValidation() - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
-
Whether the importer validates the input
- isSchemaValidation() - Method in class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Whether the importer validates the input
- isSchemaValidation() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
-
Whether the importer validates the input
- isSchemaValidation() - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Whether the importer validates the input
- isSchemaValidation() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
-
Whether the importer validates the input
- isSchemaValidation() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
-
Whether the importer validates the input
- isSchemaValidation() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Whether the importer validates the input
- 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.
- isSingleSourceSingleSinkProblem() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Checks if this problem is in the canonical form.
- isSingleton() - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Checks if this node is a zero-degree node
- isSinkTreeVertex() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Checks if this vertex belongs to the sink tree.
- isSourceTreeVertex() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Checks if this vertex belongs to the source tree.
- isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
- isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
-
Check if two vertices are reachable by a BFS in the spanner graph using only a certain number of hops.
- isSpannerReachable(V, V, double) - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
- isSplit(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether an undirected graph is a split graph.
- isStronglyConnected() - Method in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- 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.
- isTimeLimitReached() - Method in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Check the computation has stopped due to a time limit or due to computing all maximal cliques.
- isTree(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Test whether an undirected graph is a tree.
- isTreeRoot - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
True if this node is a tree root, implies that this node is outer and isn't matched
- isTriangleFree(Graph<V, E>) - Static method in class org.jgrapht.GraphTests
-
Tests whether an undirected graph is triangle-free (i.e.
- isTripleRelevant(Graph<V, E>, V, V, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
A triple (a,b,c) of vertices is relevant if a,b are distinct and nonadjacent, and c is not contained in N(a,b) (possibly c is contained in {a,b}).
- 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 - isUpward - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Determines if this edge source has lower contraction level than its target.
- isValid() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Data
- isValid() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- isValid() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.Key
- isValidArc(NetworkGenerator.Node, NetworkGenerator.Node) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Checks if it is possible to add an arc between
tail
andhead
to the network. - isValidDelimiter(char) - Static method in class org.jgrapht.nio.csv.DSVUtils
-
Test if a character can be used as a delimiter in a Delimiter-separated values file.
- isValidID(String) - Static method in class org.jgrapht.nio.dot.DOTUtils
-
Test if the ID candidate is a valid ID.
- 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.
- isVisitedWrtTo(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Checks whether this node is visited in the context of processing the node
node
- 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 - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- isWeighted() - Method in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
-
Determines if this problem is weighted or not.
- isWeighted() - Method in interface org.jgrapht.generate.netgen.BipartiteMatchingProblem
-
Determines if this problem is weighted or not.
- 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. - isYXComplete(Graph<V, E>, V, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
A vertex y is X-complete if y contained in V(g)\X is adjacent to every vertex in X.
- Item(int) - Constructor for class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item
- items - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
- iterables - Variable in class org.jgrapht.sux4j.SuccinctDirectedGraph
- iterables - Variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- iterables - Variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- iterables - Variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- iterables - Variable in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- iterables - Variable in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- iterables - Variable in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- iterables - Variable in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- iterables() - Method in class org.jgrapht.graph.AbstractBaseGraph
- iterables() - Method in interface org.jgrapht.Graph
-
Access the graph using the
GraphIterables
interface. - iterables() - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- iterables() - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- iterables() - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- iterables() - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- iterables() - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- iterables() - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- iterables() - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- iterables() - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- iterateShortcutEdges(ContractionHierarchyPrecomputation.ContractionVertex<V>, BiConsumer<ContractionHierarchyPrecomputation.ContractionEdge<E>, ContractionHierarchyPrecomputation.ContractionEdge<E>>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Runs forward shortest-path searches in current overlay graph to find shortcuts of
vertex
. - iterateToSuccessors(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, ContractionHierarchyPrecomputation.ContractionVertex<V>, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>, ContractionHierarchyPrecomputation.ContractionVertex<V>, double) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Performs Dijkstra search in the
graph
starting at vertexsource
ignoring vertexvertexToIgnore
. - iterationOrder - Variable in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
- iterationOrder - Variable in class org.jgrapht.alg.cycle.ChordalityInspector
-
Stores the type of iterator used by this
ChordalityInspector
. - IterationOrder() - Constructor for enum class org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
- iterations - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- iterator - Variable in class org.jgrapht.util.AVLTree.TreeValuesIterator
-
Internally used
TreeNodeIterator
- iterator - Variable in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- iterator() - Method in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
- 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.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
Returns an iterator over the elements in the backing set's unmodifiable copy.
- iterator() - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Returns a topological order iterator.
- iterator() - Method in class org.jgrapht.graph.MaskEdgeSet
- iterator() - Method in class org.jgrapht.graph.MaskVertexSet
- iterator() - Method in class org.jgrapht.opt.graph.sparse.specifics.CompleteIntegerSet
- iterator() - Method in class org.jgrapht.util.ArrayUnenforcedSet.SetForEquality
- iterator() - Method in class org.jgrapht.util.AVLTree
- iterator() - Method in class org.jgrapht.util.DoublyLinkedList
- iterator() - Method in class org.jgrapht.util.ElementsSequenceGenerator
- iterator() - Method in class org.jgrapht.util.LiveIterableWrapper
- iterator() - Method in class org.jgrapht.util.UnmodifiableUnionSet
- iterator() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- iterator(int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Returns a circulator, that moves in the direction
direction
. - iToV - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- iToV - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- iToV - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
J
- JaccardCoefficientLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Jaccard coefficient.
- JaccardCoefficientLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.JaccardCoefficientLinkPrediction
-
Create a new prediction
- 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.
- JohnsonShortestPaths.JohnsonSingleSourcePaths - Class in org.jgrapht.alg.shortestpath
- 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.
- JohnsonSingleSourcePaths(V) - Constructor for class org.jgrapht.alg.shortestpath.JohnsonShortestPaths.JohnsonSingleSourcePaths
- json() - Method in class org.jgrapht.io.JsonParser
- json() - Method in class org.jgrapht.nio.json.JsonParser
- JsonBaseListener - Class in org.jgrapht.io
-
This class provides an empty implementation of
JsonListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - JsonBaseListener - Class in org.jgrapht.nio.json
-
This class provides an empty implementation of
JsonListener
, which can be extended to create a listener which only needs to handle a subset of the available methods. - JsonBaseListener() - Constructor for class org.jgrapht.io.JsonBaseListener
- JsonBaseListener() - Constructor for class org.jgrapht.nio.json.JsonBaseListener
- JsonContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.JsonParser.JsonContext
- JsonContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.json.JsonParser.JsonContext
- JSONEventDrivenImporter - Class in org.jgrapht.nio.json
-
Imports a graph from a JSON file.
- JSONEventDrivenImporter() - Constructor for class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Constructs a new importer.
- JSONEventDrivenImporter(boolean, boolean) - Constructor for class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Constructs a new importer.
- JSONEventDrivenImporter.NotifyJsonListener - Class in org.jgrapht.nio.json
- JSONEventDrivenImporter.ThrowingErrorListener - Class in org.jgrapht.nio.json
- JSONExporter<V,
E> - Class in org.jgrapht.nio.json -
Exports a graph using JSON.
- JSONExporter() - Constructor for class org.jgrapht.nio.json.JSONExporter
-
Creates a new exporter with integers for the vertex identifiers.
- JSONExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.json.JSONExporter
-
Creates a new exporter.
- JSONImporter<V,
E> - Class in org.jgrapht.nio.json -
Imports a graph from a JSON file.
- JSONImporter() - Constructor for class org.jgrapht.nio.json.JSONImporter
-
Construct a new importer
- JSONImporter.Consumers - Class in org.jgrapht.nio.json
- JsonLexer - Class in org.jgrapht.io
- JsonLexer - Class in org.jgrapht.nio.json
- JsonLexer(CharStream) - Constructor for class org.jgrapht.io.JsonLexer
- JsonLexer(CharStream) - Constructor for class org.jgrapht.nio.json.JsonLexer
- JsonListener - Interface in org.jgrapht.io
-
This interface defines a complete listener for a parse tree produced by
JsonParser
. - JsonListener - Interface in org.jgrapht.nio.json
-
This interface defines a complete listener for a parse tree produced by
JsonParser
. - JsonParser - Class in org.jgrapht.io
- JsonParser - Class in org.jgrapht.nio.json
- JsonParser(TokenStream) - Constructor for class org.jgrapht.io.JsonParser
- JsonParser(TokenStream) - Constructor for class org.jgrapht.nio.json.JsonParser
- JsonParser.ArrayContext - Class in org.jgrapht.io
- JsonParser.ArrayContext - Class in org.jgrapht.nio.json
- JsonParser.JsonContext - Class in org.jgrapht.io
- JsonParser.JsonContext - Class in org.jgrapht.nio.json
- JsonParser.ObjContext - Class in org.jgrapht.io
- JsonParser.ObjContext - Class in org.jgrapht.nio.json
- JsonParser.PairContext - Class in org.jgrapht.io
- JsonParser.PairContext - Class in org.jgrapht.nio.json
- JsonParser.ValueContext - Class in org.jgrapht.io
- JsonParser.ValueContext - Class in org.jgrapht.nio.json
K
- k - Variable in class org.jgrapht.alg.clustering.GirvanNewmanClustering
- k - Variable in class org.jgrapht.alg.clustering.KSpanningTreeClustering
- k - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
- k - Variable in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
- k - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- k - Variable in class org.jgrapht.generate.WattsStrogatzGraphGenerator
- KatzCentrality<V,
E> - Class in org.jgrapht.alg.scoring -
Katz centrality implementation.
- KatzCentrality(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- KatzCentrality(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- KatzCentrality(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- KatzCentrality(Graph<V, E>, double, int, double) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- KatzCentrality(Graph<V, E>, double, ToDoubleFunction<V>) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- KatzCentrality(Graph<V, E>, double, ToDoubleFunction<V>, int) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- KatzCentrality(Graph<V, E>, double, ToDoubleFunction<V>, int, double) - Constructor for class org.jgrapht.alg.scoring.KatzCentrality
-
Create and execute an instance of KatzCentrality.
- key - Variable in class org.jgrapht.nio.gexf.GEXFExporter.AttributeDetails
- key - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Data
- key - Variable in class org.jgrapht.nio.graphml.GraphMLExporter.AttributeDetails
- Key(String, String, String, GraphMLEventDrivenImporter.KeyTarget) - Constructor for class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- Key(String, String, AttributeType, String) - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.Key
- KEY - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- KEY - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- KEY_ATTR_NAME - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- KEY_ATTR_NAME - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- KEY_ATTR_TYPE - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- KEY_ATTR_TYPE - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- KEY_FOR - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- KEY_FOR - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- KEY_ID - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- KEY_ID - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- keyroots - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
List of keyroots of
tree
. - keys - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- KeyTarget() - Constructor for enum class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.KeyTarget
- keyValuePair() - Method in class org.jgrapht.io.GmlParser.GmlContext
- keyValuePair() - Method in class org.jgrapht.io.GmlParser
- keyValuePair() - Method in class org.jgrapht.io.GmlParser.ListKeyValueContext
- keyValuePair() - Method in class org.jgrapht.nio.gml.GmlParser.GmlContext
- keyValuePair() - Method in class org.jgrapht.nio.gml.GmlParser
- keyValuePair() - Method in class org.jgrapht.nio.gml.GmlParser.ListKeyValueContext
- keyValuePair(int) - Method in class org.jgrapht.io.GmlParser.GmlContext
- keyValuePair(int) - Method in class org.jgrapht.io.GmlParser.ListKeyValueContext
- keyValuePair(int) - Method in class org.jgrapht.nio.gml.GmlParser.GmlContext
- keyValuePair(int) - Method in class org.jgrapht.nio.gml.GmlParser.ListKeyValueContext
- KeyValuePairContext() - Constructor for class org.jgrapht.io.GmlParser.KeyValuePairContext
- KeyValuePairContext() - Constructor for class org.jgrapht.nio.gml.GmlParser.KeyValuePairContext
- KeyValuePairContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.GmlParser.KeyValuePairContext
- KeyValuePairContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.gml.GmlParser.KeyValuePairContext
- keywords - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- 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
- KosarajuStrongConnectivityInspector.VertexData<V> - Class in org.jgrapht.alg.connectivity
- KosarajuStrongConnectivityInspector.VertexData1<V> - Class in org.jgrapht.alg.connectivity
- KosarajuStrongConnectivityInspector.VertexData2<V> - Class in org.jgrapht.alg.connectivity
- 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.
- 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.
- KuhnMunkresMatrixImplementation(Graph<V, E>, List<? extends V>, List<? extends V>) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Construct new instance
- KuhnMunkresMinimalWeightBipartitePerfectMatching<V,
E> - Class in org.jgrapht.alg.matching -
Kuhn-Munkres algorithm (named in honor of Harold Kuhn and James Munkres) solving assignment problem also known as hungarian algorithm (in the honor of hungarian mathematicians Dénes K?nig and Jen? Egerváry).
- KuhnMunkresMinimalWeightBipartitePerfectMatching(Graph<V, E>, Set<? extends V>, Set<? extends V>) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
-
Construct a new instance of the algorithm.
- KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation<V,
E> - Class in org.jgrapht.alg.matching -
The actual implementation.
- KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender - Class in org.jgrapht.alg.matching
-
Aggregates utilities to extend matching
- kuratowskiCleanUp() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Cleans up the dfs trees before the Kuratowski subdivision extraction phase
- kuratowskiSubdivision - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The subgraph of the
graph
, which is a Kuratowski subdivision.
L
- l - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- label - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Current label of this node.
- label - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- Label() - Constructor for enum class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.Label
- Label() - Constructor for enum class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm.Label
- Label(V, double[], MartinShortestPath.Label, E) - Constructor for class org.jgrapht.alg.shortestpath.MartinShortestPath.Label
- LABEL_ATTRIBUTE_KEY - Static variable in class org.jgrapht.nio.gml.GmlExporter
- LABEL_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.gexf.GEXFExporter
- LabelComparator() - Constructor for class org.jgrapht.alg.shortestpath.MartinShortestPath.LabelComparator
- labeledNodes - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- LabeledPath(ArrayList<V>, double, HashSet<Integer>) - Constructor for class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
Constructs a LabeledPath with the given inputs
- labelMap - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
the map that maps each vertex to a subset (identified by labels) of the partition
- LabelPropagationClustering<V,
E> - Class in org.jgrapht.alg.clustering -
A label propagation clustering algorithm.
- LabelPropagationClustering(Graph<V, E>) - Constructor for class org.jgrapht.alg.clustering.LabelPropagationClustering
-
Create a new clustering algorithm.
- LabelPropagationClustering(Graph<V, E>, int) - Constructor for class org.jgrapht.alg.clustering.LabelPropagationClustering
-
Create a new clustering algorithm.
- LabelPropagationClustering(Graph<V, E>, int, Random) - Constructor for class org.jgrapht.alg.clustering.LabelPropagationClustering
-
Create a new clustering algorithm.
- LabelPropagationClustering(Graph<V, E>, Random) - Constructor for class org.jgrapht.alg.clustering.LabelPropagationClustering
-
Create a new clustering algorithm.
- LabelPropagationClustering.Implementation<V,
E> - Class in org.jgrapht.alg.clustering -
The actual implementation
- labels - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
- labels - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
the labels the path contains
- labels - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey
-
the label set of the paths indexed by this key
- labels - Variable in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- labels - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
labeling of the improvement graph vertices.
- labelType - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
The label of this node.
- 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.
- last - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
ListNode this iterator returned last.
- lastArcs - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl.VertexExtension
- lastDeviations - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
For each path $P$ stores the vertex $u$ such that $pathValidator#isValidPath([start_vertex, u], (u,v)) = false$, where $[start_vertex, u]$ denotes the subpath of $P$ from its start to vertex $u$ and $v$ is the next vertex in $P$ after $u$.
- lastEdge - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- lastEdge - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- lastEdge - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- lastEdge - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- lastEdge - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- lastEdge - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- lastHopMatrix - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- lastIntegerTriple - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- lastInvokedSource - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- lastInvokedSource - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- lastInvokedTarget - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- lastInvokedTarget - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- lastNodeOf(Object) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the last
node
holding the specifiedelement
in this list. - lastPair - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- lastTriple - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- lastTriple - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- lastTriple - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- lastTriple - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- lastTriple - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- lastTriple - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- lastUsedColor - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
Last used color
- 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
- layout(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.RescaleLayoutAlgorithm2D
- layout(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
- 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.
- LAZY_INCOMING_EDGES - Enum constant in enum class org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
-
Support incoming edges only if explicitly requested by the user using a method call which requires incoming edges.
- lazyCalculateMatrix() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Calculates the matrix of all shortest paths, but does not populate the last hops matrix.
- lazyComputeColoring() - Method in class org.jgrapht.alg.color.BrownBacktrackColoring
- lazyComputeColoring() - Method in class org.jgrapht.alg.color.ChordalGraphColoring
-
Lazily computes the coloring of the graph.
- lazyComputeDualSolution() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes a solution to a dual linear program formulated on the initial graph.
- lazyComputeEmbedding() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Lazily computes a combinatorial embedding of the
graph
by removing all the short-circuit edges and properly orienting the edges around the nodes. - lazyComputeMaximumClique() - Method in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Lazily computes some maximum clique of the
graph
. - lazyComputeMaximumIndependentSet() - Method in class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Lazily computes a maximum independent set of the inspected
graph
. - lazyComputeMaximumWeightMatching() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Lazy computes optimal matching in the
initialGraph
by reducing the problem to the optimal perfect matching problem. - lazyComputeMinimalSeparatorsWithMultiplicities() - Method in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Lazy computes a set of all minimal separators and a mapping of all minimal vertex separators to their multiplicities
- lazyComputeOrder() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Computes vertex order via
orderIterator
. - lazyComputeWeakChordality() - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Lazily tests the weak chordality of the
graph
and returns the computed value. - lazyComputeWeightedPerfectMatching() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Lazily runs the algorithm on the specified graph.
- lazyExtractKuratowskiSubdivision() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Lazily extracts a Kuratowski subdivision from the
graph
. - lazyFindConnectedSets() - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- lazyInitializePathHeap() - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Lazily initializes the path heap by computing the shortest path between the
source
and thesink
and building a necessary amount of paths until at least one valid path is found. - lazyRun() - Method in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Lazily start the computation.
- 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.
- lazyRun() - Method in class org.jgrapht.alg.scoring.Coreness
- lazyRunAlgorithm() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Performs lazy computations of this algorithm and stores cached data in
treeDistances
andeditOperationList
. - lazyTestPlanarity() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Lazily tests the planarity of the graph.
- lca(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Returns $(b, b)$ in the case where the vertices
a
andb
have a common ancestor blossom $b$. - leastAncestor - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The least dfs index of the nodes adjacent to this node.
- left - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
- left - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Left child of this node
- LeichtHolmeNewmanIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Leicht-Holme-Newman Index.
- LeichtHolmeNewmanIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.LeichtHolmeNewmanIndexLinkPrediction
-
Create a new prediction
- LemonExporter<V,
E> - Class in org.jgrapht.nio.lemon -
Exports a graph into Lemon graph format (LGF).
- LemonExporter() - Constructor for class org.jgrapht.nio.lemon.LemonExporter
-
Constructs a new exporter.
- LemonExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.lemon.LemonExporter
-
Constructs a new exporter with a given vertex id provider.
- LemonExporter.Parameter - Enum Class in org.jgrapht.nio.lemon
-
Parameters that affect the behavior of the
LemonExporter
exporter. - length - Variable in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
- length(Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Compute the length of a vector.
- lengthBound - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
bound on how long the cycle can get
- lengthBound - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
the maximal length of the cycle in the neighborhood
- lengthPath - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- level - Variable in class org.jgrapht.alg.flow.DinicMFImpl.VertexExtension
-
Level of vertex in the level graph.
- level - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- level - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- levels - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Storage of the forest, even and odd levels
- Levels(int) - Constructor for class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- LEX_BFS - Enum constant in enum class 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
. - LexBreadthFirstIterator.BucketList - Class in org.jgrapht.traverse
-
Data structure for performing lexicographical breadth-first search.
- LexBreadthFirstIterator.BucketList.Bucket - Class in org.jgrapht.traverse
-
Plays the role of the container of vertices.
- lightEdges - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- lightRelaxTask - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Task for light edges relaxation.
- LightRelaxTask(Queue<V>) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.LightRelaxTask
-
Constructs instance of a new task.
- limitReached(int) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- LINE_COMMENT - Static variable in class org.jgrapht.io.DOTLexer
- LINE_COMMENT - Static variable in class org.jgrapht.io.DOTParser
- LINE_COMMENT - Static variable in class org.jgrapht.nio.dot.DOTLexer
- LINE_COMMENT - Static variable in class org.jgrapht.nio.dot.DOTParser
- 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, - Class in org.jgrapht.alg.transformEE> -
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
- link(DoublyLinkedList.ListNodeImpl<E>, DoublyLinkedList.ListNodeImpl<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Establishes the links between the given
nodes
in such a way that thepredecessor
is linked before thesuccessor
. - link(T, T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Adds an edge between the
first
andsecond
elements. - linkBefore(DoublyLinkedList.ListNodeImpl<E>, DoublyLinkedList.ListNodeImpl<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Insert non null
node
before non nullsuccessor
into the list. - linkLast(DoublyLinkedList.ListNodeImpl<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Insert non null
node
as last node into the list. - linkListIntoThisBefore(int, DoublyLinkedList<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Insert non null
list
before node atindex
into the list. - LinkPredictionAlgorithm<V,
E> - Interface in org.jgrapht.alg.interfaces -
A link prediction algorithm.
- LinkPredictionIndexNotWellDefinedException - Exception Class in org.jgrapht.alg.linkprediction
-
An exception used to notify that a link prediction index is not well defined.
- LinkPredictionIndexNotWellDefinedException() - Constructor for exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
-
Constructs a new exception with
null
as its detail message. - LinkPredictionIndexNotWellDefinedException(String) - Constructor for exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
-
Constructs a new exception with the specified detail message.
- LinkPredictionIndexNotWellDefinedException(String, Pair<?, ?>) - Constructor for exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
-
Constructs a new exception with the specified detail message.
- list - Variable in class org.jgrapht.nio.dimacs.DIMACSImporter.Consumers
- list - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
- 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
. - ListKeyValueContext(GmlParser.KeyValuePairContext) - Constructor for class org.jgrapht.io.GmlParser.ListKeyValueContext
- ListKeyValueContext(GmlParser.KeyValuePairContext) - Constructor for class org.jgrapht.nio.gml.GmlParser.ListKeyValueContext
- 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.
- listNode - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Arc
-
A list node this arc is stored in.
- listNode - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Stores the list node from the
separatedDfsChildList
of the parent node this node is stored in. - ListNodeImpl(V) - Constructor for class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
-
Creates new list node
- ListNodeIteratorImpl(int) - Constructor for class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- ListNodeIteratorImpl(int, DoublyLinkedList.ListNodeImpl<E>) - Constructor for class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- 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.
- LISTSTRING - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- LiveIterableWrapper<E> - Class in org.jgrapht.util
-
A wrapper around a supplier of an iterable.
- LiveIterableWrapper() - Constructor for class org.jgrapht.util.LiveIterableWrapper
-
Create a new wrapper
- LiveIterableWrapper(Supplier<Iterable<E>>) - Constructor for class org.jgrapht.util.LiveIterableWrapper
-
Create a new wrapper
- loadBalancing - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.MaxEdgeWeightTask
-
Amount of edges which are processed in parallel.
- localityFilter - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Locality filter of this transit node routing.
- localityFilter - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Locality filter which is used to determine if two vertices in the graph are local to each other or not.
- LocalityFilter(Map<V, ContractionHierarchyPrecomputation.ContractionVertex<V>>, List<Set<Integer>>, List<Set<Integer>>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilter
-
Constructs a new instance for the given
contractionMapping
,visitedForwardVoronoiCells
andvisitedBackwardVoronoiCells
. - localityFilterBuilder - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
-
Builder object for a
LocalityFilter
instance. - LocalityFilterBuilder(int) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilterBuilder
-
Constructs an instance for the given
numberOfVertices
. - localQueriesAlgorithm - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Fallback shortest path algorithm for local queries.
- log2 - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- log2(int) - Static method in class org.jgrapht.util.MathUtil
-
Calculate the floor of the binary logarithm of $n$.
- LONG - Enum constant in enum class org.jgrapht.nio.AttributeType
- LONG - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- longValue() - Method in class org.jgrapht.util.ModifiableInteger
- loops - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- LOOPS_NOT_ALLOWED - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- LOOPS_NOT_ALLOWED - Static variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- LOOPS_NOT_ALLOWED - Static variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- LOOPS_NOT_ALLOWED - Static variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- lower - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- lowerBounds - Variable in class org.jgrapht.generate.netgen.Distributor
-
Lower bounds.
- lowest(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Returns the lowest of the two input node, i.e.
- LowestCommonAncestorAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Algorithm to compute a lowest common ancestor in a tree, forest or DAG.
- lowestCommonAncestors - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- lowpoint - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The least dfs index of the nodes' least ancestors in the subtree rooted at this node.
- lValue - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Value of the $l()$ function for
v
; - lVChild - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Value of $l()$ function for
vChild
.
M
- m - Variable in class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
- m - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Edge number
- m - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Number of edges in the network
- m - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- m - Variable in class org.jgrapht.generate.BarabasiAlbertGraphGenerator
- m - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
- m - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- m - Variable in class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
- m - Variable in class org.jgrapht.generate.WindmillGraphsGenerator
- m - Variable in class org.jgrapht.sux4j.AbstractSuccinctGraph
-
The number of edges in the graph.
- m - Variable in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
-
The number of edges, cached, or -1 if it still unknown.
- m - Variable in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
-
The number of edges, cached, or -1 if it still unknown.
- m0 - Variable in class org.jgrapht.generate.BarabasiAlbertGraphGenerator
- makeActive(BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Makes the
vertex
an active vertex. - makeCheckedInThisIteration(BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Sets the timestamp of the
vertex
equal to thecurrentTimestamp
. - makeEdge(int, int) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- makeEdge(int, int) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- makeEdge(int, int) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- makeEdge(long, long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- makeEdge(long, long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- makeEdge(long, long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- makeExcessMatrix() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Composes excess-matrix corresponding to the given cost-matrix
- makeFirstArc(AVLTree<T>, TreeDynamicConnectivity.Arc) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Makes the
arc
the first arc traversed by the Euler tour - makeLastArc(AVLTree<T>, TreeDynamicConnectivity.Node, TreeDynamicConnectivity.Arc) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Makes the
arc
the last arc of thenode
according to the Euler tour - makeLiteralNames() - Static method in class org.jgrapht.io.CSVLexer
- makeLiteralNames() - Static method in class org.jgrapht.io.CSVParser
- makeLiteralNames() - Static method in class org.jgrapht.io.DOTLexer
- makeLiteralNames() - Static method in class org.jgrapht.io.DOTParser
- makeLiteralNames() - Static method in class org.jgrapht.io.GmlLexer
- makeLiteralNames() - Static method in class org.jgrapht.io.GmlParser
- makeLiteralNames() - Static method in class org.jgrapht.io.JsonLexer
- makeLiteralNames() - Static method in class org.jgrapht.io.JsonParser
- makeLiteralNames() - Static method in class org.jgrapht.nio.csv.CSVLexer
- makeLiteralNames() - Static method in class org.jgrapht.nio.csv.CSVParser
- makeLiteralNames() - Static method in class org.jgrapht.nio.dot.DOTLexer
- makeLiteralNames() - Static method in class org.jgrapht.nio.dot.DOTParser
- makeLiteralNames() - Static method in class org.jgrapht.nio.gml.GmlLexer
- makeLiteralNames() - Static method in class org.jgrapht.nio.gml.GmlParser
- makeLiteralNames() - Static method in class org.jgrapht.nio.json.JsonLexer
- makeLiteralNames() - Static method in class org.jgrapht.nio.json.JsonParser
- makeOrphan() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Disconnects this vertex from its parent.
- makePath(List<E>) - Method in class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Transform an ordered list of edges into a GraphPath.
- makeRoot(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Makes the
node
the root of this tree - makeRoot(AVLTree<T>, TreeDynamicConnectivity.Node) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Makes the
node
the root of the tree. - makeRuleNames() - Static method in class org.jgrapht.io.CSVLexer
- makeRuleNames() - Static method in class org.jgrapht.io.CSVParser
- makeRuleNames() - Static method in class org.jgrapht.io.DOTLexer
- makeRuleNames() - Static method in class org.jgrapht.io.DOTParser
- makeRuleNames() - Static method in class org.jgrapht.io.GmlLexer
- makeRuleNames() - Static method in class org.jgrapht.io.GmlParser
- makeRuleNames() - Static method in class org.jgrapht.io.JsonLexer
- makeRuleNames() - Static method in class org.jgrapht.io.JsonParser
- makeRuleNames() - Static method in class org.jgrapht.nio.csv.CSVLexer
- makeRuleNames() - Static method in class org.jgrapht.nio.csv.CSVParser
- makeRuleNames() - Static method in class org.jgrapht.nio.dot.DOTLexer
- makeRuleNames() - Static method in class org.jgrapht.nio.dot.DOTParser
- makeRuleNames() - Static method in class org.jgrapht.nio.gml.GmlLexer
- makeRuleNames() - Static method in class org.jgrapht.nio.gml.GmlParser
- makeRuleNames() - Static method in class org.jgrapht.nio.json.JsonLexer
- makeRuleNames() - Static method in class org.jgrapht.nio.json.JsonParser
- makeSymbolicNames() - Static method in class org.jgrapht.io.CSVLexer
- makeSymbolicNames() - Static method in class org.jgrapht.io.CSVParser
- makeSymbolicNames() - Static method in class org.jgrapht.io.DOTLexer
- makeSymbolicNames() - Static method in class org.jgrapht.io.DOTParser
- makeSymbolicNames() - Static method in class org.jgrapht.io.GmlLexer
- makeSymbolicNames() - Static method in class org.jgrapht.io.GmlParser
- makeSymbolicNames() - Static method in class org.jgrapht.io.JsonLexer
- makeSymbolicNames() - Static method in class org.jgrapht.io.JsonParser
- makeSymbolicNames() - Static method in class org.jgrapht.nio.csv.CSVLexer
- makeSymbolicNames() - Static method in class org.jgrapht.nio.csv.CSVParser
- makeSymbolicNames() - Static method in class org.jgrapht.nio.dot.DOTLexer
- makeSymbolicNames() - Static method in class org.jgrapht.nio.dot.DOTParser
- makeSymbolicNames() - Static method in class org.jgrapht.nio.gml.GmlLexer
- makeSymbolicNames() - Static method in class org.jgrapht.nio.gml.GmlParser
- makeSymbolicNames() - Static method in class org.jgrapht.nio.json.JsonLexer
- makeSymbolicNames() - Static method in class org.jgrapht.nio.json.JsonParser
- manyToManyShortestPaths - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Many-to-many shortest paths between transit vertices.
- manyToManyShortestPathsAlgorithm - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Algorithm which is used to compute many-to-many shortest paths between transit vertices.
- 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
- map - Variable in class org.jgrapht.nio.csv.CSVImporter.Consumers
- map - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- map - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- map - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Importer.Consumers
- map - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- 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.
- mapNode(String) - Method in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- mapNode(String) - Method in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- mapNode(String) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- mapOrderToVertex - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- mapVertexToInteger(String) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
-
Map a vertex identifier to an integer.
- mapVertexToOrder - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- markContracted(int, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Sets value of
isContracted
field ofVertexData
for each vertex in the segment $[independentSetStart,independentSetEnd)$ to $true$. - marked - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- marked - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- marked - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Used to mark the boundary nodes of the biconnected
- markedStack - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- markUpwardEdgesConsumer - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Sets value of
isUpward
for the outgoing edges of a vertex. - 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
- MartinShortestPath.Label - Class in org.jgrapht.alg.shortestpath
-
A node label.
- MartinShortestPath.LabelComparator - Class in org.jgrapht.alg.shortestpath
-
Lexicographic comparator of two node labels.
- mask - Variable in class org.jgrapht.graph.MaskVertexSet
- MASK - Static variable in class org.jgrapht.util.RadixSort
- maskedContractionGraph - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
The immutable view of the
contractionGraph
which masks already contracted vertices. - maskedEdges - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Edges which are masked in the
g
. - MaskEdgeSet<V,
E> - Class in org.jgrapht.graph -
Helper for
MaskSubgraph
. - MaskEdgeSet(Graph<V, E>, Set<E>, Predicate<V>, Predicate<E>) - Constructor for class org.jgrapht.graph.MaskEdgeSet
- maskedVertices - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Vertices which are masked in the
g
. - 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.
- MaskVertexSet<V> - Class in org.jgrapht.graph
-
Helper for
MaskSubgraph
. - MaskVertexSet(Set<V>, Predicate<V>) - Constructor for class org.jgrapht.graph.MaskVertexSet
- match - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
- match() - Method in class org.jgrapht.alg.isomorphism.VF2GraphMappingIterator
- match() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
-
This function moves over all mappings between graph1 and graph2.
- match() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphMappingIterator
- match(int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
-
Add the edge $(u,v)$ to the matched edge set.
- matchAndCheck() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- matched - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
An edge which is incident to this node and currently belongs to the matching
- matchedEdge - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- matchedVertices - Variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- matchedVertices - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- matchedVertices - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- MatchExtender(boolean[], boolean[]) - Constructor for class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
- matching - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
The computed matching of the
graph
- matching - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
The computed matching of the
graph
- matching - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- matching - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- matching - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- 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
- matchingWeight - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- matchVerticesWithSameLabel(V, V, Map<V, Integer>[]) - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- mate - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- MathUtil - Class in org.jgrapht.util
-
Math Utilities.
- MathUtil() - Constructor for class org.jgrapht.util.MathUtil
- MATRIX - Enum constant in enum class org.jgrapht.nio.csv.CSVFormat
-
Matrix
- MATRIX_FORMAT_NODEID - Enum constant in enum class org.jgrapht.nio.csv.CSVFormat.Parameter
-
Whether to import/export node ids.
- MATRIX_FORMAT_ZERO_WHEN_NO_EDGE - Enum constant in enum class org.jgrapht.nio.csv.CSVFormat.Parameter
-
Whether the input/output contains zero for missing edges.
- MatrixCSVListener() - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- MatrixExporter<V,
E> - Class in org.jgrapht.nio.matrix - MatrixExporter() - Constructor for class org.jgrapht.nio.matrix.MatrixExporter
-
Creates a new MatrixExporter with integer name provider for the vertex identifiers and
MatrixExporter.Format.SPARSE_ADJACENCY_MATRIX
as the default format. - MatrixExporter(MatrixExporter.Format) - Constructor for class org.jgrapht.nio.matrix.MatrixExporter
-
Creates a new MatrixExporter with integer name provider for the vertex identifiers.
- MatrixExporter(MatrixExporter.Format, Function<V, String>) - Constructor for class org.jgrapht.nio.matrix.MatrixExporter
-
Creates a new MatrixExporter.
- MatrixExporter.Format - Enum Class in org.jgrapht.nio.matrix
-
Formats supported by the
MatrixExporter
exporter. - MAX - Static variable in interface org.jgrapht.util.WeightCombiner
-
Maximum weight.
- MAX_ARC_NUM - Static variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Upper bound on the number of arcs in the network this generator can work with.
- MAX_CLIQUE - Enum constant in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Max-clique challenge format.
- MAX_D - Static variable in class org.jgrapht.util.RadixSort
- MAX_DIGITS - Static variable in class org.jgrapht.util.RadixSort
- MAX_ITERATIONS_DEFAULT - Static variable in class org.jgrapht.alg.scoring.EigenvectorCentrality
-
Default number of maximum iterations.
- MAX_ITERATIONS_DEFAULT - Static variable in class org.jgrapht.alg.scoring.KatzCentrality
-
Default number of maximum iterations.
- MAX_ITERATIONS_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Default number of maximum iterations.
- MAX_K - Static variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner
- MAX_NODE_NUM - Static variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Upper bound on the number of nodes in the network this generator can work with.
- MAX_SUPPLY - Static variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Upper bound on the number of supply units in the network this generator can work with.
- maxCap - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- maxCap - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- maxCardinality - Variable in class org.jgrapht.traverse.MaximumCardinalityIterator
-
The maximum index of non-empty set in
buckets
. - maxColorDegree - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
mapping from color to its maximum color degree
- maxCost - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- maxCost - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- maxEdgeWeight - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Maximum edge weight in the
BaseShortestPathAlgorithm.graph
. - MaxEdgeWeightTask(Spliterator<E>, long) - Constructor for class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.MaxEdgeWeightTask
-
Constructs a new instance for the given spliterator and loadBalancing
- maxFailures - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Maximum number of consecutive failed attempts to add an edge.
- 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
- maxHops - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- MaximalCliqueEnumerationAlgorithm<V,
E> - Interface in org.jgrapht.alg.interfaces -
A maximal clique enumeration algorithm.
- MAXIMIZE - Enum constant in enum class 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
. - maximumClique - Variable in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
- 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
- MaximumFlowAlgorithmBase.AnnotatedFlowEdge - Class in org.jgrapht.alg.flow
- MaximumFlowAlgorithmBase.VertexExtensionBase - Class in org.jgrapht.alg.flow
- MaximumFlowImpl(Double, Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
-
Create a new maximum flow
- MaximumFlowProblem<V,
E> - Interface in org.jgrapht.generate.netgen -
This class represents a maximum flow problem.
- MaximumFlowProblem.MaximumFlowProblemImpl<V,
E> - Class in org.jgrapht.generate.netgen -
Default implementation of a Maximum Flow Problem.
- MaximumFlowProblemImpl(Graph<V, E>, Set<V>, Set<V>, Function<E, Double>) - Constructor for class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Constructs a new maximum flow problem.
- maximumIndependentSet - Variable in class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
- maximumIterations - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Maximum number of iterations performed during the computation.
- maximumIterator() - Method in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Create an iterator which returns only the maximum cliques of a graph.
- 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.
- maxIterations - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
- maxIterations - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering
- maxIterations - Variable in class org.jgrapht.alg.scoring.PageRank
-
Maximum iterations to run
- maxLevel - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- maxLevel - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- maxNodeId - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- maxSize - Variable in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Size of biggest maximal clique found.
- maxTopoIndex - Variable in class org.jgrapht.graph.DirectedAcyclicGraph
- MCS - Enum constant in enum class org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
- MedianGreedyTwoLayeredBipartiteLayout2D<V,
E> - Class in org.jgrapht.alg.drawing -
The median heuristic greedy algorithm for edge crossing minimization in two layered bipartite layouts.
- MedianGreedyTwoLayeredBipartiteLayout2D() - Constructor for class org.jgrapht.alg.drawing.MedianGreedyTwoLayeredBipartiteLayout2D
-
Create a new layout
- MedianGreedyTwoLayeredBipartiteLayout2D(Set<V>, Comparator<V>, boolean) - Constructor for class org.jgrapht.alg.drawing.MedianGreedyTwoLayeredBipartiteLayout2D
-
Create a new layout
- memo - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Map for memoization
- memo(int, int, double[][], double[][]) - Method in class org.jgrapht.alg.tour.HeldKarpTSP
- meo - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Minimal elimination ordering on the vertices of graph
- merge(AVLTree.TreeNode<T>, AVLTree.TreeNode<T>, AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Merges the
left
andright
subtrees using thejunctionNode
. - mergeAfter(AVLTree<T>) - Method in class org.jgrapht.util.AVLTree
-
Append the nodes in the
tree
after the nodes in this tree. - mergeBefore(AVLTree<T>) - Method in class org.jgrapht.util.AVLTree
-
Prepends the nodes in the
tree
before the nodes in this tree. - mergeBiconnectedComponent() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Merges the last two biconnected components using the info stored on top of the stack.
- mergeChildEdges(DoublyLinkedList<BoyerMyrvoldPlanarityInspector.Edge>, int, int, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Edge) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Merges the embedded edges of the child component root into this node's embedded edges.
- MergeInfo(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, int, int) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
Creates new instance of the infromation needed to merge to biconnected components
- mergePaths(GraphPath<V, E>, GraphPath<V, E>, GraphPath<V, E>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Computes a path which consists of
first
,second
andthird
paths. - mergeVertices(Set<V>, Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Merges vertex $t$ into vertex $s$, summing the weights as required.
- metadata - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- Metadata() - Constructor for class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- min(V, V) - Method in class org.jgrapht.graph.guava.ElementOrder
-
Get the minimum of two elements.
- MIN - Static variable in interface org.jgrapht.util.WeightCombiner
-
Minimum weight.
- minCap - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- minCap - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- minColorDegree - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
mapping from color to its minimum color degree
- minCost - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- minCost - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- minCostImprovement - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- 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
- minDegree - Variable in class org.jgrapht.traverse.DegeneracyOrderingIterator
- minDegreeOne - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- minDegreeTwo - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- minEdgeWeight - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Minimum edge weight in the graph
- minimal(int[], boolean[], boolean[]) - Static method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Assures given column-n-rows-coverage/zero-matching to be minimal/maximal
- minimalSeparatorsWithMultiplicities - Variable in class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
A mapping of minimal separators to their multiplicities
- MINIMIZE - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
- minimizeCycle(List<V>) - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Minimizes the cycle represented by the list
cycle
. - minimizeCycle(Graph<V, E>, List<V>, V, V, V, V) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Minimizes the
cycle
so that it contains a hole in thegraph
. - minimumCostFlow - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Computed minimum cost flow
- 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
- MinimumCostFlowProblemImpl(Graph<V, E>, Function<V, Integer>, Function<E, Integer>, Function<E, Integer>, Function<E, Double>) - 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.
- minimumCutWeight - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
- MinimumCycleMeanAlgorithm<V,
E> - Interface in org.jgrapht.alg.interfaces -
The algorithm for finding minimum cycle mean in a graph.
- minimumSTCutAlgorithm - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- minimumSTCutAlgorithm - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- MinimumSTCutAlgorithm<V,
E> - Interface in org.jgrapht.alg.interfaces -
Given a weighted graph $G(V,E)$ (directed or undirected).
- minSTCutAlg - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- minTopoIndex - Variable in class org.jgrapht.graph.DirectedAcyclicGraph
- minToTreeMap - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Mapping from tree minimums to the trees they're stored in.
- MINUS - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.Label
-
The node is on an odd layer in the tree (root has layer 0)
- minusBlossoms - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
The heap of "-" blossoms of this tree
- 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.
- MIXED_GRAPH_NOT_SUPPORTED - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- möbiusKantorGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Möbius-Kantor Graph.
- mod(int, int) - Method in class org.jgrapht.generate.NamedGraphGenerator
- modCount - Variable in class org.jgrapht.util.AVLTree
-
Modification tracker
- mode - Variable in class org.jgrapht.generate.WindmillGraphsGenerator
- Mode() - Constructor for enum class org.jgrapht.generate.WindmillGraphsGenerator.Mode
- model - Variable in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- modeNames - Static variable in class org.jgrapht.io.CSVLexer
- modeNames - Static variable in class org.jgrapht.io.DOTLexer
- modeNames - Static variable in class org.jgrapht.io.GmlLexer
- modeNames - Static variable in class org.jgrapht.io.JsonLexer
- modeNames - Static variable in class org.jgrapht.nio.csv.CSVLexer
- modeNames - Static variable in class org.jgrapht.nio.dot.DOTLexer
- modeNames - Static variable in class org.jgrapht.nio.gml.GmlLexer
- modeNames - Static variable in class org.jgrapht.nio.json.JsonLexer
- modifiable - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- modifiable - Variable in class org.jgrapht.graph.DefaultGraphType
- 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. - modified() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
If the backing set is modified, call this method to let this set knows the backing set's copy need to update.
- modularity(List<Set<V>>) - Method in class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
-
Compute the modularity of a vertex partition.
- moserSpindleGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- moveAllListNodes(DoublyLinkedList<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Atomically moves all
ListNodes
fromlist
to this list as if each node was removed withDoublyLinkedList.removeListNode(ListNodeImpl)
fromlist
and subsequently added to this list byDoublyLinkedList.addListNode(ListNodeImpl)
. - moveChildrenTo(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Appends the child list of this node to the beginning of the child list of the
blossom
. - moveEdgeTail(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Moves the tail of the
edge
from the nodefrom
to the nodeto
- 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 - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
- MULTIPLE_TREE_FIXED_DELTA - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
- multipleEdges - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- multipleEdges - Variable in class org.jgrapht.graph.DefaultGraphType
- multipleTreeFixedDelta() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Updates duals by iterating through trees and greedily increasing their dual variables.
- MutableDoubleValueGraphAdapter<V> - Class in org.jgrapht.graph.guava
-
A graph adapter class using Guava's
MutableValueGraph
specialized with double values. - MutableDoubleValueGraphAdapter(MutableValueGraph<V, Double>) - Constructor for class org.jgrapht.graph.guava.MutableDoubleValueGraphAdapter
-
Create a new adapter.
- MutableDoubleValueGraphAdapter(MutableValueGraph<V, Double>, Supplier<V>, Supplier<EndpointPair<V>>) - Constructor for class org.jgrapht.graph.guava.MutableDoubleValueGraphAdapter
-
Create a new adapter.
- MutableGraphAdapter<V> - Class in org.jgrapht.graph.guava
-
A graph adapter class using Guava's
MutableGraph
. - MutableGraphAdapter(MutableGraph<V>) - Constructor for class org.jgrapht.graph.guava.MutableGraphAdapter
-
Create a new adapter.
- MutableGraphAdapter(MutableGraph<V>, Supplier<V>, Supplier<EndpointPair<V>>) - Constructor for class org.jgrapht.graph.guava.MutableGraphAdapter
-
Create a new adapter.
- MutableGraphAdapter(MutableGraph<V>, Supplier<V>, Supplier<EndpointPair<V>>, ElementOrderMethod<V>) - Constructor for class org.jgrapht.graph.guava.MutableGraphAdapter
-
Create a new adapter.
- MutableNetworkAdapter<V,
E> - Class in org.jgrapht.graph.guava -
A graph adapter class using Guava's
MutableNetwork
. - MutableNetworkAdapter(MutableNetwork<V, E>) - Constructor for class org.jgrapht.graph.guava.MutableNetworkAdapter
-
Create a new network adapter.
- MutableNetworkAdapter(MutableNetwork<V, E>, Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.guava.MutableNetworkAdapter
-
Create a new network adapter.
- MutableNetworkAdapter(MutableNetwork<V, E>, Supplier<V>, Supplier<E>, ElementOrderMethod<V>) - Constructor for class org.jgrapht.graph.guava.MutableNetworkAdapter
-
Create a new network adapter.
- MutableValueGraphAdapter<V,
W> - Class in org.jgrapht.graph.guava -
A graph adapter class using Guava's
MutableValueGraph
. - MutableValueGraphAdapter(MutableValueGraph<V, W>, W, ToDoubleFunction<W>) - Constructor for class org.jgrapht.graph.guava.MutableValueGraphAdapter
-
Create a new adapter.
- MutableValueGraphAdapter(MutableValueGraph<V, W>, W, ToDoubleFunction<W>, Supplier<V>, Supplier<EndpointPair<V>>) - Constructor for class org.jgrapht.graph.guava.MutableValueGraphAdapter
-
Create a new adapter.
- MutableValueGraphAdapter(MutableValueGraph<V, W>, W, ToDoubleFunction<W>, Supplier<V>, Supplier<EndpointPair<V>>, ElementOrderMethod<V>) - Constructor for class org.jgrapht.graph.guava.MutableValueGraphAdapter
-
Create a new adapter.
- MyTraversalListener() - Constructor for class org.jgrapht.alg.connectivity.ConnectivityInspector.MyTraversalListener
N
- n - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Vertex number
- n - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- n - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- n - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Number of vertices in the network
- n - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- n - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The number of vertices in the
graph
- n - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- n - Variable in class org.jgrapht.alg.util.FixedSizeIntegerQueue
- n - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Number of vertices in the graph
- n - Variable in class org.jgrapht.generate.BarabasiAlbertForestGenerator
- n - Variable in class org.jgrapht.generate.BarabasiAlbertGraphGenerator
- n - Variable in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
- n - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- n - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
- n - Variable in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
- n - Variable in class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
- n - Variable in class org.jgrapht.generate.PruferTreeGenerator
- n - Variable in class org.jgrapht.generate.RandomRegularGraphGenerator
- n - Variable in class org.jgrapht.generate.WattsStrogatzGraphGenerator
- n - Variable in class org.jgrapht.generate.WindmillGraphsGenerator
- n - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- n - Variable in class org.jgrapht.opt.graph.sparse.specifics.CompleteIntegerSet
- n - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- n - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- n - Variable in class org.jgrapht.sux4j.AbstractSuccinctGraph
-
The number of vertices in the graph.
- n - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- n - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- n - Variable in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
-
The number of nodes of
AbstractImmutableBigGraphAdapter.immutableGraph
. - n - Variable in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
-
The number of nodes of
AbstractImmutableGraphAdapter.immutableGraph
. - n(Graph<V, E>, V, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
N(a,b) is the set of all {a,b}-complete vertices
- n1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- n1 - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
- n1 - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
- n2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- n2 - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
- n2 - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
- naiveCountTriangles(Graph<V, E>, List<V>) - Static method in class org.jgrapht.GraphMetrics
-
An $O(|V|^3)$ (assuming vertexSubset provides constant time indexing) naive implementation for counting non-trivial triangles in an undirected graph induced by the subset of vertices.
- 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.
- name - Variable in enum class org.jgrapht.nio.AttributeType
- name - Variable in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- name - Variable in enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
- name - Variable in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- name - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- name(int) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
-
Name the representative of the group where e belongs as e.
- NAME - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- 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
- nanos - Variable in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Timeout in nanoseconds
- natural() - Static method in class org.jgrapht.graph.guava.ElementOrder
-
Create an element order with the natural ordering
- natural() - Static method in class org.jgrapht.graph.guava.ElementOrderMethod
-
Get the natural ordering method
- NATURAL - Enum constant in enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
-
Natural ordering.
- nauruGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- nCycles - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- NE - Static variable in class org.jgrapht.alg.drawing.FRQuadTree
- nearestCommonAncestor(int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Computes the base of the blossom formed by bridge edge $(v,w)$.
- 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 - NearestInsertionHeuristicTSP.Closest<V> - Class in org.jgrapht.alg.tour
-
Class holding data for the closest unvisited vertex to a particular vertex in the tour.
- 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(Iterable<V>) - Constructor for class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
-
Constructor
- NearestNeighborHeuristicTSP(Iterable<V>, Random) - 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$.
- NEGATIVE_EDGE_WEIGHT_NOT_ALLOWED - Static variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Error message for reporting the existence of an edge with negative weight.
- NegativeCycleDetectedException - Exception Class in org.jgrapht.alg.shortestpath
-
An exception used to notify about the detection of a negative cycle.
- NegativeCycleDetectedException() - Constructor for exception class org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Constructs a new exception with
null
as its detail message. - NegativeCycleDetectedException(String) - Constructor for exception class org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Constructs a new exception with the specified detail message.
- NegativeCycleDetectedException(String, GraphPath<?, ?>) - Constructor for exception class org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Constructs a new exception with the specified detail message.
- neighborCache - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Neighbor cache TODO JK: It might be worth trying to replace the neighbors index by a bitset view.
- 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
- NeighborCache.Neighbors<V> - Class in org.jgrapht.alg.util
-
Stores cached neighbors for a single vertex.
- neighborCounts - Variable in class org.jgrapht.alg.util.NeighborCache.Neighbors
- neighborhoodSetOf(Graph<V, E>, E) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Returns a set of vertices that are neighbors of the source of the specified edge or of the target of specified edge.
- 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.color.BrownBacktrackColoring
- neighbors - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- neighbors - Variable in class org.jgrapht.alg.util.NeighborCache
- neighbors - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Map of neighbors, and a count of the number of edges to this neighbor
- Neighbors(Collection<V>) - Constructor for class org.jgrapht.alg.util.NeighborCache.Neighbors
- neighborSet - Variable in class org.jgrapht.alg.util.NeighborCache.Neighbors
- 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.GusfieldGomoryHuCutTree
- network - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- network - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
- network - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- NetworkGenerator<V,
E> - Class in org.jgrapht.generate.netgen -
NETGEN-style network generator.
- NetworkGenerator(NetworkGeneratorConfig) - Constructor for class org.jgrapht.generate.netgen.NetworkGenerator
-
Creates a new network generator using specified
config
. - NetworkGenerator(NetworkGeneratorConfig, long) - Constructor for class org.jgrapht.generate.netgen.NetworkGenerator
-
Creates a new network generator using specified
config
andseed
. - NetworkGenerator(NetworkGeneratorConfig, Random) - Constructor for class org.jgrapht.generate.netgen.NetworkGenerator
-
Creates a new network generator using specified
config
and random number generatorrng
. - NetworkGenerator.Node - Class in org.jgrapht.generate.netgen
-
Internal representation of network nodes.
- NetworkGenerator.NodeType - Enum Class in org.jgrapht.generate.netgen
-
Enum specifying the nodes type.
- NetworkGeneratorConfig - Class in org.jgrapht.generate.netgen
-
Configuration class to specify network parameters for the
NetworkGenerator
. - NetworkGeneratorConfig(int, int, int, int, int, int, int, int, int, int, int, int, int) - Constructor for class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Constructs a new
NetworkGeneratorConfig
- NetworkGeneratorConfigBuilder - Class in org.jgrapht.generate.netgen
-
Builder class for the
NetworkGeneratorConfig
. - NetworkGeneratorConfigBuilder() - Constructor for class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- networkInfo - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Network structure information obtained during generation process.
- NetworkInfo<V,
E> - Class in org.jgrapht.generate.netgen -
Represents network auxiliary information.
- NetworkInfo(NetworkGeneratorConfig) - Constructor for class org.jgrapht.generate.netgen.NetworkInfo
-
Creates a new network information instance.
- 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 - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
The next arc.
- next - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
A two-element array of references to the next elements in the circular doubly linked lists of edges.
- next - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
A two-element array of references to the next elements in the circular doubly linked lists of tree edges.
- next - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- next - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- next - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Reference of the bucket with lexicographically smaller label.
- next - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
- next - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
ListNode this iterator will return next.
- next() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- next() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
- next() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
- next() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
- next() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
- next() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
- next() - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- 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.graph.DirectedAcyclicGraph.TopoIterator
- next() - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix.NonZerosIterator
- 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.RandomWalkVertexIterator
- next() - Method in class org.jgrapht.traverse.TopologicalOrderIterator
- next() - Method in class org.jgrapht.util.AVLTree.TreeNodeIterator
- next() - Method in class org.jgrapht.util.AVLTree.TreeValuesIterator
- 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.ElementsSequenceGenerator
- next() - Method in class org.jgrapht.util.PrefetchIterator
- next() - Method in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- nextActiveVertex() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Returns the next active vertex to be processed.
- nextDir - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
-
Direction of the
nextEdge
- nextEdge - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.IncidentEdgeIterator
-
The edge that will be returned after the next call to
BlossomVNode.IncidentEdgeIterator.next()
. - 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. - nextFreeLabel - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
the next free label
- nextId - Variable in class org.jgrapht.graph.guava.ElementOrder
- nextId - Variable in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- nextId - Variable in class org.jgrapht.nio.IntegerIdProvider
- nextID - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Variable for debug purposes
- nextIndex - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- nextIndex - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
Index in this list of the ListNode returned next.
- nextIndex() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- nextIteration() - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Initializes a new algorithm iteration.
- nextLong() - Method in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeDegrees
- nextLong() - Method in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- nextLong() - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- nextLong() - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- nextMapping - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- nextNode - Variable in class org.jgrapht.util.AVLTree.TreeNodeIterator
-
A node that is returned next or
null
if all nodes are traversed - nextNode() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
Returns the next
DoublyLinkedList.ListNode
in the list and advances the cursor position. - nextNode() - Method in interface org.jgrapht.util.DoublyLinkedList.NodeIterator
-
Returns the next
DoublyLinkedList.ListNode
in the list and advances the cursor position. - nextOnOuterFace(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Returns a neighbor of this node which is not equal to the
prev
- nextPair() - Method in class org.jgrapht.alg.isomorphism.VF2State
-
calculates a pair of nodes which may be added to the current matching, according to the VF2 algorithm.
- nextScore - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- nextTree - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Next tree in the connected component, is used during updating the duals via connected components
- nextVertex - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- NIL - Static variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Special 'NIL' vertex.
- nListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- NO_EDGE_ADD - Static variable in class org.jgrapht.graph.AsUndirectedGraph
- NO_INCOMING - Static variable in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- NO_INCOMING_EDGES - Enum constant in enum class org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
-
No support for incoming edges
- NO_PERFECT_MATCHING - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Exception message if no perfect matching is possible
- 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
- NO_SUCH_EDGE_IN_BASE - Static variable in class org.jgrapht.graph.AsSubgraph
- NO_SUCH_VERTEX_IN_BASE - Static variable in class org.jgrapht.graph.AsSubgraph
- NO_VORONOI_CELL - Static variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Special Voronoi diagram cell id to indicate, that a vertex does not belong to any cells.
- NoCache() - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
- NoCopy() - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCopy
- noCycle(int, int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- node - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath.Label
- Node(int) - Constructor for class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Constructs a new node with
excess
- Node(int, double[]) - Constructor for class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
- Node(int, BoyerMyrvoldPlanarityInspector.Edge) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Creates a new component root.
- Node(Box2D) - Constructor for class org.jgrapht.alg.drawing.FRQuadTree.Node
-
Create a new node for a given area
- Node(T) - Constructor for class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Constructs a new node
- Node(V, int, int, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Edge) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Creates a new real node with the specified parameters.
- Node(V, int, BoyerMyrvoldPlanarityInspector.Edge, boolean) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Creates a new node with the specified parameters
- Node(V, NetworkGenerator.NodeType) - Constructor for class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
Creates a new node using
graphVertex
andtype
. - NODE - Enum constant in enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
- NODE - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.KeyTarget
- NODE - Enum constant in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- NODE - Static variable in class org.jgrapht.io.DOTLexer
- NODE - Static variable in class org.jgrapht.io.DOTParser
- NODE - Static variable in class org.jgrapht.nio.dot.DOTLexer
- NODE - Static variable in class org.jgrapht.nio.dot.DOTParser
- NODE - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- NODE - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- NODE - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- NODE - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- NODE() - Method in class org.jgrapht.io.DOTParser.AttributeStatementContext
- NODE() - Method in class org.jgrapht.nio.dot.DOTParser.AttributeStatementContext
- NODE_ATTRS - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- NODE_COORD_SECTION - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- NODE_COORD_TYPE - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- NODE_ID - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- NODE_ID - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- NODE_ID - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- nodeAttrs - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- nodeCoordType - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- nodeCount - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- nodeCountConsumer - Variable in class org.jgrapht.nio.dimacs.DIMACSImporter.Consumers
- nodeId - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- nodeId - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- nodeIdentifier() - Method in class org.jgrapht.io.DOTParser
- nodeIdentifier() - Method in class org.jgrapht.io.DOTParser.NodeStatementContext
- nodeIdentifier() - Method in class org.jgrapht.io.DOTParser.NodeStatementNoAttributesContext
- nodeIdentifier() - Method in class org.jgrapht.nio.dot.DOTParser
- nodeIdentifier() - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementContext
- nodeIdentifier() - Method in class org.jgrapht.nio.dot.DOTParser.NodeStatementNoAttributesContext
- NodeIdentifierContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.NodeIdentifierContext
- NodeIdentifierContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.NodeIdentifierContext
- nodeInHeap - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- nodeIterator() - Method in class org.jgrapht.util.AVLTree
-
Returns an iterator over the tree nodes rather than the node values.
- nodeLabels - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath
- nodeMap - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Mapping from the user specified values to the internal nodes they're represented by
- nodeNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Number of nodes in the graph
- nodeNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Number of nodes in the graph
- nodeNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- nodeNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- nodeOf(Object) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the first
node
holding the specifiedelement
in this list. - nodes - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Array of internal nodes used by the algorithm.
- nodes - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
An array of nodes that will be passed to the resulting state object
- nodes - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
An array of nodes of the graph.
- nodes - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- nodes - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
List of the vertices of the
graph
in their internal representation. - nodes - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- nodes - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
- nodes - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Network nodes stored in a list.
- nodes - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- nodesMap - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- nodesMap - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- nodesMap - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- nodeStatement() - Method in class org.jgrapht.io.DOTParser
- nodeStatement() - Method in class org.jgrapht.io.DOTParser.StatementContext
- nodeStatement() - Method in class org.jgrapht.nio.dot.DOTParser
- nodeStatement() - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- NodeStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.NodeStatementContext
- NodeStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.NodeStatementContext
- nodeStatementNoAttributes() - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- nodeStatementNoAttributes() - Method in class org.jgrapht.io.DOTParser
- nodeStatementNoAttributes() - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- nodeStatementNoAttributes() - Method in class org.jgrapht.nio.dot.DOTParser
- nodeStatementNoAttributes(int) - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- nodeStatementNoAttributes(int) - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- NodeStatementNoAttributesContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.NodeStatementNoAttributesContext
- NodeStatementNoAttributesContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.NodeStatementNoAttributesContext
- nodeSupplies - Variable in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
- NodeType() - Constructor for enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- nodeValidAttributes - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- nodeValidKeys - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- nodeValidKeys - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- NoIncomingNoReindexSparseDirectedSpecifics - Class in org.jgrapht.opt.graph.sparse.specifics
-
Specifics for a sparse directed graph which does not re-index the edges and does not support incoming edges.
- NoIncomingNoReindexSparseDirectedSpecifics(int, int, Supplier<Stream<Pair<Integer, Integer>>>) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
-
Create a new graph from an edge list.
- NONE - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer.Action
- NONE - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- nonZeros(int) - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
-
Get the number of non-zero entries of a row.
- NonZerosIterator(int) - Constructor for class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix.NonZerosIterator
- nonZerosPositionIterator(int) - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
-
Get an iterator over the non-zero entries of a row.
- nonZerosSet(int) - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
-
Get the position of non-zero entries of a row as a set.
- normalizationFactor - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- normalize - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Whether to normalize scores
- normalize - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality
-
Whether to normalize scores
- normalize - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Whether to normalize scores
- normalizeEdgeCosts - Variable in class org.jgrapht.alg.matching.GreedyWeightedMatching
- normalizeGraph() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- normalizeGraph() - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- normalizeGraph() - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- NotDirectedAcyclicGraphException - Exception Class in org.jgrapht.traverse
-
An exception to signal that
TopologicalOrderIterator
is used for a non-directed acyclic graph. - NotDirectedAcyclicGraphException() - Constructor for exception class org.jgrapht.traverse.NotDirectedAcyclicGraphException
- notifyAddition(V) - Method in class org.jgrapht.graph.guava.ElementOrder
-
Notify about a new element.
- notifyData() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- NotifyDOTListener() - Constructor for class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- notifyEdge(E) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for an edge.
- notifyEdgeAttribute(E, String, Attribute) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for an edge attribute
- notifyEdgeAttributesOutOfOrder - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter
- notifyEdgeAttributesOutOfOrder - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter
- notifyEdgeCount(Integer) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for the edge count.
- notifyEdgeWithAttributes(E, Map<String, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for an edge with attributes.
- NotifyGmlListener() - Constructor for class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- notifyGraphAttribute(String, Attribute) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for a graph attribute
- notifyImportEvent(ImportEvent) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for an importer ImportEvent
- notifyInterestedParties() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- NotifyJsonListener() - Constructor for class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- notifyListeners(V, Point2D) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
-
Notify all registered listeners.
- notifyRemoval(V) - Method in class org.jgrapht.graph.guava.ElementOrder
-
Notify about an element being removed.
- notifySingletons() - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- notifyVertex(V) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for a vertex.
- notifyVertexAttribute(V, String, Attribute) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for a vertex attribute
- notifyVertexAttributesOutOfOrder - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter
- notifyVertexAttributesOutOfOrder - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter
- notifyVertexCount(Integer) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for the vertex count.
- notifyVertexWithAttributes(V, Map<String, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Notify for a vertex with attributes.
- NULL - Enum constant in enum class org.jgrapht.nio.AttributeType
- NULL - Static variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- NULL - Static variable in class org.jgrapht.nio.DefaultAttribute
-
The null attribute.
- NULL_NODE - Static variable in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- NULL_NODE - Static variable in class org.jgrapht.alg.isomorphism.VF2State
- number - Variable in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector.VertexNumber
- number - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
-
The one based number of this node.
- NUMBER - Static variable in class org.jgrapht.io.GmlLexer
- NUMBER - Static variable in class org.jgrapht.io.GmlParser
- NUMBER - Static variable in class org.jgrapht.io.JsonLexer
- NUMBER - Static variable in class org.jgrapht.io.JsonParser
- NUMBER - Static variable in class org.jgrapht.nio.gml.GmlLexer
- NUMBER - Static variable in class org.jgrapht.nio.gml.GmlParser
- NUMBER - Static variable in class org.jgrapht.nio.json.JsonLexer
- NUMBER - Static variable in class org.jgrapht.nio.json.JsonParser
- NUMBER() - Method in class org.jgrapht.io.GmlParser.NumberKeyValueContext
- NUMBER() - Method in class org.jgrapht.io.JsonParser.ValueContext
- NUMBER() - Method in class org.jgrapht.nio.gml.GmlParser.NumberKeyValueContext
- NUMBER() - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- numberColors - Variable in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
- numberComponent - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- numberComponent - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- NumberKeyValueContext(GmlParser.KeyValuePairContext) - Constructor for class org.jgrapht.io.GmlParser.NumberKeyValueContext
- NumberKeyValueContext(GmlParser.KeyValuePairContext) - Constructor for class org.jgrapht.nio.gml.GmlParser.NumberKeyValueContext
- numberOfExpandedNodes - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- numberOfOperationsParameter - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
the number of the most profitable operations considered in the GRASP procedure for the initial solution.
- numberOfOperationsParameter - Variable in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
the number of the most profitable operations for every iteration considered in the procedure.
- numberOfPaths - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- numberOfPaths() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition
- numberOfSets() - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the number of sets.
- numberOfTransitVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Number of transit vertices in the graph.
- numberOfValidPathInQueue - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Stores number of valid candidates in
candidatePaths
. - Numeral - Static variable in class org.jgrapht.io.DOTLexer
- Numeral - Static variable in class org.jgrapht.io.DOTParser
- Numeral - Static variable in class org.jgrapht.nio.dot.DOTLexer
- Numeral - Static variable in class org.jgrapht.nio.dot.DOTParser
- Numeral() - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- Numeral() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- numOfBuckets - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Number of buckets in the bucket structure.
- nVertices - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- NW - Static variable in class org.jgrapht.alg.drawing.FRQuadTree
O
- obj() - Method in class org.jgrapht.io.JsonParser
- obj() - Method in class org.jgrapht.io.JsonParser.ValueContext
- obj() - Method in class org.jgrapht.nio.json.JsonParser
- obj() - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- ObjContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.JsonParser.ObjContext
- ObjContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.json.JsonParser.ObjContext
- OBJECT_SUPPLIER - Static variable in class org.jgrapht.util.SupplierUtil
-
Supplier for
Object
. - objectives - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath
- objectiveSense - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
The objective sense of the algorithm, i.e.
- objectiveSense - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
The objective sense of the algorithm, i.e.
- ObjectiveSense - Enum Class in org.jgrapht.alg.matching.blossom.v5
-
Enum specifying the objective sense of the algorithm.
- ObjectiveSense() - Constructor for enum class org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
- objectLevel - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- odd - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- ODD - Enum constant in enum class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm.Label
- oddSetCover - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
- oddVertices - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
- 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.
- of(Graph<V, ?>) - Static method in class org.jgrapht.alg.util.VertexDegreeComparator
-
Returns a
Comparator
that compares vertices by their degrees in the specified graph. - of(T, Graph<V, E>) - Static method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector.DistinctGraphObject
- 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
- openList - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
-
Open nodes of the frontier.
- operation - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- OperationType() - Constructor for enum class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
- operator - Variable in class org.jgrapht.graph.AsGraphUnion
- opposite(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
-
For a given vertex v and matched edge (v,w), this function returns vertex w.
- optimalDistance - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- options - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
BlossomVOptions used to determine the strategies used in the algorithm
- options - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
BlossomVOptions used by the algorithm to match the problem instance
- options - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
BlossomVOptions used by the algorithm to match the problem instance
- options - Variable in class org.jgrapht.nio.gexf.GEXFExporter.AttributeDetails
- order - Variable in class org.jgrapht.alg.cycle.ChordalityInspector
-
Order produced by
orderIterator
. - order - Variable in class org.jgrapht.alg.util.VertexDegreeComparator
-
Order in which the vertices are sorted: ascending or descending
- order - Variable in class org.jgrapht.generate.StarGraphGenerator
- Order() - Constructor for enum class org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Deprecated.
- orderedVertices - Variable in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
- ordering - Variable in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- ordering1 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- ordering1 - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- ordering2 - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- ordering2 - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- orderIterator - Variable in class org.jgrapht.alg.cycle.ChordalityInspector
-
Iterator used for producing perfect elimination order.
- orderSetsBySize() - Method in class org.jgrapht.util.UnmodifiableUnionSet
- 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.linkprediction - package org.jgrapht.alg.linkprediction
-
Algorithms for link prediction
- 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.similarity - package org.jgrapht.alg.similarity
-
Algorithms for computing graph similarity metrics.
- 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.core - module org.jgrapht.core
- 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.generate.netgen - package org.jgrapht.generate.netgen
-
Network generator components
- 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.guava - package org.jgrapht.graph.guava
- org.jgrapht.graph.specifics - package org.jgrapht.graph.specifics
-
Implementations of specifics for various graph types.
- org.jgrapht.guava - module org.jgrapht.guava
- org.jgrapht.io - module org.jgrapht.io
- org.jgrapht.io - package org.jgrapht.io
- org.jgrapht.nio - package org.jgrapht.nio
-
Importers/Exporters for various graph formats.
- org.jgrapht.nio.csv - package org.jgrapht.nio.csv
-
CSV importers/exporters
- org.jgrapht.nio.dimacs - package org.jgrapht.nio.dimacs
-
DIMACS Challenges importers/exporters
- org.jgrapht.nio.dot - package org.jgrapht.nio.dot
-
DOT importers/exporters
- org.jgrapht.nio.gexf - package org.jgrapht.nio.gexf
-
Graph Exchange XML Format (GEXF) importers/exporters.
- org.jgrapht.nio.gml - package org.jgrapht.nio.gml
-
GML importers/exporters
- org.jgrapht.nio.graph6 - package org.jgrapht.nio.graph6
-
Graph6, sparse6 and digraph6 importers/exporters
- org.jgrapht.nio.graphml - package org.jgrapht.nio.graphml
-
GraphML importers/exporters
- org.jgrapht.nio.json - package org.jgrapht.nio.json
-
Json importers/exporters
- org.jgrapht.nio.lemon - package org.jgrapht.nio.lemon
-
Lemon input/output.
- org.jgrapht.nio.matrix - package org.jgrapht.nio.matrix
-
Matrix input/output
- org.jgrapht.nio.tsplib - package org.jgrapht.nio.tsplib
-
TSPLIB95 importers/exporters
- org.jgrapht.opt - module org.jgrapht.opt
- org.jgrapht.opt.graph.fastutil - package org.jgrapht.opt.graph.fastutil
-
Specialized graph implementations using the FastUtil library
- org.jgrapht.opt.graph.sparse - package org.jgrapht.opt.graph.sparse
-
Specialized graph implementations using sparse matrix representations.
- org.jgrapht.opt.graph.sparse.specifics - package org.jgrapht.opt.graph.sparse.specifics
-
Implementations of different sparse graphs with different tradeoffs.
- org.jgrapht.sux4j - package org.jgrapht.sux4j
-
Immutable graphs stored using Sux4J's quasi-succinct data structures.
- org.jgrapht.traverse - package org.jgrapht.traverse
-
Graph traversal means.
- org.jgrapht.unimi.dsi - module org.jgrapht.unimi.dsi
- org.jgrapht.util - package org.jgrapht.util
-
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
- org.jgrapht.webgraph - package org.jgrapht.webgraph
-
Adapters for graphs stored using WebGraph's compressed and succinct formats.
- orient() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Iteratively start an orienting dfs from every
graph
vertex that hasn't been visited yet. - orientDfs(Map<V, BoyerMyrvoldPlanarityInspector.Node>, V, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Orients the input graph according to its dfs traversal by creating a dfs tree.
- OrientDfsStackInfo(V, V, E, boolean) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OrientDfsStackInfo
-
Creates new instance of the information stored on the stack during the orientation of the
graph
- origin - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
the origin vertex
- ORIGIN - Enum constant in enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
- originalEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionEdge
-
Number of original edges in
graph
this edge represents in the contraction hierarchy. - originalGraph - Variable in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
- originalToExtensionMap - Variable in class org.jgrapht.alg.util.extension.ExtensionManager
- originVertexLabel - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
dummy label of the origin vertex
- orphans - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
A list of orphans emerged after an s-t path augmentation.
- OUT - Enum constant in enum class org.jgrapht.generate.DirectedScaleFreeGraphGenerator.Direction
- out1 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- out2 - Variable in class org.jgrapht.alg.isomorphism.VF2State
- outDegree - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- outDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- outDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- outDegreeOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- outDegreeOf(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns the "out degree" of the specified vertex.
- outDegreeOf(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph
- outDegreeOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- outDegreeOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- outDegreeOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- outDegreeOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- outDegreeOf(Long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- outDegreeOf(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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.guava.BaseGraphAdapter
- outDegreeOf(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- outDegreeOf(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- outDegreeOf(V) - Method in interface org.jgrapht.GraphIterables
-
Returns the "out degree" of the specified vertex.
- outEdgesTotalWeight - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- OuterFaceCirculator(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
Creates a new instance of the circulator over the biconnected component boundary nodes.
- outerFaceNeighbors - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Two neighbors on the outer face of the biconnected component.
- outgoing - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
- outgoing - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
- outgoingEdges - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- outgoingEdgesMap - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheAccess
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- outgoingEdgesOf(Integer) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns a set of all edges outgoing from the specified vertex.
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- outgoingEdgesOf(Integer) - Method in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- outgoingEdgesOf(Long) - Method in class org.jgrapht.webgraph.ImmutableDirectedBigGraphAdapter
- outgoingEdgesOf(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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.CacheAccess
-
Get a set of all edges in AsSynchronizedGraph's backing graph outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Get a set of all edges in AsSynchronizedGraph's backing graph outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Get a set of all edges in AsSynchronizedGraph's backing graph outgoing from the specified vertex.
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCopy
-
Get a set of all edges in AsSynchronizedGraph's backing graph 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.guava.BaseGraphAdapter
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- outgoingEdgesOf(V) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- outgoingEdgesOf(V) - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable view over all edges outgoing into the specified vertex.
- outIncidenceMatrix - Variable in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
-
Incidence matrix with outgoing edges
- outputValue(PrintWriter, Attribute) - Method in class org.jgrapht.nio.json.JSONExporter
- overflowStrategy - Variable in class org.jgrapht.alg.clustering.GirvanNewmanClustering
- overflowStrategy - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality
-
Strategy for overflow when counting paths.
- overflowStrategy - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- OverflowStrategy() - Constructor for enum class org.jgrapht.alg.scoring.BetweennessCentrality.OverflowStrategy
- OverflowStrategy() - Constructor for enum class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.OverflowStrategy
P
- p - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- p - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- p - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
- p - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
- p - Variable in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
- p - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- p - Variable in class org.jgrapht.generate.WattsStrogatzGraphGenerator
- p(Graph<V, E>, GraphPath<V, E>, GraphPath<V, E>, V, V, V, V, V, V, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Assembles a GraphPath of the Paths S and T.
- PadbergRaoOddMinimumCutset<V,
E> - Class in org.jgrapht.alg.flow -
Implementation of the algorithm by Padberg and Rao to compute Odd Minimum Cut-Sets.
- PadbergRaoOddMinimumCutset(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
- PadbergRaoOddMinimumCutset(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
- PadbergRaoOddMinimumCutset(Graph<V, E>, MinimumSTCutAlgorithm<V, E>) - Constructor for class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.
- PageRank<V,
E> - Class in org.jgrapht.alg.scoring -
PageRank implementation.
- PageRank(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank(Graph<V, E>, double, int) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank(Graph<V, E>, double, int, double) - Constructor for class org.jgrapht.alg.scoring.PageRank
-
Create and execute an instance of PageRank.
- PageRank.Algorithm - Class in org.jgrapht.alg.scoring
-
The actual implementation.
- pair - Variable in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector.DistinctGraphObject
- pair() - Method in class org.jgrapht.io.JsonParser.ObjContext
- pair() - Method in class org.jgrapht.io.JsonParser
- pair() - Method in class org.jgrapht.nio.json.JsonParser.ObjContext
- pair() - Method in class org.jgrapht.nio.json.JsonParser
- pair(int) - Method in class org.jgrapht.io.JsonParser.ObjContext
- pair(int) - Method in class org.jgrapht.nio.json.JsonParser.ObjContext
- 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
- PairContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.JsonParser.PairContext
- PairContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.json.JsonParser.PairContext
- pairNames - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- 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
- pappusGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- parallelism - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Maximum number of threads used in the computations.
- parallelism - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Maximum number of threads used in the computations.
- parallelism - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Maximum number of threads used in the computations.
- parallelStream() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
Return a possibly parallel
Stream
with the backing set's unmodifiable copy as its source. - Parameter() - Constructor for enum class org.jgrapht.nio.csv.CSVFormat.Parameter
- Parameter() - Constructor for enum class org.jgrapht.nio.dimacs.DIMACSExporter.Parameter
- Parameter() - Constructor for enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
- Parameter() - Constructor for enum class org.jgrapht.nio.gml.GmlExporter.Parameter
- Parameter() - Constructor for enum class org.jgrapht.nio.lemon.LemonExporter.Parameter
- parameters - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter
- parameters - Variable in class org.jgrapht.nio.csv.CSVExporter
- parameters - Variable in class org.jgrapht.nio.csv.CSVImporter
- parameters - Variable in class org.jgrapht.nio.dimacs.DIMACSExporter
- parameters - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- parameters - Variable in class org.jgrapht.nio.gml.GmlExporter
- parameters - Variable in class org.jgrapht.nio.lemon.LemonExporter
- ParanoidGraph<V,
E> - Class in org.jgrapht.graph -
ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.
- ParanoidGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.ParanoidGraph
-
Create a new paranoid graph.
- parent - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- parent - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- parent - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item
- parent - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
The node current traversal descended from.
- parent - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OrientDfsStackInfo
-
The parent vertex of the
current
vertex, which is null for dfs tree roots - parent - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Parent of this node
- parent(int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Compute the nearest even ancestor of even node $v$.
- parentArc - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
An arc on the augmenting path which head is this node.
- parentEdge - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Edge to the tree parent.
- parentEdge - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
An edge to the parent node in the tree structure.
- parentEdge - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Edge to the parent node of this node in the dfs tree.
- parentEdge - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OrientDfsStackInfo
-
The edge connecting
parent
andcurrent
vertices - parentMap - Variable in class org.jgrapht.alg.util.UnionFind
- parentNext - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
The next node along the traversal of the parent biconnected component
- parse() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- parseInteger(String, String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- parseNode(String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- parseNumberAttribute(String) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- Parser(String) - Constructor for class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
-
Create a new parser.
- partialColorAssignment - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- partition - Variable in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
- partition - Variable in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- partition - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
the implicit partition defined by the subtrees
- partition1 - Variable in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
- partition1 - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- partition1 - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
- partition1 - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- partition1 - Variable in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
- partition2 - Variable in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
- partition2 - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- partition2 - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
- partition2 - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- partition2 - Variable in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
- partitionA - Variable in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
- partitionA - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
- partitionA - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
- partitionB - Variable in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
- partitionB - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
- partitionB - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
- partitionIndependentSet(int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Partitions vertices in
vertices
on the segment $[0,notContractedVerticesEnd)$ into correspondingly not independent and independent. - 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. - passes - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- path - Variable in class org.jgrapht.alg.cycle.CycleDetector.ProbeIterator
- path - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- path - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- path - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- path - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Pre-allocated array which stores augmenting paths.
- path - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex
-
Path between a vertex $v$ this access vertex is computed for and
vertex
. - path1 - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- path2 - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- PathDecompositionImpl(Graph<V, E>, Set<E>, List<List<V>>) - Constructor for class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
-
Construct a new path decomposition.
- pathExchangeVertexMapping - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
mapping from the pseudo vertices to the label of the subset they are representing
- 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.
- PathGrowingWeightedMatching.DynamicProgrammingPathSolver - Class in org.jgrapht.alg.matching
-
Helper class for repeatedly solving the maximum weight matching on paths.
- pathLimit - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- pathList - Variable in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
- paths - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- paths - Variable in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- 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
- pathSet - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- PathSetKey(V, V, Set<Integer>) - Constructor for class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey
-
Constructs a new PathSetKey object
- pathsGraphRoot - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Vertex of the paths graph from which the BFS traversal is started.
- PathsGraphVertex(E, double) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
- PathsGraphVertex(EppsteinShortestPathIterator.PathsGraphVertex) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
-
Copy constructor.
- pathsGraphVertices - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
-
Vertices of the paths graph this path corresponds to.
- pathsMap - Variable in class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths.DefaultManyToManyShortestPathsImpl
-
Map with paths between sources and targets.
- pathsMap - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.PathsUnpackingTask
-
Map where the unpacked paths will be stored.
- pathsQueue - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Priority queue of the paths generated during the computation.
- PathsUnpackingTask(int, List<V>, Map<V, Map<V, GraphPath<V, E>>>, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.PathsUnpackingTask
-
Constructs a new instance for the given
taskId
,transitVertices
,pathsMap
andshortestPaths
. - pathToTour(GraphPath<V, E>) - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Transform from a path representation to an array representation.
- pathValidator - Variable in class org.jgrapht.alg.shortestpath.AllDirectedPaths
-
Provides validation for the paths which will be computed.
- pathValidator - Variable in class org.jgrapht.alg.shortestpath.YenKShortestPath
-
Provides validation for the paths which will be computed.
- pathValidator - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Provides possibility to validate computed paths and exclude invalid ones.
- PathValidator<V,
E> - Interface in org.jgrapht.alg.shortestpath -
Path validator for shortest path algorithms.
- 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
- percentCapacitated - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- percentCapacitated - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- percentWithInfCost - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- percentWithInfCost - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- perfectMatching - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
The perfect matching algorithm used during for the problem reduction
- performLazyInspection() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- performPrecomputation() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
This method performs precomputation for this algorithm in the lazy fashion.
- pertinentRoots - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The roots of the pertinent components during the processing of the node $v$.
- petersenGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- PI - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- pickAVertex(Graph<V, E>, Set<V>, Set<E>, DirectedScaleFreeGraphGenerator.Direction, float) - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Select a vertex from the currently available vertices, using the passed bias.
- 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.
- planar - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Whether the graph is planar or not.
- 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.
- PLUS - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.Label
-
The node is on an even layer in the tree (root has layer 0)
- plusInfinityEdges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
The heap of (+, inf) edges of this tree
- plusMinusEdges0 - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
A heap of (-, +) cross-tree edges
- plusMinusEdges1 - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
A heap of (+, -) cross-tree edges
- plusPlusEdges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
The heap of (+,+) edges of this tree
- plusPlusEdges - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
A heap of (+, +) cross-tree edges
- 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.FRQuadTree.Node
- 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
- pointStack - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- policyGraph - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
For each vertex contains an edge, which together for the policy graph on current iteration.
- poll() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Poll the first element from the queue.
- poll() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Retrieves one vertex from this bucket.
- poll() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList
-
Retrieves element from the head bucket by invoking
LexBreadthFirstIterator.BucketList.Bucket.poll()
or null if thisBucketList
is empty. - 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
- populateLastHopMatrix() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Populate the last hop matrix, using the earlier computed backtrace matrix.
- port() - Method in class org.jgrapht.io.DOTParser.NodeIdentifierContext
- port() - Method in class org.jgrapht.io.DOTParser
- port() - Method in class org.jgrapht.nio.dot.DOTParser.NodeIdentifierContext
- port() - Method in class org.jgrapht.nio.dot.DOTParser
- PortContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.PortContext
- PortContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.PortContext
- pos - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
Position of this edge in the array
state.edges
. - pos - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Position of this node in the array
state.nodes
. - position - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- positionInPath - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- positionInPath - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- positiveDegreeColorClasses - Variable in class org.jgrapht.alg.color.ColorRefinementAlgorithm.ColoringRepresentation
-
mapping from color to their classes, whereby every vertex in the classes has colorDegree(v) >= 1
- pot - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- potential - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
The dual variable of this node.
- poussinGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- precision - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
Precision for arbitrary precision arithmetic.
- precomputeDegrees(Graph<V, E>) - Method in class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
-
Pre-compute vertex (weighted) degrees.
- precomputeToFromLandmark(V) - Method in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
-
Compute all distances to and from a landmark
- pred - Variable in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- pred - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- pred - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- pred - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- pred - Variable in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
- predecessor - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Previous node in the tree according to the in order traversal
- predecessor(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Returns the node, which is before the
node
in the order defined by this tree. - 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.
- predecessors - Variable in class org.jgrapht.alg.util.NeighborCache
- predecessors - Variable in class org.jgrapht.sux4j.SuccinctDirectedGraph
-
The cumulative list of predecessor lists.
- predecessors - Variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
The cumulative list of predecessor lists.
- predecessors - Variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
The cumulative list of predecessor (edges in reversed order, including loops) lists.
- predecessors - Variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
The cumulative list of predecessor (edges in reversed order, including loops) lists.
- 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.
- predict(List<Pair<V, V>>) - Method in interface org.jgrapht.alg.interfaces.LinkPredictionAlgorithm
-
Predict an edge between a set of vertex pairs.
- predict(V, V) - Method in interface org.jgrapht.alg.interfaces.LinkPredictionAlgorithm
-
Predict an edge between two vertices.
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.AdamicAdarIndexLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.CommonNeighborsLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.HubDepressedIndexLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.HubPromotedIndexLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.JaccardCoefficientLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.LeichtHolmeNewmanIndexLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.PreferentialAttachmentLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.ResourceAllocationIndexLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.SaltonIndexLinkPrediction
- predict(V, V) - Method in class org.jgrapht.alg.linkprediction.SørensenIndexLinkPrediction
- PreferentialAttachmentLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using Preferential Attachment.
- PreferentialAttachmentLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.PreferentialAttachmentLinkPrediction
-
Create a new prediction
- prefetch() - Method in class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- 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.
- prepareForDualSolution() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Sets the blossomGrandparent references so that from a pseudonode we can make one step down to some node that belongs to that pseudonode
- prepareId(String) - Method in class org.jgrapht.nio.lemon.LemonExporter
- prepend(DoublyLinkedList<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Prepends the
movedList
to the beginning of this list. - PREPROC - Static variable in class org.jgrapht.io.DOTLexer
- PREPROC - Static variable in class org.jgrapht.io.DOTParser
- PREPROC - Static variable in class org.jgrapht.nio.dot.DOTLexer
- PREPROC - Static variable in class org.jgrapht.nio.dot.DOTParser
- prev - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- prev - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- prev - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
The previous arc.
- prev - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
A two-element array of references to the previous elements in the circular doubly linked lists of edges.
- prev - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
A two-element array of references to the previous elements in the circular doubly linked lists of tree edges.
- prev - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
The previous node along the traversal of the component boundary.
- prev - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Reference of the bucket with lexicographically larger label.
- prev - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
- prevEdge - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.SearchInfo
-
The edge used to go to the
current
vertex - previous - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath.Label
- previous() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNodeIterator
- previousIndex() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- previousNode() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNodeIterator
-
Returns the previous
DoublyLinkedList.ListNode
in the list and moves the cursor position backwards. - previousNode() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
-
Returns the previous
DoublyLinkedList.ListNode
in the list and moves the cursor position backwards. - primalUpdater - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Instance of
BlossomVPrimalUpdater
for performing immediate augmentations after dual updates when they are applicable. - primalUpdater - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Performs primal operations (grow, augment, shrink and expand)
- 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.
- PrimMinimumSpanningTree.VertexInfo - Class in org.jgrapht.alg.spanning
- PRINT_CASES - Static variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Whether to print Kuratowski case distinction messages
- printBiconnectedComponent(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Method for debug purposes, prints the boundary the
node
belongs to - printBlossomNodes(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Prints
blossomNode
and all its blossom siblings. - printMap() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Debug method
- 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.
- printState() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Prints the state of the algorithm.
- printState() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Method for debug purposes, prints the state of the algorithm
- printTreeNodes() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Prints all the nodes of this tree
- printTrees() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Debug method
- priority - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
-
Priority of a vertex.
- prob - Variable in class org.jgrapht.alg.util.AliasMethodSampler
- ProbeIterator(Graph<V, E>, Set<V>, V) - Constructor for class org.jgrapht.alg.cycle.CycleDetector.ProbeIterator
- problem - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Specified minimum cost flow problem
- problem - Variable in enum class org.jgrapht.nio.dimacs.DIMACSFormat
- processMinusNodeGrow(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Processes a minus node in the grow operation.
- processPlusNodeGrow(BlossomVNode, boolean, boolean) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Processes a plus node during the grow operation.
- prototype - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- prototype - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
- provideNextVertex() - Method in class org.jgrapht.alg.cycle.CycleDetector.ProbeIterator
-
Returns the vertex to be returned in the following call to the iterator
next
method. - provideNextVertex() - Method in class org.jgrapht.traverse.BreadthFirstIterator
- provideNextVertex() - Method in class org.jgrapht.traverse.ClosestFirstIterator
- provideNextVertex() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Returns the vertex to be returned in the following call to the iterator
next
method. - provideNextVertex() - Method in class org.jgrapht.traverse.DepthFirstIterator
- 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
- PSEUDO - Enum constant in enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
- 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.
- pseudoVertexMapping - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
mapping from the label of the subsets to the corresponding vertex mapping
- PURE_SINK - Enum constant in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- PURE_SOURCE - Enum constant in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- push(E) - Method in class org.jgrapht.util.DoublyLinkedList
- push(MaximumFlowAlgorithmBase.AnnotatedFlowEdge) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- pushAllFlow(List<CapacityScalingMinimumCostFlow.Node>, Set<CapacityScalingMinimumCostFlow.Node>, int) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
For every node in the
positiveExcessNodes
pushes all flow away from it until its excess is less thandelta
. - pushDijkstra(CapacityScalingMinimumCostFlow.Node, Set<CapacityScalingMinimumCostFlow.Node>, int) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Runs the Dijkstra's algorithm in the residual network using
CapacityScalingMinimumCostFlow.Arc.getReducedCost()
as arc distances. - pushFlowThrough(MaximumFlowAlgorithmBase.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Increase flow in the direction denoted by edge $(u,v)$.
- pushFlowThrough(MaximumFlowAlgorithmBase.AnnotatedFlowEdge, double) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Push flow through an edge.
- PushRelabelDiagnostic() - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- PushRelabelMFImpl<V,
E> - Class in org.jgrapht.alg.flow -
Push-relabel maximum flow algorithm designed by Andrew V.
- PushRelabelMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Construct a new push-relabel algorithm.
- PushRelabelMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Construct a new push-relabel algorithm.
- PushRelabelMFImpl.PushRelabelDiagnostic - Class in org.jgrapht.alg.flow
- PushRelabelMFImpl.VertexExtension - Class in org.jgrapht.alg.flow
-
Vertex extension for the push-relabel algorithm, which contains an additional height.
- put(int, int) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- put(String, Attribute) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- 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
- putAll(Map<String, Attribute>) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- putSeenData(V, D) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Stores iterator-dependent data for a vertex that has been seen.
- putToNextBucket(Integer, Integer, List<Set<Integer>>, List<Integer>) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Moves the
vertex
to the next bucket. - 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
- q - Variable in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
- q - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- queries - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- queryOccurs - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- queue - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Queue of 'even' (exposed) vertices
- queue - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- queue - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- queue - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- queue - Variable in class org.jgrapht.traverse.BreadthFirstIterator
- queue - Variable in class org.jgrapht.traverse.TopologicalOrderIterator
- 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
- QueueEntry(V, E) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
- quoted(String) - Method in class org.jgrapht.nio.gml.GmlExporter
- quoted(String) - Method in class org.jgrapht.nio.json.JSONExporter
R
- r - Variable in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
- r(Graph<V, E>, Set<V>, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
r(a,b,c) is the cardinality of the largest anticomponent of N(a,b) that contains a nonneighbour of c (or 0, if c is N(a,b)-complete)
- radius - Variable in class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
- radius - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
- radius - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Radius of the search.
- radius - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- radius - Variable in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
- radius - Variable in class org.jgrapht.alg.shortestpath.GraphMeasurer
- radius - Variable in class org.jgrapht.traverse.ClosestFirstIterator
-
Maximum distance to search.
- radixSort(int[], int, int[], int[]) - Static method in class org.jgrapht.util.RadixSort
- RadixSort - Class in org.jgrapht.util
-
Sorts the specified list of integers into ascending order using the Radix Sort method.
- RadixSort() - Constructor for class org.jgrapht.util.RadixSort
- random - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
-
Random number used for tie breaking during computing independent set.
- 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
- RandomWalkVertexIterator<V,
E> - Class in org.jgrapht.traverse -
A random walk iterator.
- RandomWalkVertexIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.RandomWalkVertexIterator
-
Create a new iterator
- RandomWalkVertexIterator(Graph<V, E>, V, long) - Constructor for class org.jgrapht.traverse.RandomWalkVertexIterator
-
Create a new iterator
- RandomWalkVertexIterator(Graph<V, E>, V, long, boolean, Random) - Constructor for class org.jgrapht.traverse.RandomWalkVertexIterator
-
Create a new iterator
- rank - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item
- rankMap - Variable in class org.jgrapht.alg.util.UnionFind
- RatioVertex<V> - Class in org.jgrapht.alg.vertexcover.util
-
Helper class for vertex covers.
- RatioVertex(int, V, double) - Constructor for class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Create a new ratio vertex
- reach - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- reachableWithDegree(Graph<V, E>, V, int) - Static method in class org.jgrapht.GraphTests
-
Uses BFS to find all vertices of the
graph
which have a degreedegree
. - reachedVertices - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
For each vertex indicates, if it has been reached by a search during computing vertices distance in the policy graph.
- read(Reader, CSVBaseListener) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
- READ_ONLY - Static variable in class org.jgrapht.graph.AsGraphUnion
- readAttribute(JsonParser.ValueContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- readContentForGraph(Iterator<String>, Graph<V, E>) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- readContentForTour(Iterator<String>, Map<V, TSPLIBImporter.Node>) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- readGraph6() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- readIdentifier(JsonParser.ValueContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- readLine(BufferedReader) - Static method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- readNodeCoordinateSection(Iterator<String>, TSPLIBImporter.Metadata<V, E>) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Reads all nodes of the NODE_COORD_SECTION and fills the graph of the data accordingly.
- readNodeCount(BufferedReader) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- readNodes(Iterator<String>, int) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- readNumberOfVertices() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
-
Read the number of vertices in the graph
- readObject(ObjectInputStream) - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- readObject(ObjectInputStream) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- readObject(ObjectInputStream) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- readObject(ObjectInputStream) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- readObject(ObjectInputStream) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- readObject(ObjectInputStream) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- readResolve() - Method in class org.jgrapht.util.SupplierUtil.ConstructorSupplier.SerializedForm
- readSparse6() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
- readSpecificationSection(String, TSPLIBImporter.Specification, String[]) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- readString(JsonParser.ValueContext) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- readTourSection(Iterator<String>, Integer) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Reads a tour of the TOUR_SECTION and returns the List of ordered vertex numbers describing the tour.
- readWriteLock - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- readWriteLock - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
- recomputeHeightsHeuristic() - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- reconstructTour(List<V>, double[][], double[][]) - Method in class org.jgrapht.alg.tour.HeldKarpTSP
- record() - Method in class org.jgrapht.io.CSVParser.FileContext
- record() - Method in class org.jgrapht.io.CSVParser.HeaderContext
- record() - Method in class org.jgrapht.io.CSVParser
- record() - Method in class org.jgrapht.nio.csv.CSVParser.FileContext
- record() - Method in class org.jgrapht.nio.csv.CSVParser.HeaderContext
- record() - Method in class org.jgrapht.nio.csv.CSVParser
- record(int) - Method in class org.jgrapht.io.CSVParser.FileContext
- record(int) - Method in class org.jgrapht.nio.csv.CSVParser.FileContext
- RecordContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.CSVParser.RecordContext
- RecordContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.csv.CSVParser.RecordContext
- recordFinish() - Method in class org.jgrapht.traverse.DepthFirstIterator
- recoverEdge(E) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Restores edge
e
in theg
. - recoverVertex(V) - Method in class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Restores vertex
v
in theg
. - recursiveColor(int) - Method in class org.jgrapht.alg.color.BrownBacktrackColoring
- 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.
- reformatSeparatorList(List<Set<V>>, E) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Reformats the list o
separators
so that is can be conveniently used by this inspector. - region - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- Region(int, int) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Construct a new region.
- registerAttribute(String, GEXFExporter.AttributeCategory, GEXFAttributeType) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Register a GEXF Attribute
- registerAttribute(String, GEXFExporter.AttributeCategory, GEXFAttributeType, String) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Register a GEXF Attribute
- registerAttribute(String, GEXFExporter.AttributeCategory, GEXFAttributeType, String, String) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Register a GEXF Attribute
- registerAttribute(String, GraphMLExporter.AttributeCategory, AttributeType) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Register a GraphML-Attribute
- registerAttribute(String, GraphMLExporter.AttributeCategory, AttributeType, String) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Register a GraphML-Attribute
- registerChainArc(E) - Method in class org.jgrapht.generate.netgen.NetworkInfo
-
Saves information about the arc
chainArc
. - registeredAttributes - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
- registeredEdgeAttributes - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- registeredVertexAttributes - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- registerKey() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- registerModification() - Method in class org.jgrapht.util.AVLTree
-
Registers a modifying operation
- registerSkeletonArc(NetworkGenerator.Node, NetworkGenerator.Node) - Method in class org.jgrapht.generate.netgen.NetworkGenerator
-
Registers an arc between
tail
andhead
by decreasing one of the upper bounds by 1. - REGULAR - Static variable in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Key used to access the regular polygon vertices in the resultMap
- relabel(PushRelabelMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- relabelCounter - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- relabels - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- relabelsCounter - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl.PushRelabelDiagnostic
- relax(V, E, double) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Performs relaxation in parallel-safe fashion.
- relaxNode(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>>, AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, AddressableHeap.Handle<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>, ContractionHierarchyPrecomputation.ContractionVertex<V>, double, ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Relaxes outgoing edges of
vertex
ingraph
ignoring successors marked as independent andvertexToIgnore
. - reload(List<Set<Integer>>, List<Integer>, int) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Moves all vertices from the bucket with label
minLabel
to the bucket with label 0. - remainingVertices - Variable in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Number of unvisited vertices.
- remainingVertices - Variable in class org.jgrapht.traverse.TopologicalOrderIterator
- remove() - Method in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- remove() - Method in interface org.jgrapht.alg.scoring.ApBetweennessCentrality.MyQueue
- remove() - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.UnweightedQueue
- remove() - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- remove() - Method in interface org.jgrapht.alg.scoring.BetweennessCentrality.MyQueue
- remove() - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.UnweightedQueue
- remove() - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- remove() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- 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.ListNodeIteratorImpl
- 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.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- remove(Object) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- remove(T) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Removes the
element
from this data structure. - REMOVE - Enum constant in enum class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
-
Indicates that an edit operation is removing a vertex into a tree.
- removeAll(Collection<?>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- 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.
- removeArc(TreeDynamicConnectivity.Arc) - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Removes the
arc
from the arc list - removeCost - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Function which computes cost of removing a particular vertex from {2code tree1}.
- removed - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- removed - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- removedContractionEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexStatistics
-
Number of edges removed to the
contractionGraph
in case this vertex is contracted. - removedNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Number of expanded blossoms
- removedOriginalEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexStatistics
-
Sum of the complexities of edges removed from the
contractionGraph
in case this vertex is contracted. - removeEdge(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- removeEdge(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- removeEdge(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- removeEdge(EndpointPair<V>) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- 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.CacheAccess
-
Remove the specified edge from AsSynchronizedGraph's backing graph.
- removeEdge(E) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Remove the specified edge from AsSynchronizedGraph's backing graph.
- removeEdge(E) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Remove the specified edge from AsSynchronizedGraph's backing 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.guava.ImmutableNetworkAdapter
- removeEdge(E) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- removeEdge(E) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in interface org.jgrapht.Graph
-
Removes the specified edge from the graph.
- removeEdge(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Remove a vertex edge
- removeEdge(E) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- removeEdge(E) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- removeEdge(E) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- removeEdge(LongLongSortedPair) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- removeEdge(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- removeEdge(Integer, Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- removeEdge(Integer, Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- removeEdge(Integer, Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- removeEdge(Long, Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- removeEdge(Long, Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- removeEdge(BlossomVEdge, int) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Removes the
edge
from the linked list of edges incident to this node. - 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.CacheAccess
-
Remove an edge from AsSynchronizedGraph's backing graph.
- removeEdge(V, V) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Remove an edge from AsSynchronizedGraph's backing graph.
- removeEdge(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Remove an edge from AsSynchronizedGraph's backing 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.guava.ImmutableGraphAdapter
- removeEdge(V, V) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- removeEdge(V, V) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- removeEdge(V, V) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- removeEdge(V, V) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- removeEdge(V, V) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- 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.
- removeEdgeAttributeConsumer(BiConsumer<Pair<E, String>, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove an edge attribute consumer.
- removeEdgeAttributeConsumer(BiConsumer<Pair<E, String>, Attribute>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove an edge attribute consumer.
- removeEdgeConsumer(Consumer<E>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove an edge consumer.
- removeEdgeConsumer(Consumer<E>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove an edge consumer.
- removeEdgeCountConsumer(Consumer<Integer>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove an edge count consumer.
- removeEdgeCountConsumer(Consumer<Integer>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove an edge count consumer.
- 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.
- removeEdgeWithAttributesConsumer(BiConsumer<E, Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove an edge with attributes consumer
- removeEdgeWithAttributesConsumer(BiConsumer<E, Map<String, Attribute>>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove an edge with attributes consumer
- removeFirst() - Method in class org.jgrapht.util.DoublyLinkedList
- removeFirstOccurrence(Object) - Method in class org.jgrapht.util.DoublyLinkedList
- removeFromBucket(V) - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Removes
vertex
from the bucket it was contained in. - removeFromChildList() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
If this node is a tree root then this method removes this node from the tree root doubly linked list.
- removeFromCurrentMinusPlusHeap(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Removes
edge
from the current heap of (-, +) cross-tree edges. - removeFromCurrentPlusMinusHeap(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Removes
edge
from the current heap of (+, -) cross-tree edges. - removeFromHeap(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Removes "best edge" from
heap
- 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.
- removeFromPlusPlusHeap(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Removes
edge
from the heap of (+, +) cross-tree edges. - removeFromTreeEdgeList() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
-
Removes this edge from both doubly linked lists of tree edges.
- removeGraphAttributeConsumer(BiConsumer<String, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove a graph attribute consumer.
- removeGraphAttributeConsumer(BiConsumer<String, Attribute>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove a graph attribute consumer.
- 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.
- removeIf(Predicate<? super E>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- removeImportEventConsumer(Consumer<ImportEvent>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove an ImportEvent consumer.
- removeImportEventConsumer(Consumer<ImportEvent>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove an ImportEvent consumer.
- 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.
- removeListNode(DoublyLinkedList.ListNodeImpl<E>) - Method in class org.jgrapht.util.DoublyLinkedList
- removeMax() - Method in class org.jgrapht.util.AVLTree
-
Removes the maximum node in this tree.
- removeMin() - Method in class org.jgrapht.util.AVLTree
-
Removes the minimum node in this tree.
- removeMinusBlossom(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Removes the
blossom
from the heap of "-" blossoms - removeNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Remove a neighbor.
- removeNeighbor(V) - Method in class org.jgrapht.alg.util.NeighborCache.Neighbors
- 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.
- removePlusInfinityEdge(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Removes the
edge
from the heap of (+, inf) edges - removePlusPlusEdge(BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Removes the
edge
from the heap of (+, +) edges - removeSelf() - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Removes this bucket from the data structure.
- removeShortCircuitEdges() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
- 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.
- removeUp(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, int, Set<BoyerMyrvoldPlanarityInspector.Edge>) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Removes the edges from the outer face from the
start
node to theend
node in the directiondir
from the setedges
- removeVertex(Integer) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- removeVertex(Integer) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- removeVertex(Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- removeVertex(Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- removeVertex(Long) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- 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.CacheAccess
-
Remove the specified vertex from AsSynchronizedGraph's backing graph.
- removeVertex(V) - Method in interface org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheStrategy
-
Remove the specified vertex from AsSynchronizedGraph's backing graph.
- removeVertex(V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
-
Remove the specified vertex from AsSynchronizedGraph's backing 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.guava.ImmutableGraphAdapter
- removeVertex(V) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- removeVertex(V) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- removeVertex(V) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- removeVertex(V) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- removeVertex(V) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- removeVertex(V) - Method in class org.jgrapht.graph.MaskSubgraph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in interface org.jgrapht.Graph
-
Removes the specified vertex from this graph including all its touching edges if present.
- removeVertex(V) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Removes the
vertex
from this bucket. - 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.
- removeVertexAttributeConsumer(BiConsumer<Pair<V, String>, Attribute>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove a vertex attribute consumer.
- removeVertexAttributeConsumer(BiConsumer<Pair<V, String>, Attribute>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove a vertex attribute consumer.
- removeVertexConsumer(Consumer<V>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove a vertex consumer.
- removeVertexConsumer(Consumer<V>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove a vertex consumer.
- removeVertexCountConsumer(Consumer<Integer>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove a vertex count consumer.
- removeVertexCountConsumer(Consumer<Integer>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove a vertex count consumer.
- 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.
- removeVertexWithAttributesConsumer(BiConsumer<V, Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseEventDrivenImporter
-
Remove a vertex with attributes consumer
- removeVertexWithAttributesConsumer(BiConsumer<V, Map<String, Attribute>>) - Method in interface org.jgrapht.nio.EventDrivenImporter
-
Remove a vertex with attributes consumer
- 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.
- renderAttribute(PrintWriter, String, Attribute) - Method in class org.jgrapht.nio.dot.DOTExporter
- renderAttributes(PrintWriter, Map<String, Attribute>) - Method in class org.jgrapht.nio.dot.DOTExporter
- renumberVertices - Variable in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- renumberVertices(boolean) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
-
Set whether to renumber vertices or not.
- reorder(Set<V>, Set<V>, DirectedAcyclicGraph.VisitedStrategy) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
- rep - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item
- replaceShortcutEdges(Graph<V, E>, GraphPath<V, E>, Map<E, GraphPath<V, E>>) - Method in class org.jgrapht.alg.cycle.ChinesePostman
- representative - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- 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. - requireNotEmpty(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Checks that graph is not empty
- requireNotSet(Object, String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- requireSet(Object, String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- 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. - requireValidValue(String, List<String>, String) - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter
- 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. - RescaleLayoutAlgorithm2D<V,
E> - Class in org.jgrapht.alg.drawing -
A layout algorithm which re-scales vertex positions to (center-scale,center+scale) in all dimensions.
- RescaleLayoutAlgorithm2D(double) - Constructor for class org.jgrapht.alg.drawing.RescaleLayoutAlgorithm2D
-
Create a new layout algorithm
- reset() - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- reset() - Method in class org.jgrapht.alg.util.UnionFind
-
Resets the UnionFind data structure: each element is placed in its own singleton set.
- reset() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Resets this node to the default state
- resetAddVertexes() - Method in class org.jgrapht.alg.isomorphism.VF2State
- resetVertexData() - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
- residualCapacity - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
The residual capacity of this arc.
- resolvePaths(V, V) - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
-
At the end of the search we have list of intermediate paths - not necessarily disjoint and may contain reversed edges.
- ResourceAllocationIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Resource Allocation Index.
- ResourceAllocationIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.ResourceAllocationIndexLinkPrediction
-
Create a new prediction
- rest - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
- restoreOperationsList(List<List<ZhangShashaTreeEditDistance.CacheEntry>>, int, int) - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Restores list of edit operations which have been cached in
cachedOperations
during the edit distance computation. - result - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering
- result - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
-
Variable to determine whether currentEdge has been returned or not
- result - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
- resultList - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
List of the paths returned so far via the
YenShortestPathIterator.next()
method. - retainAll(Collection<?>) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- 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
- reuseableEdgeEvent - Variable in class org.jgrapht.graph.DefaultListenableGraph
- reuseableVertexEvent - Variable in class org.jgrapht.graph.DefaultListenableGraph
- reuseEvents - Variable in class org.jgrapht.graph.DefaultListenableGraph
- reuseEvents - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- revArc - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
The reverse counterpart of this arc.
- 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(int[], int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Utility function to reverse part of an array
- reverse(int[], int, int) - Static method in class org.jgrapht.util.ArrayUtil
-
Reverses the order of the elements in the specified range within the given array.
- reverse(Function<GraphWalk<V, E>, Double>) - Method in class org.jgrapht.graph.GraphWalk
-
Reverses the direction of the walk.
- reverse(V[], int, int) - Static method in class org.jgrapht.util.ArrayUtil
-
Reverses the order of the elements in the specified range within the given array.
- reverseBlossomSiblings(BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Reverses the direction of blossomSibling references
- 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. - reversed - Variable in class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl
-
Indicates is the search spaces were computed on the edge reversed graph.
- ReversedGraphHeuristic(AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ReversedGraphHeuristic
- reverseInCircle(V[], int, int) - Static method in class org.jgrapht.alg.tour.PalmerHamiltonianCycle
- reverseIterator(DoublyLinkedList.ListNodeIterator<E>) - Static method in class org.jgrapht.util.DoublyLinkedList
-
Returns a
DoublyLinkedList.NodeIterator
that iterates in reverse order, assuming the cursor of the specifiedDoublyLinkedList.ListNodeIterator
is behind the tail of the list. - reverseSortedEdgesOfNoLoops(int) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- reverseSortedEdgesOfNoLoops(int) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- revIndex - Variable in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
- right - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
- right - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Right child of this 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.
- rmq - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- rng - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
- rng - Variable in class org.jgrapht.alg.clustering.LabelPropagationClustering
- rng - Variable in class org.jgrapht.alg.color.RandomGreedyColoring
- rng - Variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
- rng - Variable in class org.jgrapht.alg.drawing.RandomLayoutAlgorithm2D
- rng - Variable in class org.jgrapht.alg.tour.NearestNeighborHeuristicTSP
- rng - Variable in class org.jgrapht.alg.tour.RandomTourTSP
- rng - Variable in class org.jgrapht.alg.util.AliasMethodSampler
- rng - Variable in class org.jgrapht.generate.BarabasiAlbertForestGenerator
- rng - Variable in class org.jgrapht.generate.BarabasiAlbertGraphGenerator
- rng - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
- rng - Variable in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
- rng - Variable in class org.jgrapht.generate.GnmRandomGraphGenerator
- rng - Variable in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
- rng - Variable in class org.jgrapht.generate.GnpRandomGraphGenerator
- rng - Variable in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
- rng - Variable in class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
- rng - Variable in class org.jgrapht.generate.netgen.Distributor
-
Random number generator used by this distributor.
- rng - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Random number generator used to create a network.
- rng - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- rng - Variable in class org.jgrapht.generate.PruferTreeGenerator
- rng - Variable in class org.jgrapht.generate.RandomRegularGraphGenerator
- rng - Variable in class org.jgrapht.generate.ScaleFreeGraphGenerator
- rng - Variable in class org.jgrapht.generate.WattsStrogatzGraphGenerator
- rng - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- rng - Variable in class org.jgrapht.util.ElementsSequenceGenerator
-
Random instance used by this generator.
- root - Variable in class org.jgrapht.alg.cycle.CycleDetector.ProbeIterator
- root - Variable in class org.jgrapht.alg.drawing.FRQuadTree
- root - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge.BlossomNodesIterator
-
Blossom's root
- root - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
The root of this tree
- root - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the designated root of the CMST.
- root1 - Variable in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- root1 - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Root vertex of the
tree1
. - root2 - Variable in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- root2 - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Root vertex of the
tree2
. - roots - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- roots - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- roots - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- roots - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- roots - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- roots1 - Variable in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- roots2 - Variable in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- rootVertex - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Whether this node is a root of the biconnected component or not.
- rotateLeft(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Performs a left node rotation.
- rotateRight(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Performs a right node rotation.
- routine1(Graph<V, E>, Set<V>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Checks whether a clean shortest odd hole is in g or whether X is a cleaner for an amenable shortest odd hole
- routine2(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
If true, the graph is not Berge.
- routine3(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Returns a set of vertex sets that may be near-cleaners for an amenable hole in g.
- row - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- RowCSVListener() - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- rowMatched - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
``rowMatched[j]'' is the row # of the ZERO matched at the $j$-th column
- rowOffsets - Variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
- rows - Variable in class org.jgrapht.generate.GridGraphGenerator
- rows() - Method in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
-
Get the number of rows of the matrix.
- rowsCovered - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Rows coverage bit-mask
- rowsVisited - Variable in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation.MatchExtender
- RRR - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- RULE_aList - Static variable in class org.jgrapht.io.DOTParser
- RULE_aList - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_array - Static variable in class org.jgrapht.io.JsonParser
- RULE_array - Static variable in class org.jgrapht.nio.json.JsonParser
- RULE_attributesList - Static variable in class org.jgrapht.io.DOTParser
- RULE_attributesList - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_attributeStatement - Static variable in class org.jgrapht.io.DOTParser
- RULE_attributeStatement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_compoundStatement - Static variable in class org.jgrapht.io.DOTParser
- RULE_compoundStatement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_edgeStatement - Static variable in class org.jgrapht.io.DOTParser
- RULE_edgeStatement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_field - Static variable in class org.jgrapht.io.CSVParser
- RULE_field - Static variable in class org.jgrapht.nio.csv.CSVParser
- RULE_file - Static variable in class org.jgrapht.io.CSVParser
- RULE_file - Static variable in class org.jgrapht.nio.csv.CSVParser
- RULE_gml - Static variable in class org.jgrapht.io.GmlParser
- RULE_gml - Static variable in class org.jgrapht.nio.gml.GmlParser
- RULE_graph - Static variable in class org.jgrapht.io.DOTParser
- RULE_graph - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_graphHeader - Static variable in class org.jgrapht.io.DOTParser
- RULE_graphHeader - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_graphIdentifier - Static variable in class org.jgrapht.io.DOTParser
- RULE_graphIdentifier - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_header - Static variable in class org.jgrapht.io.CSVParser
- RULE_header - Static variable in class org.jgrapht.nio.csv.CSVParser
- RULE_identifier - Static variable in class org.jgrapht.io.DOTParser
- RULE_identifier - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_identifierPair - Static variable in class org.jgrapht.io.DOTParser
- RULE_identifierPair - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_identifierPairStatement - Static variable in class org.jgrapht.io.DOTParser
- RULE_identifierPairStatement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_json - Static variable in class org.jgrapht.io.JsonParser
- RULE_json - Static variable in class org.jgrapht.nio.json.JsonParser
- RULE_keyValuePair - Static variable in class org.jgrapht.io.GmlParser
- RULE_keyValuePair - Static variable in class org.jgrapht.nio.gml.GmlParser
- RULE_nodeIdentifier - Static variable in class org.jgrapht.io.DOTParser
- RULE_nodeIdentifier - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_nodeStatement - Static variable in class org.jgrapht.io.DOTParser
- RULE_nodeStatement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_nodeStatementNoAttributes - Static variable in class org.jgrapht.io.DOTParser
- RULE_nodeStatementNoAttributes - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_obj - Static variable in class org.jgrapht.io.JsonParser
- RULE_obj - Static variable in class org.jgrapht.nio.json.JsonParser
- RULE_pair - Static variable in class org.jgrapht.io.JsonParser
- RULE_pair - Static variable in class org.jgrapht.nio.json.JsonParser
- RULE_port - Static variable in class org.jgrapht.io.DOTParser
- RULE_port - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_record - Static variable in class org.jgrapht.io.CSVParser
- RULE_record - Static variable in class org.jgrapht.nio.csv.CSVParser
- RULE_statement - Static variable in class org.jgrapht.io.DOTParser
- RULE_statement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_subgraphStatement - Static variable in class org.jgrapht.io.DOTParser
- RULE_subgraphStatement - Static variable in class org.jgrapht.nio.dot.DOTParser
- RULE_value - Static variable in class org.jgrapht.io.JsonParser
- RULE_value - Static variable in class org.jgrapht.nio.json.JsonParser
- ruleNames - Static variable in class org.jgrapht.io.CSVLexer
- ruleNames - Static variable in class org.jgrapht.io.CSVParser
- ruleNames - Static variable in class org.jgrapht.io.DOTLexer
- ruleNames - Static variable in class org.jgrapht.io.DOTParser
- ruleNames - Static variable in class org.jgrapht.io.GmlLexer
- ruleNames - Static variable in class org.jgrapht.io.GmlParser
- ruleNames - Static variable in class org.jgrapht.io.JsonLexer
- ruleNames - Static variable in class org.jgrapht.io.JsonParser
- ruleNames - Static variable in class org.jgrapht.nio.csv.CSVLexer
- ruleNames - Static variable in class org.jgrapht.nio.csv.CSVParser
- ruleNames - Static variable in class org.jgrapht.nio.dot.DOTLexer
- ruleNames - Static variable in class org.jgrapht.nio.dot.DOTParser
- ruleNames - Static variable in class org.jgrapht.nio.gml.GmlLexer
- ruleNames - Static variable in class org.jgrapht.nio.gml.GmlParser
- ruleNames - Static variable in class org.jgrapht.nio.json.JsonLexer
- ruleNames - Static variable in class org.jgrapht.nio.json.JsonParser
- run() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
- run() - Method in class org.jgrapht.alg.scoring.PageRank.Algorithm
- run() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
- run() - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.HeavyRelaxTask
-
Performs relaxation of edges emanating from
DeltaSteppingShortestPath.HeavyRelaxTask.vertices
. - run() - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.LightRelaxTask
-
Performs relaxation of edges emanating from
DeltaSteppingShortestPath.LightRelaxTask.vertices
. - run() - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Executes the actual algorithm.
- run() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
- run() - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.PathsUnpackingTask
- run() - Method in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
- run(double, ToDoubleFunction<V>, int, double) - Method in class org.jgrapht.alg.scoring.KatzCentrality
- run(int, double) - Method in class org.jgrapht.alg.scoring.EigenvectorCentrality
- runAlgorithm(V) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
-
Execute the main algorithm
- runInitializer() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- runSearch(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.ContractionHierarchyBFS
-
Runs a forward CH BFS query to calculate access vertices and ids of visited Voronoi cells.
- runWeighted() - Method in class org.jgrapht.alg.scoring.PageRank.Algorithm
- runWithHeuristics() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
- runWithNegativeEdgeWeights(Graph<V, E>) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Graph contains edges with negative weights.
- runWithPositiveEdgeWeights(Graph<V, E>) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Graph has no edges with negative weights.
S
- s - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- s - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- s - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- SaltonIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Salton Index, also called the cosine similarity.
- SaltonIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.SaltonIndexLinkPrediction
-
Create a new prediction
- saturation - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring.DSaturComparator
- 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.
- SaturationDegreeColoring.DSaturComparator - Class in org.jgrapht.alg.color
- SaturationDegreeColoring.Heap - Class in org.jgrapht.alg.color
- SaturationDegreeColoring.HeapHandle - Class in org.jgrapht.alg.color
- 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.
- scale - Variable in class org.jgrapht.alg.drawing.RescaleLayoutAlgorithm2D
- scale(int) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Performs a scaling phase by saturating all negative reduced cost arcs with residual capacity greater than or equal to the
delta
, so that they don't belong to the $\Delta$-residual network and, hence, don't violate optimality conditions. - 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
- scalingFactor - Variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Scaling factor of this algorithm
- SCHEMA_FILENAMES - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- schemaValidation - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- schemaValidation - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter
- schemaValidation - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- schemaValidation - Variable in class org.jgrapht.nio.graphml.GraphMLImporter
- schemaValidation - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
- schemaValidation - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
- schemaValidation - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
- schläfliGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Schläfli Graph.
- scores - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality
-
The actual scores
- scores - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality
-
The actual scores
- scores - Variable in class org.jgrapht.alg.scoring.ClosenessCentrality
-
The actual scores
- scores - Variable in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
The actual scores
- scores - Variable in class org.jgrapht.alg.scoring.Coreness
- scores - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.Algorithm
- scores - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- scores - Variable in class org.jgrapht.alg.scoring.EigenvectorCentrality
- scores - Variable in class org.jgrapht.alg.scoring.KatzCentrality
- scores - Variable in class org.jgrapht.alg.scoring.PageRank
-
The result
- SE - Static variable in class org.jgrapht.alg.drawing.FRQuadTree
- searchAndCloseGap(V[], int, Graph<V, E>) - Static method in class org.jgrapht.alg.tour.PalmerHamiltonianCycle
- searchEdge(BoyerMyrvoldPlanarityInspector.Node, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Searches a back edge which target has a height smaller than
heightMax
- searchEdge(BoyerMyrvoldPlanarityInspector.Node, int, BoyerMyrvoldPlanarityInspector.Edge) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Searches a back edge which target has a height smaller than
heightMax
- searchEdge(BoyerMyrvoldPlanarityInspector.Node, Predicate<BoyerMyrvoldPlanarityInspector.Edge>) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Generically searches an edge in the subtree rooted at the
current
, which doesn't include the children of thecurrent
that have beem merged to the parent biconnected component. - SearchInfo(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Edge, boolean) - Constructor for class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.SearchInfo
-
Creates a new search info
- searchNode(Supplier<DoublyLinkedList.ListNodeImpl<E>>, UnaryOperator<DoublyLinkedList.ListNodeImpl<E>>, Object) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns a
Pair
of the first encounteredDoublyLinkedList.ListNode
in this list, whosevalue
is equal to the givenelement
, and its index. - SearchNodeData(E, int) - Constructor for class org.jgrapht.traverse.BreadthFirstIterator.SearchNodeData
-
Constructor
- searchSpaces - Variable in class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths.DijkstraManyToManyShortestPathsImpl
-
Map from source vertices to corresponding single source shortest path trees.
- searchSubtreeDfs(BoyerMyrvoldPlanarityInspector.Node, Predicate<BoyerMyrvoldPlanarityInspector.Edge>) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Recursively searches all the subtree root at the node
start
to find an edge satisfying thepredicate
. - 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 - Variable in class org.jgrapht.util.UnmodifiableUnionSet
- 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.
- secondOperand - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Vertex of a tree which is a second operand of this operation.
- seen - Variable in class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- seen - Variable in class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- seen - Variable in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- seen - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- seen - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
For every vertex added to the
heap
stores a corresponding handle. - seen - Variable in class org.jgrapht.traverse.CrossComponentIterator
-
Stores the vertices that have been seen during iteration and (optionally) some additional traversal info regarding each vertex.
- segmentsEnd - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
End if the working segment in
vertices
exclusively. - segmentStart - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
Start if the working segment in
vertices
inclusively. - selectOnOuterFace(Predicate<BoyerMyrvoldPlanarityInspector.Node>, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Either finds and returns a circulator to the node on the boundary of the component, which satisfies the
predicate
or returns a circulator to thestop
node. - 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.
- selectTopKTransitVertices(int) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Selects top
numberOfTransitVertices
vertices in the contraction hierarchy as transit vertices. - 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.
- selfLoops - Variable in class org.jgrapht.generate.PlantedPartitionGraphGenerator
- selfLoops - Variable in class org.jgrapht.graph.DefaultGraphType
- sempred(RuleContext, int, int) - Method in class org.jgrapht.io.CSVLexer
- sempred(RuleContext, int, int) - Method in class org.jgrapht.nio.csv.CSVLexer
- sendFlow(int) - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
-
Sends
value units of flow across this arc
. - SENTINEL - Static variable in class org.jgrapht.traverse.DepthFirstIterator
-
Sentinel object.
- sep - Variable in class org.jgrapht.io.CSVLexer
- sep - Variable in class org.jgrapht.nio.csv.CSVLexer
- separatedDfsChildList - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The list containing the dfs children of this node, which are in the different child biconnected component, i.e.
- SEPARATOR - Static variable in class org.jgrapht.io.CSVLexer
- SEPARATOR - Static variable in class org.jgrapht.io.CSVParser
- SEPARATOR - Static variable in class org.jgrapht.nio.csv.CSVLexer
- SEPARATOR - Static variable in class org.jgrapht.nio.csv.CSVParser
- SEPARATOR() - Method in class org.jgrapht.io.CSVParser.RecordContext
- SEPARATOR() - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- SEPARATOR(int) - Method in class org.jgrapht.io.CSVParser.RecordContext
- SEPARATOR(int) - Method in class org.jgrapht.nio.csv.CSVParser.RecordContext
- SEPARATOR_sempred(RuleContext, int) - Method in class org.jgrapht.io.CSVLexer
- SEPARATOR_sempred(RuleContext, int) - Method in class org.jgrapht.nio.csv.CSVLexer
- separators - Variable in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Set of clique minimal separators
- SerializedForm(Class<T>) - Constructor for class org.jgrapht.util.SupplierUtil.ConstructorSupplier.SerializedForm
- serialVersionUID - Static variable in class org.jgrapht.alg.connectivity.BlockCutpointGraph
- serialVersionUID - Static variable in exception class org.jgrapht.alg.cycle.CycleDetector.CycleDetectedException
- serialVersionUID - Static variable in class org.jgrapht.alg.drawing.model.Box2D
- serialVersionUID - Static variable in class org.jgrapht.alg.drawing.model.Point2D
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.CliqueAlgorithm.CliqueImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.IndependentSetAlgorithm.IndependentSetImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.SpannerAlgorithm.SpannerImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.VertexColoringAlgorithm.ColoringImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.interfaces.VertexCoverAlgorithm.VertexCoverImpl
- serialVersionUID - Static variable in exception class org.jgrapht.alg.isomorphism.IsomorphismUndecidableException
- serialVersionUID - Static variable in exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
- serialVersionUID - Static variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
- serialVersionUID - Static variable in exception class org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
- serialVersionUID - Static variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
- serialVersionUID - Static variable in class org.jgrapht.alg.util.Pair
- serialVersionUID - Static variable in class org.jgrapht.alg.util.ToleranceDoubleComparator
- serialVersionUID - Static variable in class org.jgrapht.alg.util.Triple
- serialVersionUID - Static variable in class org.jgrapht.alg.util.UnorderedPair
- serialVersionUID - Static variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
- serialVersionUID - Static variable in class org.jgrapht.event.EdgeTraversalEvent
- serialVersionUID - Static variable in class org.jgrapht.event.GraphChangeEvent
- serialVersionUID - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
- serialVersionUID - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
- serialVersionUID - Static variable in class org.jgrapht.event.VertexTraversalEvent
- serialVersionUID - Static variable in exception class org.jgrapht.generate.TooManyFailuresException
-
Serial Version ID
- serialVersionUID - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.AsGraphUnion
- serialVersionUID - Static variable in class org.jgrapht.graph.AsSubgraph.BaseGraphListener
- serialVersionUID - Static variable in class org.jgrapht.graph.AsSubgraph
- serialVersionUID - Static variable in class org.jgrapht.graph.AsUndirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.AsUnmodifiableGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.AsUnweightedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.AsWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CacheAccess
- serialVersionUID - Static variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- serialVersionUID - Static variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCache
- serialVersionUID - Static variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.NoCopy
- serialVersionUID - Static variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultDirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultDirectedWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultEdge
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultEdgeFunction
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultGraphSpecificsStrategy
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultGraphType
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultListenableGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultUndirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultUndirectedWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DefaultWeightedEdge
- serialVersionUID - Static variable in exception class org.jgrapht.graph.DirectedAcyclicGraph.CycleFoundException
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.Region
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoComparator
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedMultigraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedPseudograph
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedWeightedMultigraph
- serialVersionUID - Static variable in class org.jgrapht.graph.DirectedWeightedPseudograph
- serialVersionUID - Static variable in class org.jgrapht.graph.EdgeReversedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.FastLookupGraphSpecificsStrategy
- serialVersionUID - Static variable in exception class org.jgrapht.graph.GraphCycleProhibitedException
- serialVersionUID - Static variable in class org.jgrapht.graph.GraphDelegator
- serialVersionUID - Static variable in class org.jgrapht.graph.GraphWalk
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.ElementOrder
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.ElementOrderMethod
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.ImmutableDoubleValueGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.MutableDoubleValueGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.MutableGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.MutableNetworkAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- serialVersionUID - Static variable in class org.jgrapht.graph.IntrusiveEdge
- serialVersionUID - Static variable in exception class org.jgrapht.graph.IntrusiveEdgeException
- serialVersionUID - Static variable in class org.jgrapht.graph.IntrusiveWeightedEdge
- serialVersionUID - Static variable in exception class org.jgrapht.graph.InvalidGraphWalkException
- serialVersionUID - Static variable in class org.jgrapht.graph.MaskEdgeSet
- serialVersionUID - Static variable in class org.jgrapht.graph.MaskSubgraph
- serialVersionUID - Static variable in class org.jgrapht.graph.MaskVertexSet
- serialVersionUID - Static variable in class org.jgrapht.graph.Multigraph
- serialVersionUID - Static variable in class org.jgrapht.graph.ParanoidGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.Pseudograph
- serialVersionUID - Static variable in class org.jgrapht.graph.SimpleDirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.SimpleDirectedWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.SimpleGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.SimpleWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.DirectedSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
- serialVersionUID - Static variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.UniformIntrusiveEdgesSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
- serialVersionUID - Static variable in class org.jgrapht.graph.WeightedMultigraph
- serialVersionUID - Static variable in class org.jgrapht.graph.WeightedPseudograph
- serialVersionUID - Static variable in class org.jgrapht.nio.DefaultAttribute
- serialVersionUID - Static variable in exception class org.jgrapht.nio.ExportException
- serialVersionUID - Static variable in exception class org.jgrapht.nio.ImportException
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.fastutil.FastutilFastLookupGSS
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.fastutil.FastutilFastLookupIntVertexGSS
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.fastutil.FastutilGSS
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.fastutil.FastutilIntVertexGSS
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.fastutil.FastutilMapGraph
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.fastutil.FastutilMapIntVertexGraph
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
- serialVersionUID - Static variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix
- serialVersionUID - Static variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.AbstractSuccinctGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctDirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- serialVersionUID - Static variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- serialVersionUID - Static variable in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightEdgeEvent
- serialVersionUID - Static variable in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightVertexEvent
- serialVersionUID - Static variable in exception class org.jgrapht.traverse.NotDirectedAcyclicGraphException
- serialVersionUID - Static variable in class org.jgrapht.util.ArrayUnenforcedSet
- serialVersionUID - Static variable in class org.jgrapht.util.ModifiableInteger
- serialVersionUID - Static variable in exception class org.jgrapht.util.SupplierException
- serialVersionUID - Static variable in class org.jgrapht.util.SupplierUtil.ConstructorSupplier.SerializedForm
- serialVersionUID - Static variable in class org.jgrapht.util.UnmodifiableUnionSet
- serialVersionUID - Static variable in class org.jgrapht.util.WeightedUnmodifiableSet
- set - Variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- set(E) - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeIteratorImpl
- 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
- setArcNum(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the number of arcs in the network.
- setBipartiteMatchingProblemParams(int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets bipartite matching parameter subset.
- setBipartiteMatchingProblemParams(int, int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets bipartite matching parameter subset.
- setBipartiteMatchingProblemParams(int, int, int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets bipartite matching parameter subset.
- setBlossomSiblings(BlossomVNode, BlossomVEdge) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Creates a circular linked list of blossom nodes.
- setBoundaryDepth(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, int, int) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Iteratively sets a boundary height for the nodes on the outer face branch ending at the node
w
. - 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.
- setCreator(String) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Set the creator for the meta field.
- 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.
- setCurrentEdges() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Sets the currentEdge and currentDirection variables for all trees adjacent to this tree
- setCurrentEdgesAndTryToAugment(BlossomVTree) - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Sets the currentEdge and currentDirection variables for all trees adjacent to the
tree
- setCutOff(int) - Static method in class org.jgrapht.util.RadixSort
- setCycle(GraphPath<?, ?>) - Method in exception class org.jgrapht.alg.shortestpath.NegativeCycleDetectedException
-
Set the negative cycle.
- setDelimiter(char) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Set the delimiter (comma, semicolon, pipe, etc).
- setDelimiter(char) - Method in class org.jgrapht.nio.csv.CSVExporter
-
Set the delimiter (comma, semicolon, pipe, etc).
- setDelimiter(char) - Method in class org.jgrapht.nio.csv.CSVImporter
-
Set the delimiter (comma, semicolon, pipe, etc).
- setDescription(String) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Set the description for the meta field.
- setDiscovered(boolean) - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- 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
- setEdge(E) - Method in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightEdgeEvent
-
Sets the edge of this event.
- setEdge(EE) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
-
Sets the edge of this event.
- setEdgeAttributeProvider(Function<E, Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseExporter
-
Set the edge attribute provider.
- setEdgeIdProvider(Function<E, String>) - Method in class org.jgrapht.nio.BaseExporter
-
Set edge id provider
- setEdgeLabelAttributeName(String) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Set the attribute name to use for edge labels.
- setEdgesCollectionName(String) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Set the name used for the edges collection in the file.
- setEdgesCollectionName(String) - Method in class org.jgrapht.nio.json.JSONExporter
-
Set the name used for the edges collection in the file.
- setEdgesCollectionName(String) - Method in class org.jgrapht.nio.json.JSONImporter
-
Set the name used for the edges collection in the file.
- setEdgeSource(VV) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
- setEdgeSupplier(Supplier<EndpointPair<V>>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
-
Set the edge supplier that the graph uses whenever it needs to create new edges.
- setEdgeSupplier(Supplier<EndpointPair<V>>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Set the edge supplier that the graph uses whenever it needs to create new edges.
- 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.
- setEdgeSupplier(Supplier<E>) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
-
Set the edge supplier that the graph uses whenever it needs to create new edges.
- setEdgeTarget(VV) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
- setEdgeWeight(double) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
- setEdgeWeight(EndpointPair<V>, double) - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- setEdgeWeight(EndpointPair<V>, double) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- setEdgeWeight(EndpointPair<V>, double) - Method in class org.jgrapht.graph.guava.MutableDoubleValueGraphAdapter
- setEdgeWeight(EndpointPair<V>, double) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- setEdgeWeight(EndpointPair<V>, double) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
-
Assigns a weight to an edge.
- 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 class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- setEdgeWeight(E, double) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- 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(E, double) - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- setEdgeWeight(E, double) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- setEdgeWeight(E, double) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- setEdgeWeight(LongLongSortedPair, double) - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- setEdgeWeight(Integer, double) - Method in class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
- setEdgeWeight(Integer, double) - Method in class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
- setEdgeWeight(Integer, double) - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- setEdgeWeight(Integer, double) - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Assigns a weight to an edge.
- setEdgeWeight(V, V, double) - Method in interface org.jgrapht.Graph
-
Assigns a weight to an edge between
sourceVertex
andtargetVertex
. - setEdgeWeightAttributeName(String) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
-
Set the attribute name to use for edge weights.
- setEdgeWeightAttributeName(String) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Set the attribute name to use for edge weights.
- setEdgeWeightAttributeName(String) - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Set the attribute name to use for edge weights.
- setEdgeWeightAttributeName(String) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
-
Set the attribute name to use for edge weights.
- setEdgeWeightAttributeName(String) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
-
Set the attribute name to use for edge weights.
- setEdgeWeightAttributeName(String) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Set the attribute name to use for edge weights.
- setEdgeWithAttributesFactory(Function<Map<String, Attribute>, E>) - Method in class org.jgrapht.nio.dot.DOTImporter
-
Set the user custom edge factory with attributes.
- setEdgeWithAttributesFactory(Function<Map<String, Attribute>, E>) - Method in class org.jgrapht.nio.json.JSONImporter
-
Set the user custom edge factory with attributes.
- setEven(int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- setExportEdgeLabels(boolean) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Set whether the exporter will print edge labels.
- setExportEdgeWeights(boolean) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Set whether the exporter will print edge weights.
- setExportVertexLabels(boolean) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Set whether the exporter will print vertex labels.
- setFair() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with fair mode.
- setFinished(boolean) - Method in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- 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
- SetForEquality() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet.SetForEquality
- setFormat(CSVFormat) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Set the format of the importer
- setFormat(CSVFormat) - Method in class org.jgrapht.nio.csv.CSVExporter
-
Set the format of the exporter
- setFormat(CSVFormat) - Method in class org.jgrapht.nio.csv.CSVImporter
-
Set the format of the importer
- setFormat(DIMACSFormat) - Method in class org.jgrapht.nio.dimacs.DIMACSExporter
-
Set the format of the exporter
- setFormat(MatrixExporter.Format) - Method in class org.jgrapht.nio.matrix.MatrixExporter
-
Set the output format of the exporter
- 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
- setGraphAttributeProvider(Supplier<Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseExporter
-
Set the graph attribute provider.
- setGraphIdProvider(Supplier<String>) - Method in class org.jgrapht.nio.BaseExporter
-
Set the graph id provider.
- setInitializer(Function<V, Point2D>) - Method in class org.jgrapht.alg.drawing.BaseLayoutAlgorithm2D
-
Set the initializer
- setKeywords(String) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Set the keywords for the meta field.
- setLeftChild(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Sets the left child reference of this node to
node
. - setMaxCap(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the arc capacity upper bound.
- setMaxCost(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the arc cost upper bound.
- 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).
- setMaximumFlowProblemParams(int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets maximum flow network parameter subset.
- setMaximumFlowProblemParams(int, int, int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets maximum flow network parameter subset.
- setMaximumFlowProblemParams(int, int, int, int, int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets maximum flow network parameter subset.
- setMaximumFlowProblemParams(int, int, int, int, int, int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets maximum flow network parameter subset.
- setMinCap(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the arc capacity lower bound.
- setMinCost(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the arc cost lower bound.
- setNodeNum(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the number of nodes in the network.
- setNonfair() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with non-fair mode.
- setOdd(int, int) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.Levels
- setParameter(CSVFormat.Parameter, boolean) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter
-
Set the value of a parameter of the exporter
- setParameter(CSVFormat.Parameter, boolean) - Method in class org.jgrapht.nio.csv.CSVExporter
-
Set the value of a parameter of the exporter
- setParameter(CSVFormat.Parameter, boolean) - Method in class org.jgrapht.nio.csv.CSVImporter
-
Set the value of a parameter of the exporter
- setParameter(DIMACSExporter.Parameter, boolean) - Method in class org.jgrapht.nio.dimacs.DIMACSExporter
-
Set the value of a parameter of the exporter
- setParameter(GEXFExporter.Parameter, boolean) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Set the value of a parameter of the exporter
- setParameter(GmlExporter.Parameter, boolean) - Method in class org.jgrapht.nio.gml.GmlExporter
-
Set the value of a parameter of the exporter
- setParameter(LemonExporter.Parameter, boolean) - Method in class org.jgrapht.nio.lemon.LemonExporter
-
Set the value of a parameter of the exporter
- setParams(int, int, int, int, int, int, int, int, int, int, int, int, int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets all the network parameters.
- setPathLimit(int) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Limits the maximum number of edges in a cycle.
- setPercentCapacitated(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the percent of arcs to have finite capacity.
- setPercentWithInfCost(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the percent of arcs to have infinite cost.
- setPredecessor(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Updates the predecessor reference of this node.
- 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. - setRightChild(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Sets the right child reference of this node to
node
. - setSchemaValidation(boolean) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
-
Set whether the importer should validate the input
- setSchemaValidation(boolean) - Method in class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Set whether the importer should validate the input
- setSchemaValidation(boolean) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
-
Set whether the importer should validate the input
- setSchemaValidation(boolean) - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Set whether the importer should validate the input
- setSchemaValidation(boolean) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
-
Set whether the importer should validate the input
- setSchemaValidation(boolean) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
-
Set whether the importer should validate the input
- setSchemaValidation(boolean) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Set whether the importer should validate the input
- 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
- setSep(char) - Method in class org.jgrapht.io.CSVLexer
- setSep(char) - Method in class org.jgrapht.nio.csv.CSVLexer
- setSinkNum(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the number of sinks in the network.
- SetSizeOrdering(Set<E>, Set<E>, int, int) - Constructor for class org.jgrapht.util.UnmodifiableUnionSet.SetSizeOrdering
- setSource(MaximumFlowAlgorithmBase.VertexExtensionBase) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- setSourceNum(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the number of sources in the network.
- setSuccessor(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Updates the successor reference of this node.
- setSupplier(Supplier<Iterable<E>>) - Method in class org.jgrapht.util.LiveIterableWrapper
-
Set the supplier
- setTarget(MaximumFlowAlgorithmBase.VertexExtensionBase) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- setThird(C) - Method in class org.jgrapht.alg.util.Triple
-
Set the third element
- setTotalSupply(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the total supply of the network.
- setTSinkNum(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the number of transshipment sinks in the network.
- setTSourceNum(int) - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
-
Sets the number of transshipment sources in the network.
- setType(int) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightEdgeEvent
-
Set the event type of this event.
- setType(int) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
-
Set the event type of this event.
- setUseGapRelabelingHeuristic(boolean) - Static method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- setUseGlobalRelabelingHeuristic(boolean) - Static method in class org.jgrapht.alg.flow.PushRelabelMFImpl
- setValue(int) - Method in class org.jgrapht.util.ModifiableInteger
-
Sets a new value for this modifiable integer.
- setVertex(V) - Method in class org.jgrapht.traverse.AbstractGraphIterator.FlyweightVertexEvent
-
Sets the vertex of this event.
- setVertex(VV) - Method in class org.jgrapht.graph.DefaultListenableGraph.FlyweightVertexEvent
-
Sets the vertex of this event.
- setVertexAttributeProvider(Function<V, Map<String, Attribute>>) - Method in class org.jgrapht.nio.BaseExporter
-
Set the vertex attribute provider
- setVertexFactory(Function<Integer, V>) - Method in class org.jgrapht.nio.dimacs.DIMACSImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<Integer, V>) - Method in class org.jgrapht.nio.gml.GmlImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<Integer, V>) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Importer
-
Set the user custom vertex factory.
- setVertexFactory(Function<String, V>) - Method in class org.jgrapht.nio.csv.CSVImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<String, V>) - Method in class org.jgrapht.nio.dot.DOTImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<String, V>) - Method in class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<String, V>) - Method in class org.jgrapht.nio.graphml.GraphMLImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<String, V>) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Set the user custom vertex factory.
- setVertexFactory(Function<String, V>) - Method in class org.jgrapht.nio.json.JSONImporter
-
Set the user custom vertex factory.
- setVertexIdProvider(Function<V, String>) - Method in class org.jgrapht.nio.BaseExporter
-
Set the vertex id provider
- setVertexLabelAttributeName(String) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Set the attribute name to use for vertex labels.
- setVertexPair(Pair<?, ?>) - Method in exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
-
Set the vertex pair which caused the error.
- 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.
- setVertexSupplier(Supplier<V>) - Method in class org.jgrapht.graph.guava.BaseGraphAdapter
-
Set the vertex supplier that the graph uses whenever it needs to create new vertices.
- setVertexSupplier(Supplier<V>) - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
-
Set the vertex supplier that the graph uses whenever it needs to create new vertices.
- setVertexSupplier(Supplier<V>) - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
-
Set the vertex supplier that the graph uses whenever it needs to create new vertices.
- setVertexWithAttributesFactory(BiFunction<String, Map<String, Attribute>, V>) - Method in class org.jgrapht.nio.dot.DOTImporter
-
Set the user custom vertex factory with attributes.
- setVertexWithAttributesFactory(BiFunction<String, Map<String, Attribute>, V>) - Method in class org.jgrapht.nio.json.JSONImporter
-
Set the user custom vertex factory with attributes.
- setVerticesCollectionName(String) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter
-
Set the name used for the vertices collection in the file.
- setVerticesCollectionName(String) - Method in class org.jgrapht.nio.json.JSONExporter
-
Set the name used for the vertices collection in the file.
- setVerticesCollectionName(String) - Method in class org.jgrapht.nio.json.JSONImporter
-
Set the name used for the vertices collection in the file.
- 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
- shortCircuit - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Whether the edge is real or short-circuit.
- shortcutEdges - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Lists of shortcuts that correspond to vertices in the
contractionGraph
. - shortcuts - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ToListConsumer
-
Resulting list of shortcuts.
- shortcutsSearchHeapSupplier - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Supplier for the preferable heap implementation.
- SHORTEST_PATH - Enum constant in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Shortest path challenge format.
- shortestPathAlgorithm - Variable in class org.jgrapht.alg.shortestpath.GraphMeasurer
- 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.
- shortestPathComputed - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Indicates if the
lazyInitializePathHeap
procedure has already been executed. - shortestPaths - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.PathsUnpackingTask
-
Many-to-many shortest paths to be unpacked.
- shouldStop() - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Stopping criterion.
- showLog(String, String) - Method in class org.jgrapht.alg.isomorphism.VF2State
-
creates the debug output only if DEBUG is true.
- shrink(BlossomVEdge, boolean) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Performs shrink operation.
- SHRINK - Enum constant in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer.Action
- shrinkInit(BlossomVEdge, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Forms a 1/2-valued odd circuit.
- shrinkMinusNode(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Processes a minus node from an odd circuit in the shrink operation.
- shrinkNum - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Number of shrink operations
- shrinkPath(int, int, int) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- shrinkPlusNode(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Processes a plus node on an odd circuit in the shrink operation.
- shrinkTime - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
-
Time spent during the shrink operation in nanoseconds
- shutdownExecutionService(ExecutorService) - Static method in class org.jgrapht.util.ConcurrencyUtil
-
Shuts down the
executor
. - shutdownExecutionService(ExecutorService, long, TimeUnit) - Static method in class org.jgrapht.util.ConcurrencyUtil
-
Shuts down the
executor
. - sides - Variable in class org.jgrapht.alg.drawing.model.Box2D
-
The side lengths
- siftDown(List<EppsteinShortestPathIterator.PathsGraphVertex>, int, int) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
- sign - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
Either $+1$ or $-1$ for regular and inverted edges respectively.
- 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.
- SimpleGEXFEventDrivenImporter - Class in org.jgrapht.nio.gexf
-
Imports a graph from a GEXF data source.
- SimpleGEXFEventDrivenImporter() - Constructor for class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
-
Constructs a new importer.
- SimpleGEXFEventDrivenImporter.Attribute - Class in org.jgrapht.nio.gexf
- SimpleGEXFEventDrivenImporter.GEXFHandler - Class in org.jgrapht.nio.gexf
- SimpleGEXFImporter<V,
E> - Class in org.jgrapht.nio.gexf -
Imports a graph from a GEXF data source.
- SimpleGEXFImporter() - Constructor for class org.jgrapht.nio.gexf.SimpleGEXFImporter
-
Constructs a new importer.
- SimpleGEXFImporter.Consumers - Class in org.jgrapht.nio.gexf
- 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.
- SimpleGraphMLEdgeListImporter - Class in org.jgrapht.nio.graphml
-
Imports a GraphML file as an edge list.
- SimpleGraphMLEdgeListImporter() - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter
-
Constructs a new importer.
- SimpleGraphMLEdgeListImporter.Consumers - Class in org.jgrapht.nio.graphml
- SimpleGraphMLEventDrivenImporter - Class in org.jgrapht.nio.graphml
-
Imports a graph from a GraphML data source.
- SimpleGraphMLEventDrivenImporter() - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
-
Constructs a new importer.
- SimpleGraphMLEventDrivenImporter.GraphMLHandler - Class in org.jgrapht.nio.graphml
- SimpleGraphMLEventDrivenImporter.Key - Class in org.jgrapht.nio.graphml
- SimpleGraphMLImporter<V,
E> - Class in org.jgrapht.nio.graphml -
Imports a graph from a GraphML data source.
- SimpleGraphMLImporter() - Constructor for class org.jgrapht.nio.graphml.SimpleGraphMLImporter
-
Constructs a new importer.
- SimpleGraphMLImporter.Consumers - Class in org.jgrapht.nio.graphml
- simpleHeuristic() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
- simpleInitialization(BlossomVOptions) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Performs simple initialization of the matching by allocating $|V|$ trees.
- SimpleMatching(int) - Constructor for class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
- 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
- SINGLE - Enum constant in enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
- singleSourcePaths - Variable in class org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths
- Singleton(Map<String, Attribute>) - Constructor for class org.jgrapht.nio.gml.GmlEventDrivenImporter.Singleton
- singletonNodes - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Mapping from zero-degree nodes to their trees.
- singletons - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- singletons - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- singletonsUUID - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- 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.
- singleVertexUpdate(V) - Method in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.Algorithm
- singleVertexUpdate(V) - Method in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.WeightedAlgorithm
- sink - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- sink - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Sink vertex.
- sink - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Sink vertex.
- SINK_TREE_VERTEX - Enum constant in enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
- sinkNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- sinkNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- sinkPartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- sinks - Variable in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
- size - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- size - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.PathsGraphVertex
-
If this vertex is part of a balanced heap of outroots in the path graph, this value is used to determine where a new vertex should be inserted in order for the heap to remain balanced.
- size - Variable in class org.jgrapht.generate.CompleteGraphGenerator
- size - Variable in class org.jgrapht.generate.EmptyGraphGenerator
- size - Variable in class org.jgrapht.generate.LinearGraphGenerator
- size - Variable in class org.jgrapht.generate.RingGraphGenerator
- size - Variable in class org.jgrapht.generate.ScaleFreeGraphGenerator
- size - Variable in class org.jgrapht.generate.WheelGraphGenerator
- size - Variable in class org.jgrapht.util.DoublyLinkedList
- size() - Method in class org.jgrapht.alg.color.SaturationDegreeColoring.Heap
- 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.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- size() - Method in class org.jgrapht.graph.MaskEdgeSet
- size() - Method in class org.jgrapht.graph.MaskVertexSet
- size() - Method in class org.jgrapht.opt.graph.sparse.specifics.CompleteIntegerSet
- size() - Method in class org.jgrapht.util.ArrayUnenforcedSet.SetForEquality
- 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
- SIZE_RADIX - Static variable in class org.jgrapht.util.RadixSort
- sizeA - Variable in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
- sizeB - Variable in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
- sizeSubtree - Variable in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
- sizeTour - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- skeletonArcs - Variable in class org.jgrapht.generate.netgen.NetworkInfo
-
List of network skeleton arcs.
- skipComments(BufferedReader) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- slack - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
-
The slack of this edge.
- smaller - Variable in class org.jgrapht.util.UnmodifiableUnionSet.SetSizeOrdering
- smallerSize - Variable in class org.jgrapht.util.UnmodifiableUnionSet.SetSizeOrdering
- 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.
- solveCPPDirected(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.ChinesePostman
-
Solves the CPP for directed graphs
- solveCPPUndirected(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.ChinesePostman
-
Solves the CPP for undirected graphs
- sort - Variable in class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching
- sort(List<Integer>) - Static method in class org.jgrapht.util.RadixSort
-
Sort the given list in ascending order.
- sortColorClasses(List<Set<V>>, VertexColoringAlgorithm.Coloring<V>) - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Sorts a list of color classes by the size and the color (integer representation of the color) and
- sorted - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- sorted - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- sortedEdges(int) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- sortSeparatorsList(List<Pair<List<Pair<Integer, Integer>>, E>>) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Sorts the
separators
using bucket sort - sortVertices() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Performs sorting of the vertices by their lowpoints and adding them to the
separatedDfsChildList
- source - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- source - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- source - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
The source node of this edge.
- source - Variable in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- source - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Source vertex.
- source - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths
- source - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl
- source - Variable in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths.JohnsonSingleSourcePaths
- 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
- source - Variable in class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Source vertex.
- source - Variable in class org.jgrapht.graph.IntrusiveEdge
- source - Variable in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- source - Variable in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
-
Source vertex of edge
- SOURCE - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- SOURCE - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- SOURCE_TREE_VERTEX - Enum constant in enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
- source2SinkUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between source nodes and sink nodes.
- source2TNodeUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between source nodes and t-nodes.
- source2TSourceUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between source nodes and t-source nodes.
- sourceBridge - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- sourceId - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- sourceId - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- sourceNode - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- sourceNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- sourceNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- sourcePartition - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- sourcePartitionLastInvokedSource - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- sourcePartitionMinimumCut - Variable in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
- sources - Variable in class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
-
Set of source vertices.
- sources - Variable in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
- sourceShift - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- sourceShift - Variable in class org.jgrapht.sux4j.AbstractSuccinctGraph
-
The shift used to read sources in the successor list.
- sourceShift - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- sourceTargetEstimate - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ConsistentTerminationCriterion
- spanned - Variable in class org.jgrapht.alg.spanning.PrimMinimumSpanningTree.VertexInfo
- spanner - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- spanner - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
- SpannerAlgorithm<E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a graph spanner of a given graph.
- SpannerAlgorithm.Spanner<E> - Interface in org.jgrapht.alg.interfaces
-
A graph spanner.
- SpannerAlgorithm.SpannerImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the spanner interface.
- SpannerAlgorithmBase() - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.SpannerAlgorithmBase
- 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.
- spanningTreeEdge - Variable in class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
-
Best spanning tree edge to vertex seen so far.
- SpanningTreeImpl(Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
-
Construct a new spanning tree.
- SPARSE_ADJACENCY_MATRIX - Enum constant in enum class org.jgrapht.nio.matrix.MatrixExporter.Format
-
A sparse representation of the adjacency matrix.
- SPARSE_LAPLACIAN_MATRIX - Enum constant in enum class org.jgrapht.nio.matrix.MatrixExporter.Format
-
A sparse representation of the Laplacian.
- SPARSE_NORMALIZED_LAPLACIAN_MATRIX - Enum constant in enum class org.jgrapht.nio.matrix.MatrixExporter.Format
-
A sparse representation of the normalized Laplacian.
- SPARSE6 - Enum constant in enum class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Format
- SPARSE6 - Enum constant in enum class org.jgrapht.nio.graph6.Graph6Sparse6Exporter.Format
- 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.
- SparseEdmondsMaximumCardinalityMatching.Algorithm<V,
E> - Class in org.jgrapht.alg.matching -
The actual implementation as an inner class.
- SparseEdmondsMaximumCardinalityMatching.Algorithm.Label - Enum Class in org.jgrapht.alg.matching
-
Even, odd and unlabeled labels.
- SparseEdmondsMaximumCardinalityMatching.VertexPartition - Class in org.jgrapht.alg.matching
-
Special integer vertex union-find.
- SparseEdmondsMaximumCardinalityMatching.VertexPartition.Item - Class in org.jgrapht.alg.matching
- SparseGraphSpecifics - Interface in org.jgrapht.opt.graph.sparse.specifics
-
Specifics which provide a sparse graph implementation.
- SparseIntDirectedGraph - Class in org.jgrapht.opt.graph.sparse
-
A sparse directed graph.
- SparseIntDirectedGraph(int, int, Supplier<Stream<Pair<Integer, Integer>>>, IncomingEdgesSupport) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntDirectedGraph
-
Create a new graph from an edge stream.
- SparseIntDirectedGraph(int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntDirectedGraph
-
Create a new graph from an edge list.
- SparseIntDirectedGraph(int, List<Pair<Integer, Integer>>, IncomingEdgesSupport) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntDirectedGraph
-
Create a new graph from an edge list.
- SparseIntDirectedWeightedGraph - Class in org.jgrapht.opt.graph.sparse
-
Sparse directed weighted graph.
- SparseIntDirectedWeightedGraph(int, int, Supplier<Stream<Triple<Integer, Integer, Double>>>, IncomingEdgesSupport) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
-
Create a new graph from an edge stream.
- SparseIntDirectedWeightedGraph(int, List<Triple<Integer, Integer, Double>>) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
-
Create a new graph from an edge list.
- SparseIntDirectedWeightedGraph(int, List<Triple<Integer, Integer, Double>>, IncomingEdgesSupport) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
-
Create a new graph from an edge list.
- SparseIntUndirectedGraph - Class in org.jgrapht.opt.graph.sparse
-
Sparse undirected graph.
- SparseIntUndirectedGraph(int, int, Supplier<Stream<Pair<Integer, Integer>>>) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntUndirectedGraph
-
Create a new graph from an edge stream
- SparseIntUndirectedGraph(int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntUndirectedGraph
-
Create a new graph from an edge list
- SparseIntUndirectedWeightedGraph - Class in org.jgrapht.opt.graph.sparse
-
Sparse undirected weighted graph.
- SparseIntUndirectedWeightedGraph(int, int, Supplier<Stream<Triple<Integer, Integer, Double>>>) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
-
Create a new graph from an edge stream
- SparseIntUndirectedWeightedGraph(int, List<Triple<Integer, Integer, Double>>) - Constructor for class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
-
Create a new graph from an edge list
- spec - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- Specification() - Constructor for class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- specifics - Variable in class org.jgrapht.graph.AbstractBaseGraph
- specifics - Variable in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- Specifics<V,
E> - Interface in org.jgrapht.graph.specifics -
An interface encapsulating the basic graph operations.
- split(String) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- split(List<Integer>) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
-
Split a partition.
- split(AVLTree.TreeNode<T>, AVLTree.TreeNode<T>, AVLTree.TreeNode<T>, boolean) - Method in class org.jgrapht.util.AVLTree
-
Traverses the tree up until the virtual root and splits it into two parts.
- splitAfter(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Splits the tree into two parts.
- 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.
- splitBefore(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Splits the tree into two parts.
- splitCluster(Set<V>, Queue<Set<V>>) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Takes a set of odd vertices with cardinality $2$ or more, and splits them into $2$ new non-empty sets.
- splitColoring(VertexColoringAlgorithm.Coloring<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>>) - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Splits up the coloring of the union graph into the two colorings of the original graphs
- spliterator - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.MaxEdgeWeightTask
-
Is used to split a collection and create new recursive tasks during the computation.
- spliterator() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
Creates a
Spliterator
over the elements in the set's unmodifiable copy. - splitUpColor(Integer, Deque<Integer>, ColorRefinementAlgorithm.ColoringRepresentation) - Method in class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Helper method for splitting up a color.
- stack - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- stack - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- stack - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- stack - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- stack - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The stack containing merge information for every consecutive pair of biconnected components on the path to the back edge source.
- stack - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.Algorithm
- stack - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- stack - Variable in class org.jgrapht.traverse.DepthFirstIterator
- stackB - Variable in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- 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
- StackEntry(V, boolean) - Constructor for class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Constructs an instance of the stack entry for the given
v
andisKeyroot
- stackS - Variable in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- STAR - Static 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 - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- start - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.Region
- START - Enum constant in enum class org.jgrapht.nio.ImportEvent
-
Start of the import
- START_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the first vertex generated.
- startDocument() - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- startDocument() - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- startDocument() - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- startElement(String, String, String, Attributes) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- startElement(String, String, String, Attributes) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- startElement(String, String, String, Attributes) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- startVertex - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- startVertex - Variable in class org.jgrapht.graph.GraphWalk
- startVertex - Variable in class org.jgrapht.traverse.CrossComponentIterator
-
The current vertex.
- startVertexIterator - Variable in class org.jgrapht.traverse.CrossComponentIterator
-
Iterator which provides start vertices for specified start vertices.
- startVertices - Variable in class org.jgrapht.alg.clustering.GirvanNewmanClustering
- startVertices - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- startVertices - Variable in class org.jgrapht.alg.scoring.EdgeBetweennessCentrality
- state - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
State information needed for the algorithm
- state - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
State information needed for the algorithm
- state - Variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Current state of the algorithm
- state - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Auxiliary field which helps to identify which part of the recursive procedure should be executed next for this stack entry.
- state - Variable in class org.jgrapht.traverse.CrossComponentIterator
-
The connected component state
- State() - Constructor for class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- statement() - Method in class org.jgrapht.io.DOTParser.CompoundStatementContext
- statement() - Method in class org.jgrapht.io.DOTParser
- statement() - Method in class org.jgrapht.nio.dot.DOTParser.CompoundStatementContext
- statement() - Method in class org.jgrapht.nio.dot.DOTParser
- statement(int) - Method in class org.jgrapht.io.DOTParser.CompoundStatementContext
- statement(int) - Method in class org.jgrapht.nio.dot.DOTParser.CompoundStatementContext
- StatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.StatementContext
- StatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.StatementContext
- stateStack - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- statistics - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Statistics of the algorithm performance
- statistics - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ToStatisticsConsumer
-
Resulting statistics instance.
- 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
- stop(double) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.ConsistentTerminationCriterion
- stop(double) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.InconsistentTerminationCriterion
- stop(double) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.TerminationCriterion
-
Determines if the search should be terminated.
- stream() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
-
Return a sequential
Stream
with the backing set's unmodifiable copy as its source. - strict - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- STRICT - Static variable in class org.jgrapht.io.DOTLexer
- STRICT - Static variable in class org.jgrapht.io.DOTParser
- STRICT - Static variable in class org.jgrapht.nio.dot.DOTLexer
- STRICT - Static variable in class org.jgrapht.nio.dot.DOTParser
- STRICT() - Method in class org.jgrapht.io.DOTParser.GraphHeaderContext
- STRICT() - Method in class org.jgrapht.nio.dot.DOTParser.GraphHeaderContext
- String - Static variable in class org.jgrapht.io.DOTLexer
- String - Static variable in class org.jgrapht.io.DOTParser
- String - Static variable in class org.jgrapht.nio.dot.DOTLexer
- String - Static variable in class org.jgrapht.nio.dot.DOTParser
- String() - Method in class org.jgrapht.io.DOTParser.IdentifierContext
- String() - Method in class org.jgrapht.nio.dot.DOTParser.IdentifierContext
- STRING - Enum constant in enum class org.jgrapht.nio.AttributeType
- STRING - Enum constant in enum class org.jgrapht.nio.gexf.GEXFAttributeType
- STRING - Static variable in class org.jgrapht.io.CSVLexer
- STRING - Static variable in class org.jgrapht.io.CSVParser
- STRING - Static variable in class org.jgrapht.io.GmlLexer
- STRING - Static variable in class org.jgrapht.io.GmlParser
- STRING - Static variable in class org.jgrapht.io.JsonLexer
- STRING - Static variable in class org.jgrapht.io.JsonParser
- STRING - Static variable in class org.jgrapht.nio.csv.CSVLexer
- STRING - Static variable in class org.jgrapht.nio.csv.CSVParser
- STRING - Static variable in class org.jgrapht.nio.gml.GmlLexer
- STRING - Static variable in class org.jgrapht.nio.gml.GmlParser
- STRING - Static variable in class org.jgrapht.nio.json.JsonLexer
- STRING - Static variable in class org.jgrapht.nio.json.JsonParser
- STRING() - Method in class org.jgrapht.io.CSVParser.StringFieldContext
- STRING() - Method in class org.jgrapht.io.GmlParser.StringKeyValueContext
- STRING() - Method in class org.jgrapht.io.JsonParser.PairContext
- STRING() - Method in class org.jgrapht.io.JsonParser.ValueContext
- STRING() - Method in class org.jgrapht.nio.csv.CSVParser.StringFieldContext
- STRING() - Method in class org.jgrapht.nio.gml.GmlParser.StringKeyValueContext
- STRING() - Method in class org.jgrapht.nio.json.JsonParser.PairContext
- STRING() - Method in class org.jgrapht.nio.json.JsonParser.ValueContext
- stringBuffer - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- StringFieldContext(CSVParser.FieldContext) - Constructor for class org.jgrapht.io.CSVParser.StringFieldContext
- StringFieldContext(CSVParser.FieldContext) - Constructor for class org.jgrapht.nio.csv.CSVParser.StringFieldContext
- StringKeyValueContext(GmlParser.KeyValuePairContext) - Constructor for class org.jgrapht.io.GmlParser.StringKeyValueContext
- StringKeyValueContext(GmlParser.KeyValuePairContext) - Constructor for class org.jgrapht.nio.gml.GmlParser.StringKeyValueContext
- strongConnectivityAlgorithm - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
Algorithm for computing strongly connected components in the
graph
. - StrongConnectivityAlgorithm<V,
E> - Interface in org.jgrapht.alg.interfaces -
A strong connectivity inspector algorithm.
- stronglyConnectedSets - Variable in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- 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
- stronglyConnectedSubgraphs - Variable in class org.jgrapht.alg.connectivity.AbstractStrongConnectivityInspector
- strue - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- subgraph - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- SUBGRAPH - Static variable in class org.jgrapht.io.DOTLexer
- SUBGRAPH - Static variable in class org.jgrapht.io.DOTParser
- SUBGRAPH - Static variable in class org.jgrapht.nio.dot.DOTLexer
- SUBGRAPH - Static variable in class org.jgrapht.nio.dot.DOTParser
- SUBGRAPH() - Method in class org.jgrapht.io.DOTParser.SubgraphStatementContext
- SUBGRAPH() - Method in class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- SubgraphScope() - Constructor for class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- subgraphScopes - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- subgraphStatement() - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- subgraphStatement() - Method in class org.jgrapht.io.DOTParser.StatementContext
- subgraphStatement() - Method in class org.jgrapht.io.DOTParser
- subgraphStatement() - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- subgraphStatement() - Method in class org.jgrapht.nio.dot.DOTParser.StatementContext
- subgraphStatement() - Method in class org.jgrapht.nio.dot.DOTParser
- subgraphStatement(int) - Method in class org.jgrapht.io.DOTParser.EdgeStatementContext
- subgraphStatement(int) - Method in class org.jgrapht.nio.dot.DOTParser.EdgeStatementContext
- SubgraphStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.DOTParser.SubgraphStatementContext
- SubgraphStatementContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.dot.DOTParser.SubgraphStatementContext
- submitTasks(int, int, Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Submits
tasks
to thecompletionService
setting start and end of the working segment and consumer for them - submitTasks(int, int, List<Consumer<ContractionHierarchyPrecomputation.ContractionVertex<V>>>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Submits
tasks
to thecompletionService
setting start and end of the working segment and an individual instance of consumer provided inconsumers
. - submitTasks(Runnable, int) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
- subset1 - Variable in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
- subset2 - Variable in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
- subset3 - Variable in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition.Decomposition
- substitute(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Substitutes the neighbor
node
with anewNeighbor
- substituteAnother(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Substitutes a neighbor of this node, which is not equal to the
node
, with thenewNeighbor
- substituteChild(AVLTree.TreeNode<T>, AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Substitutes the
prevChild
with thenewChild
. - subtour - Variable in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
- subtour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Get or create a sub-tour to start augmenting
- subtract(Point2D, Point2D) - Static method in class org.jgrapht.alg.drawing.model.Points
-
Subtract 2-dimensional vectors
- subtree(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Set<V>, V, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Calculates the subtree of
v
with respect to the MST given inpartitionSpanningTree
. - SUBTREE - Enum constant in enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
- subtreeMax - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
A maximum node in the subtree rooted at this node
- subtreeMin - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
A minimum node in the subtree rooted at this node
- subtreeSize - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Size of the subtree rooted at this node
- succ - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- succ - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- succ - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- successor - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
Next node in the tree according to the in order traversal
- successor(AVLTree.TreeNode<T>) - Method in class org.jgrapht.util.AVLTree
-
Returns the node following the
node
in the order defined by this tree. - 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.
- successors - Variable in class org.jgrapht.alg.util.NeighborCache
- successors - Variable in class org.jgrapht.sux4j.SuccinctDirectedGraph
-
The cumulative list of successor lists.
- successors - Variable in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
The cumulative list of successor lists.
- successors - Variable in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
The cumulative list of successor (edges in sorted order, including loops) lists.
- successors - Variable in class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
The cumulative list of successor (edges in sorted order, including loops) lists.
- 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.
- SuccinctDirectedGraph - Class in org.jgrapht.sux4j
-
An immutable directed graph with
IntIntPair
edges represented using quasi-succinct data structures. - SuccinctDirectedGraph(int, int, Supplier<Stream<Pair<Integer, Integer>>>) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Creates a new immutable succinct directed graph from a supplier of streams of edges, supporting both outgoing and incoming edges.
- SuccinctDirectedGraph(int, int, Supplier<Stream<Pair<Integer, Integer>>>, boolean) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Creates a new immutable succinct directed graph from a supplier of streams of edges, choosing whether to support incoming edges.
- SuccinctDirectedGraph(int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Creates a new immutable succinct directed graph from an edge list, supporting both outgoing and incoming edges.
- SuccinctDirectedGraph(int, List<Pair<Integer, Integer>>, boolean) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Creates a new immutable succinct directed graph from an edge list, choosing whether to support incoming edges.
- SuccinctDirectedGraph(Graph<Integer, E>) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Creates a new immutable succinct directed graph from a given directed graph, supporting both outgoing and incoming edges.
- SuccinctDirectedGraph(Graph<Integer, E>, boolean) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph
-
Creates a new immutable succinct directed graph from a given directed graph, choosing whether to support incoming edges.
- SuccinctDirectedGraph.SuccinctGraphIterables - Class in org.jgrapht.sux4j
- SuccinctGraphIterables() - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables() - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables() - Constructor for class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables() - Constructor for class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables(SuccinctDirectedGraph) - Constructor for class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables(SuccinctIntDirectedGraph) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables(SuccinctIntUndirectedGraph) - Constructor for class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- SuccinctGraphIterables(SuccinctUndirectedGraph) - Constructor for class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- SuccinctIntDirectedGraph - Class in org.jgrapht.sux4j
-
An immutable directed graph with
Integer
edges represented using quasi-succinct data structures. - SuccinctIntDirectedGraph(int, int, Supplier<Stream<Pair<Integer, Integer>>>) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Creates a new immutable succinct directed graph from a supplier of streams of edges, supporting both outgoing and incoming edges.
- SuccinctIntDirectedGraph(int, int, Supplier<Stream<Pair<Integer, Integer>>>, boolean) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Creates a new immutable succinct directed graph from a supplier of streams of edges, choosing whether to support incoming edges.
- SuccinctIntDirectedGraph(int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Creates a new immutable succinct directed graph from an edge list, supporting both outgoing and incoming edges.
- SuccinctIntDirectedGraph(int, List<Pair<Integer, Integer>>, boolean) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Creates a new immutable succinct directed graph from an edge list, choosing whether to support incoming edges.
- SuccinctIntDirectedGraph(Graph<Integer, E>) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Creates a new immutable succinct directed graph from a given directed graph, supporting both outgoing and incoming edges.
- SuccinctIntDirectedGraph(Graph<Integer, E>, boolean) - Constructor for class org.jgrapht.sux4j.SuccinctIntDirectedGraph
-
Creates a new immutable succinct directed graph from a given directed graph, choosing whether to support incoming edges.
- SuccinctIntDirectedGraph.SuccinctGraphIterables - Class in org.jgrapht.sux4j
- SuccinctIntUndirectedGraph - Class in org.jgrapht.sux4j
-
An immutable undirected graph with
Integer
edges represented using quasi-succinct data structures. - SuccinctIntUndirectedGraph(int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
Creates a new immutable succinct undirected graph from an edge list.
- SuccinctIntUndirectedGraph(Graph<Integer, E>) - Constructor for class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
-
Creates a new immutable succinct undirected graph from a given undirected graph.
- SuccinctIntUndirectedGraph.SuccinctGraphIterables - Class in org.jgrapht.sux4j
- SuccinctUndirectedGraph - Class in org.jgrapht.sux4j
-
An immutable undirected graph with
IntIntSortedPair
edges represented using quasi-succinct data structures. - SuccinctUndirectedGraph(int, List<Pair<Integer, Integer>>) - Constructor for class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
Creates a new immutable succinct undirected graph from an edge list.
- SuccinctUndirectedGraph(Graph<Integer, E>) - Constructor for class org.jgrapht.sux4j.SuccinctUndirectedGraph
-
Creates a new immutable succinct undirected graph from a given undirected graph.
- SuccinctUndirectedGraph.SuccinctGraphIterables - Class in org.jgrapht.sux4j
- suitable(Set<Map.Entry<Integer, Integer>>, Map<Integer, Integer>) - Method in class org.jgrapht.generate.RandomRegularGraphGenerator
- sum(double[], double[]) - Static method in class org.jgrapht.alg.shortestpath.MartinShortestPath
-
Compute the sum of two vectors
- SUM - Static variable in interface org.jgrapht.util.WeightCombiner
-
Sum of weights.
- supplier - Variable in class org.jgrapht.util.LiveIterableWrapper
- SupplierException - Exception Class in org.jgrapht.util
-
Exception thrown to indicate that a
Supplier
is in an invalid state. - SupplierException(String, Throwable) - Constructor for exception class org.jgrapht.util.SupplierException
- SupplierUtil - Class in org.jgrapht.util
-
Helper class for suppliers.
- SupplierUtil() - Constructor for class org.jgrapht.util.SupplierUtil
- SupplierUtil.ConstructorSupplier<T> - Class in org.jgrapht.util
- SupplierUtil.ConstructorSupplier.SerializedForm<T> - Class in org.jgrapht.util
- supply - Variable in class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
Supply units of this node.
- supplyMap - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Supply vertex mapping which is used to define node supplies.
- 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.
- SW - Static variable in class org.jgrapht.alg.drawing.FRQuadTree
- swap(List<EppsteinShortestPathIterator.PathsGraphVertex>, int, int) - Method in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
- swap(List<T>, int, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Swaps elements in
list
on the positionsi
andj
. - swap(AVLTree<T>) - Method in class org.jgrapht.util.AVLTree
-
Swaps the contents of this tree and the
tree
- swap(V[], int, int) - Static method in class org.jgrapht.util.ArrayUtil
-
Swaps the two elements at the specified indices in the given array.
- swapNeighbors() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Swaps the outer face neighbors of this node
- swapScores() - Method in class org.jgrapht.alg.scoring.PageRank.Algorithm
- syntaxError(Recognizer<?, ?>, Object, int, int, String, RecognitionException) - Method in class org.jgrapht.nio.csv.CSVEventDrivenImporter.ThrowingErrorListener
- syntaxError(Recognizer<?, ?>, Object, int, int, String, RecognitionException) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter.ThrowingErrorListener
- syntaxError(Recognizer<?, ?>, Object, int, int, String, RecognitionException) - Method in class org.jgrapht.nio.gml.GmlEventDrivenImporter.ThrowingErrorListener
- syntaxError(Recognizer<?, ?>, Object, int, int, String, RecognitionException) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.ThrowingErrorListener
- 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.
- SørensenIndexLinkPrediction<V,
E> - Class in org.jgrapht.alg.linkprediction -
Predict links using the Sørensen Index.
- SørensenIndexLinkPrediction(Graph<V, E>) - Constructor for class org.jgrapht.alg.linkprediction.SørensenIndexLinkPrediction
-
Create a new prediction
T
- t - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- t - Variable in class org.jgrapht.generate.BarabasiAlbertForestGenerator
- T__0 - Static variable in class org.jgrapht.io.CSVLexer
- T__0 - Static variable in class org.jgrapht.io.CSVParser
- T__0 - Static variable in class org.jgrapht.io.DOTLexer
- T__0 - Static variable in class org.jgrapht.io.DOTParser
- T__0 - Static variable in class org.jgrapht.io.GmlLexer
- T__0 - Static variable in class org.jgrapht.io.GmlParser
- T__0 - Static variable in class org.jgrapht.io.JsonLexer
- T__0 - Static variable in class org.jgrapht.io.JsonParser
- T__0 - Static variable in class org.jgrapht.nio.csv.CSVLexer
- T__0 - Static variable in class org.jgrapht.nio.csv.CSVParser
- T__0 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__0 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__0 - Static variable in class org.jgrapht.nio.gml.GmlLexer
- T__0 - Static variable in class org.jgrapht.nio.gml.GmlParser
- T__0 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__0 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__1 - Static variable in class org.jgrapht.io.CSVLexer
- T__1 - Static variable in class org.jgrapht.io.CSVParser
- T__1 - Static variable in class org.jgrapht.io.DOTLexer
- T__1 - Static variable in class org.jgrapht.io.DOTParser
- T__1 - Static variable in class org.jgrapht.io.GmlLexer
- T__1 - Static variable in class org.jgrapht.io.GmlParser
- T__1 - Static variable in class org.jgrapht.io.JsonLexer
- T__1 - Static variable in class org.jgrapht.io.JsonParser
- T__1 - Static variable in class org.jgrapht.nio.csv.CSVLexer
- T__1 - Static variable in class org.jgrapht.nio.csv.CSVParser
- T__1 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__1 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__1 - Static variable in class org.jgrapht.nio.gml.GmlLexer
- T__1 - Static variable in class org.jgrapht.nio.gml.GmlParser
- T__1 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__1 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__2 - Static variable in class org.jgrapht.io.DOTLexer
- T__2 - Static variable in class org.jgrapht.io.DOTParser
- T__2 - Static variable in class org.jgrapht.io.JsonLexer
- T__2 - Static variable in class org.jgrapht.io.JsonParser
- T__2 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__2 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__2 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__2 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__3 - Static variable in class org.jgrapht.io.DOTLexer
- T__3 - Static variable in class org.jgrapht.io.DOTParser
- T__3 - Static variable in class org.jgrapht.io.JsonLexer
- T__3 - Static variable in class org.jgrapht.io.JsonParser
- T__3 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__3 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__3 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__3 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__4 - Static variable in class org.jgrapht.io.DOTLexer
- T__4 - Static variable in class org.jgrapht.io.DOTParser
- T__4 - Static variable in class org.jgrapht.io.JsonLexer
- T__4 - Static variable in class org.jgrapht.io.JsonParser
- T__4 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__4 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__4 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__4 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__5 - Static variable in class org.jgrapht.io.DOTLexer
- T__5 - Static variable in class org.jgrapht.io.DOTParser
- T__5 - Static variable in class org.jgrapht.io.JsonLexer
- T__5 - Static variable in class org.jgrapht.io.JsonParser
- T__5 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__5 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__5 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__5 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__6 - Static variable in class org.jgrapht.io.DOTLexer
- T__6 - Static variable in class org.jgrapht.io.DOTParser
- T__6 - Static variable in class org.jgrapht.io.JsonLexer
- T__6 - Static variable in class org.jgrapht.io.JsonParser
- T__6 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__6 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__6 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__6 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__7 - Static variable in class org.jgrapht.io.DOTLexer
- T__7 - Static variable in class org.jgrapht.io.DOTParser
- T__7 - Static variable in class org.jgrapht.io.JsonLexer
- T__7 - Static variable in class org.jgrapht.io.JsonParser
- T__7 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__7 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__7 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__7 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__8 - Static variable in class org.jgrapht.io.DOTLexer
- T__8 - Static variable in class org.jgrapht.io.DOTParser
- T__8 - Static variable in class org.jgrapht.io.JsonLexer
- T__8 - Static variable in class org.jgrapht.io.JsonParser
- T__8 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__8 - Static variable in class org.jgrapht.nio.dot.DOTParser
- T__8 - Static variable in class org.jgrapht.nio.json.JsonLexer
- T__8 - Static variable in class org.jgrapht.nio.json.JsonParser
- T__9 - Static variable in class org.jgrapht.io.DOTLexer
- T__9 - Static variable in class org.jgrapht.io.DOTParser
- T__9 - Static variable in class org.jgrapht.nio.dot.DOTLexer
- T__9 - Static variable in class org.jgrapht.nio.dot.DOTParser
- t1BothLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- t1InLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- t1OutLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- t2BothLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- t2InLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- t2OutLen - Variable in class org.jgrapht.alg.isomorphism.VF2State
- TAB1 - Static variable in class org.jgrapht.nio.gml.GmlExporter
- TAB1 - Static variable in class org.jgrapht.nio.lemon.LemonExporter
- TAB2 - Static variable in class org.jgrapht.nio.gml.GmlExporter
- tabuTime - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
the tabu time that is the number of iterations an element is in the tabu list
- tail - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey
-
the tail of the paths indexed by this key
- tail() - Method in class org.jgrapht.util.DoublyLinkedList
- target - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Arc
-
The target of this arc
- target - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- target - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge
-
The target of this edge
- target - Variable in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths.BucketEntry
-
Start vertex of the backward search during which this entry is created.
- target - Variable in class org.jgrapht.graph.IntrusiveEdge
- target - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- target - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.Key
- target - Variable in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- target - Variable in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
-
Target vertex of edge
- TARGET - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- TARGET - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- targetBridge - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- targetEdges - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Target total number of edges to reach.
- targetId - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- targetId - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- targetMap - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Target node to arc mapping
- targetMask - Variable in class org.jgrapht.sux4j.AbstractSuccinctGraph
-
The mask used to read targets in the successor list (lowest
AbstractSuccinctGraph.sourceShift
bits). - targetNode - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- targetNodes - Variable in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Target total number of targetNodes to reach.
This has lower priority thanDirectedScaleFreeGraphGenerator.targetEdges
. - targets - Variable in class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
-
Set of source vertices.
- 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.
- taskId - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
Id of this task.
- taskId - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AVAndLFConstructionTask
-
Id of this task.
- taskId - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.PathsUnpackingTask
-
Id of this task.
- tasks - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Tasks that are submitted to the
executor
. - TASKS_TO_THREADS_RATIO - Static variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Empirically computed amount of tasks per worker thread in the
ForkJoinPool
that yields good performance. - teleProp() - Method in class org.jgrapht.alg.scoring.PageRank.Algorithm
- 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
- TerminationCriterion(BidirectionalAStarShortestPath.AStarSearchFrontier, BidirectionalAStarShortestPath.AStarSearchFrontier) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.TerminationCriterion
- tested - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Whether the planarity of the
graph
has been tested already - testIncidence(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
-
Tests whether an edge is incident to a vertex.
- testNonNegativity() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Tests whether a non-negative dual variable is assigned to every blossom
- 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.
- TEXT - Static variable in class org.jgrapht.io.CSVLexer
- TEXT - Static variable in class org.jgrapht.io.CSVParser
- TEXT - Static variable in class org.jgrapht.nio.csv.CSVLexer
- TEXT - Static variable in class org.jgrapht.nio.csv.CSVParser
- TEXT() - Method in class org.jgrapht.io.CSVParser.TextFieldContext
- TEXT() - Method in class org.jgrapht.nio.csv.CSVParser.TextFieldContext
- TEXTCHAR_sempred(RuleContext, int) - Method in class org.jgrapht.io.CSVLexer
- TEXTCHAR_sempred(RuleContext, int) - Method in class org.jgrapht.nio.csv.CSVLexer
- TextFieldContext(CSVParser.FieldContext) - Constructor for class org.jgrapht.io.CSVParser.TextFieldContext
- TextFieldContext(CSVParser.FieldContext) - Constructor for class org.jgrapht.nio.csv.CSVParser.TextFieldContext
- THE_GRAPH_CONTAINS_NO_EDGE_SUPPLIER - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- THE_GRAPH_CONTAINS_NO_VERTEX_SUPPLIER - Static variable in class org.jgrapht.graph.AbstractBaseGraph
- 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
- Thread safety - Search tag in class org.jgrapht.webgraph.ImmutableDirectedGraphAdapter
- Section
- Thread safety - Search tag in class org.jgrapht.webgraph.ImmutableUndirectedGraphAdapter
- Section
- THROW_EXCEPTION_ON_OVERFLOW - Enum constant in enum class org.jgrapht.alg.scoring.BetweennessCentrality.OverflowStrategy
-
An exception is thrown if an overflow in counters is detected.
- THROW_EXCEPTION_ON_OVERFLOW - Enum constant in enum class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.OverflowStrategy
-
An exception is thrown if an overflow in counters is detected.
- ThrowingErrorListener() - Constructor for class org.jgrapht.nio.csv.CSVEventDrivenImporter.ThrowingErrorListener
- ThrowingErrorListener() - Constructor for class org.jgrapht.nio.dot.DOTEventDrivenImporter.ThrowingErrorListener
- ThrowingErrorListener() - Constructor for class org.jgrapht.nio.gml.GmlEventDrivenImporter.ThrowingErrorListener
- ThrowingErrorListener() - Constructor for class org.jgrapht.nio.json.JSONEventDrivenImporter.ThrowingErrorListener
- 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
- time - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- timeIn - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- timeLimitReached - Variable in class org.jgrapht.alg.clique.BaseBronKerboschCliqueFinder
-
Whether the last computation terminated due to a time limit.
- timeOut - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- timestamp - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
This vertex timestamp.
- title - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.Attribute
- tNode2SinkUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between t-nodes and sink nodes.
- tNode2TNodeUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between t-nodes.
- tNode2TSourceUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between t-nodes and t-sources.
- toArray() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- toArray() - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- toArray(T[]) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- toArray(T[]) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- toAttributeType(GEXFAttributeType) - Static method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter
- toExistingNode(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
-
Returns either
node
or its real counterpart in the case thenode
is a component root. - toI(V) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- toI(V) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- toI(V) - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
- toInteger() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns an
Integer
object representing thisModifiableInteger
's value. - tokenNames - Static variable in class org.jgrapht.io.CSVLexer
-
Deprecated.Use
CSVLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.CSVParser
-
Deprecated.Use
CSVParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.DOTLexer
-
Deprecated.Use
DOTLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.DOTParser
-
Deprecated.Use
DOTParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.GmlLexer
-
Deprecated.Use
GmlLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.GmlParser
-
Deprecated.Use
GmlParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.JsonLexer
-
Deprecated.Use
JsonLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.io.JsonParser
-
Deprecated.Use
JsonParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.csv.CSVLexer
-
Deprecated.Use
CSVLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.csv.CSVParser
-
Deprecated.Use
CSVParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.dot.DOTLexer
-
Deprecated.Use
DOTLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.dot.DOTParser
-
Deprecated.Use
DOTParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.gml.GmlLexer
-
Deprecated.Use
GmlLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.gml.GmlParser
-
Deprecated.Use
GmlParser.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.json.JsonLexer
-
Deprecated.Use
JsonLexer.VOCABULARY
instead. - tokenNames - Static variable in class org.jgrapht.nio.json.JsonParser
-
Deprecated.Use
JsonParser.VOCABULARY
instead. - toLandmark - Variable in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
- tolerance - Variable in class org.jgrapht.alg.scoring.PageRank
-
The calculation will stop if the difference of PageRank values between iterations change less than this value
- TOLERANCE_DEFAULT - Static variable in class org.jgrapht.alg.scoring.EigenvectorCentrality
-
Default value for the tolerance.
- TOLERANCE_DEFAULT - Static variable in class org.jgrapht.alg.scoring.KatzCentrality
-
Default value for the tolerance.
- TOLERANCE_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Default value for the tolerance.
- TOLERANCE_DOUBLE_COMPARATOR - Static variable in class org.jgrapht.alg.drawing.model.Points
- 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.
- ToListConsumer() - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ToListConsumer
-
Constructs an instance of the consumer.
- TooManyFailuresException - Exception Class in org.jgrapht.generate
-
Raised when the generator fails, too many times in a row, to grow a graph.
- TooManyFailuresException() - Constructor for exception class org.jgrapht.generate.TooManyFailuresException
-
Constructs a new too many failures Exception with null as its detail message.
- TooManyFailuresException(String) - Constructor for exception class org.jgrapht.generate.TooManyFailuresException
-
Constructs a new exception with the specified detail message.
- TooManyFailuresException(String, Throwable) - Constructor for exception class org.jgrapht.generate.TooManyFailuresException
-
Constructs a new too Many Failures exception with the specified detail message and cause.
- topoComparator - Variable in class org.jgrapht.graph.DirectedAcyclicGraph
- TopoComparator() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.TopoComparator
- TopoIterator() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.TopoIterator
- 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.
- topoModCount - Variable in class org.jgrapht.graph.DirectedAcyclicGraph
- topoOrderMap - Variable in class org.jgrapht.graph.DirectedAcyclicGraph
- toPos - Variable in class org.jgrapht.opt.graph.sparse.specifics.CSRBooleanMatrix.NonZerosIterator
- topoToVertex - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- topoToVertex - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- TopoVertexBiMap() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
-
Constructor
- TopoVertexMap() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
-
Constructor
- toSingleSourceSingleSinkProblem() - Method in class org.jgrapht.generate.netgen.MaximumFlowProblem.MaximumFlowProblemImpl
-
Converts this problem to the canonical form.
- toSingleSourceSingleSinkProblem() - Method in interface org.jgrapht.generate.netgen.MaximumFlowProblem
-
Converts this problem to the canonical form.
- ToStatisticsConsumer() - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ToStatisticsConsumer
-
Constructs an instance of the consumer.
- toString() - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Arc
- toString() - Method in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
- 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.BoykovKolmogorovMFImpl.VertexExtension
- toString() - Method in enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
- toString() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.AnnotatedFlowEdge
- toString() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Arc
- toString() - Method in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
- 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.ColorRefinementIsomorphismInspector.DistinctGraphObject
- toString() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- toString() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVEdge
- toString() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
- toString() - Method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
-
Returns the name of the dual updates strategy
- toString() - Method in enum class 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.BlossomVTree
- toString() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTreeEdge
- 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.planar.BoyerMyrvoldPlanarityInspector.Edge
- toString() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
- toString() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
- toString() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator
- toString() - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath.Label
- toString() - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
- 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.NeighborCache.Neighbors
- 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.generate.netgen.NetworkGenerator.Node
- toString() - Method in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- 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.CopyOnDemandSet
-
Return the backing set's toString result.
- 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 enum class org.jgrapht.nio.AttributeType
-
Get a string representation of the attribute type
- toString() - Method in class org.jgrapht.nio.DefaultAttribute
- toString() - Method in enum class org.jgrapht.nio.gexf.GEXFAttributeType
-
Get a string representation of the attribute type
- toString() - Method in enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
-
Get a string representation of the attribute category
- toString() - Method in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
-
Get a string representation of the attribute category
- toString() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Node
- toString() - Method in class org.jgrapht.util.AVLTree
- toString() - Method in class org.jgrapht.util.AVLTree.TreeNode
- toString() - Method in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
- toString() - Method in class org.jgrapht.util.ModifiableInteger
-
Returns a
String
object representing thisModifiableInteger
's value. - toString(boolean) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Returns a full or a partial string representation of this node
- toStringFromSets(Collection<? extends V>, Collection<? extends E>, boolean) - Method in class org.jgrapht.graph.AbstractGraph
-
Helper for subclass implementations of toString( ).
- totalAttributes - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
- totalDual(BlossomVNode, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes the sum of all duals from
start
inclusive toend
inclusive - totalEdgeAttributes - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- totalPoints - Variable in class org.jgrapht.alg.drawing.FRQuadTree.Node
- totalSupply - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- totalSupply - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- totalVertexAttributes - Variable in class org.jgrapht.nio.gexf.GEXFExporter
- totalVertices - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- totalVertices - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.Algorithm
- touchedVertices - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- 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)}.
- tour - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- TOUR_SECTION - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- tourToPath(int[]) - Method in class org.jgrapht.alg.tour.TwoOptHeuristicTSP
-
Transform from an array representation to a graph path.
- tourVertex - Variable in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- toV(int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- toV(Integer) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- transformGraph(List<E>) - Method in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
-
Prepares the working graph for next iteration.
- transformGraph(List<E>) - Method in class org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths
- transformGraph(List<E>) - Method in class org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths
- transformToPathMatrix(BitSet[]) - Static method in class org.jgrapht.alg.TransitiveReduction
-
The matrix passed as input parameter will be transformed into a path matrix.
- TransitiveClosure - Class in org.jgrapht.alg
-
Constructs the transitive closure of the input graph.
- TransitiveClosure() - Constructor for class org.jgrapht.alg.TransitiveClosure
-
Private Constructor.
- transitiveReduction(BitSet[]) - Static method in class org.jgrapht.alg.TransitiveReduction
-
The path matrix passed as input parameter will be transformed into a transitively reduced matrix.
- TransitiveReduction - Class in org.jgrapht.alg
-
An implementation of Harry Hsu's transitive reduction algorithm.
- TransitiveReduction() - Constructor for class org.jgrapht.alg.TransitiveReduction
-
Private Constructor.
- TransitNodeRouting(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>>, ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E>, TransitNodeRoutingPrecomputation.VoronoiDiagram<V>, TransitNodeRoutingPrecomputation.AccessVertices<V, E>, TransitNodeRoutingPrecomputation.LocalityFilter<V>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Constructs a new instance for the given
contractionHierarchy
,transitVertices
,transitVerticesPaths
,voronoiDiagram
,accessVertices
andlocalityFilter
. - TransitNodeRoutingPrecomputation<V,
E> - Class in org.jgrapht.alg.shortestpath -
Parallel implementation of the transit node routing route planning precomputation technique.
- TransitNodeRoutingPrecomputation(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>, int, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Constructs an instance of the algorithm for a given
contractionHierarchy
,numberOfTransitVertices
andexecutor
. - TransitNodeRoutingPrecomputation(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>, int, Supplier<AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Constructs an instance of the algorithm for a given
contractionHierarchy
,parallelism
,numberOfTransitVertices
,heapSupplier
andexecutor
. - TransitNodeRoutingPrecomputation(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Constructs an instance of the algorithm for the given
contractionHierarchy
andexecutor
. - TransitNodeRoutingPrecomputation(Graph<V, E>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Constructs an instance of the algorithm for a given
graph
andexecutor
. - TransitNodeRoutingPrecomputation.AccessVertex<V,
E> - Class in org.jgrapht.alg.shortestpath -
Forward or backward access vertex computed for a certain vertex $v$ in the graph.
- TransitNodeRoutingPrecomputation.AccessVertices<V,
E> - Class in org.jgrapht.alg.shortestpath -
Stores forward and backward access vertices computed for the transit node routing.
- TransitNodeRoutingPrecomputation.AccessVerticesBuilder - Class in org.jgrapht.alg.shortestpath
-
Provides API to build an
AccessVertices
object. - TransitNodeRoutingPrecomputation.AVAndLFConstructionTask - Class in org.jgrapht.alg.shortestpath
-
Task which is used to perform
ContractionHierarchyBFS
in parallel. - TransitNodeRoutingPrecomputation.ContractionHierarchyBFS - Class in org.jgrapht.alg.shortestpath
-
BFS algorithm which is used to compute access vertices and locality filter.
- TransitNodeRoutingPrecomputation.LocalityFilter<V> - Class in org.jgrapht.alg.shortestpath
-
Search space based locality filter.
- TransitNodeRoutingPrecomputation.LocalityFilterBuilder - Class in org.jgrapht.alg.shortestpath
-
Provides API to build a
LocalityFilter
object. - TransitNodeRoutingPrecomputation.PathsUnpackingTask - Class in org.jgrapht.alg.shortestpath
-
Task which is used to unpack contracted many-to-many shortest paths between transit vertices.
- TransitNodeRoutingPrecomputation.TransitNodeRouting<V,
E> - Class in org.jgrapht.alg.shortestpath -
This class represents return type of this algorithm and contains all data computed during the execution of the algorithm.
- TransitNodeRoutingPrecomputation.VoronoiDiagram<V> - Class in org.jgrapht.alg.shortestpath
-
Voronoi diagram for a graph.
- TransitNodeRoutingPrecomputation.VoronoiDiagramComputation - Class in org.jgrapht.alg.shortestpath
-
Algorithm which computes Voronoi diagram for the
contractionGraph
. - TransitNodeRoutingShortestPath<V,
E> - Class in org.jgrapht.alg.shortestpath -
Implementation of the shortest paths algorithm based on
TransitNodeRoutingPrecomputation
. - TransitNodeRoutingShortestPath(TransitNodeRoutingPrecomputation.TransitNodeRouting<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Constructs a new instance of the algorithm for a given
transitNodeRouting
. - TransitNodeRoutingShortestPath(Graph<V, E>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingShortestPath
-
Constructs a new instance for the given
graph
andexecutor
. - transitVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.PathsUnpackingTask
-
Selected transit vertices.
- transitVertices - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Selected transit vertices.
- transitVerticesList - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
List of transit vertices.
- transitVerticesPaths - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Paths between every pair of transit vertices.
- transitVerticesPaths - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Many-to-many shortest paths between transit vertices.
- transitVerticesSet - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Set of transit vertices.
- translateIndex(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
-
We translate the topological index to an ArrayList index.
- translateIndex(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
-
We translate the topological index to an ArrayList index.
- translateIndex(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
-
We translate the topological index to an ArrayList index.
- transportationProblemCondition() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Checks if the network satisfies the transportation problem conditions.
- TRANSSHIP_NODE - Enum constant in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- TRANSSHIP_SINK - Enum constant in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- TRANSSHIP_SOURCE - Enum constant in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
- transshipSinkNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- transshipSourceNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
- TraversalListener<V,
E> - Interface in org.jgrapht.event -
A listener on graph iterator or on a graph traverser.
- TraversalListenerAdapter<V,
E> - Class in org.jgrapht.event -
An empty do-nothing implementation of the
TraversalListener
interface used for subclasses. - TraversalListenerAdapter() - Constructor for class org.jgrapht.event.TraversalListenerAdapter
- traversalListeners - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- tree - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Reference to the tree this node belongs to
- tree - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
Underlying tree of this ordering.
- tree1 - Variable in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- tree1 - Variable in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
- tree1 - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
First tree for which the distance is computed by this algorithm.
- tree2 - Variable in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- tree2 - Variable in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
- tree2 - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Second tree for which the distance is computed by this algorithm.
- treeDistance(int, int, ZhangShashaTreeEditDistance.TreeOrdering, ZhangShashaTreeEditDistance.TreeOrdering) - Method in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Computes edit distance and list of edit operations for vertex $v1$ from
tree1
which has tree ordering index equal to $i$ and vertex $v2$ fromtree2
which has tree ordering index equal to $j$. - treeDistanceI - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.CacheEntry
-
Outer index of an entry in $editOperationLists$ which should be taken in case
editOperation
is $null$. - treeDistanceJ - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.CacheEntry
-
Inner index of an entry in $editOperationLists$ which should be taken in case
editOperation
is $null$. - treeDistances - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Array with edit distances between subtrees of
tree1
andtree2
. - TreeDynamicConnectivity<T> - Class in org.jgrapht.alg.connectivity
-
Data structure for storing dynamic trees and querying node connectivity
- TreeDynamicConnectivity() - Constructor for class org.jgrapht.alg.connectivity.TreeDynamicConnectivity
-
Constructs a new
TreeDynamicConnectivity
instance - TreeDynamicConnectivity.Arc - Class in org.jgrapht.alg.connectivity
-
An internal representation of the tree edges.
- TreeDynamicConnectivity.Node - Class in org.jgrapht.alg.connectivity
-
An internal representation of the tree nodes.
- treeEdgeIterator() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Returns a new instance of TreeEdgeIterator for this tree
- TreeEdgeIterator() - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeEdgeIterator
-
Constructs a new TreeEdgeIterator
- treeEdges - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
The list of tree edges incident to this node in the dfs tree.
- 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.
- TreeNode(T) - Constructor for class org.jgrapht.util.AVLTree.TreeNode
-
Constructs a new node with the
value
stored in it - treeNodeIterator() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree
-
Returns a new instance of TreeNodeIterator for this tree
- TreeNodeIterator() - Constructor for class org.jgrapht.util.AVLTree.TreeNodeIterator
-
Constructs a new
TreeNodeIterator
- TreeNodeIterator(BlossomVNode) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
-
Constructs a new TreeNodeIterator for a
root
. - treeNum - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVState
-
Number of trees
- TreeOrdering(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
Constructs an instance of the tree ordering for the given
graph
andtreeRoot
. - treeRoot - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVTree.TreeNodeIterator
-
A root of the subtree of a tree
- treeRoot - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering
-
Root vertex of
tree
. - treeSiblingNext - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Reference of the next tree sibling in the doubly linked list of children of the node parentEdge.getOpposite(this).
- treeSiblingPrev - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVNode
-
Reference of the previous tree sibling in the doubly linked list of children of the node parentEdge.getOpposite(this).
- 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.
- treeStatus - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Tree status of this vertex.
- 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.
- TreeValuesIterator() - Constructor for class org.jgrapht.util.AVLTree.TreeValuesIterator
-
Constructs a new
TreeValuesIterator
- Triple<A,
B, - Class in org.jgrapht.alg.utilC> -
Generic triple (3-tuple).
- Triple(A, B, C) - Constructor for class org.jgrapht.alg.util.Triple
-
Create a new triple
- tSink2SinkUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between t-sinks and sink nodes.
- tSink2TNodeUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between t-sinks and t-nodes.
- tSink2TSourceUB - Variable in class org.jgrapht.generate.netgen.NetworkGenerator
-
Maximum number of arcs a network can contain between t-sinks and t-sources.
- tSinkNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- tSourceNum - Variable in class org.jgrapht.generate.netgen.NetworkGeneratorConfigBuilder
- TSPLIBImporter<V,
E> - Class in org.jgrapht.nio.tsplib -
Importer for files in the TSPLIB95 format.
- TSPLIBImporter() - Constructor for class org.jgrapht.nio.tsplib.TSPLIBImporter
-
Constructs a new importer.
- TSPLIBImporter.Metadata<V,
E> - Class in org.jgrapht.nio.tsplib -
Container for the meta data of an imported TSPLIB95 file.
- TSPLIBImporter.Node - Class in org.jgrapht.nio.tsplib
-
A node imported from the NODE_COORD_SECTION of a TSPLIB95-file.
- TSPLIBImporter.Specification - Class in org.jgrapht.nio.tsplib
-
Container for the entry values read from the specification part of a file in TSPLIB95 format.
- 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
- TwoLayeredBipartiteLayout2D<V,
E> - Class in org.jgrapht.alg.drawing -
A two layered bipartite layout.
- TwoLayeredBipartiteLayout2D() - Constructor for class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Create a new layout
- TwoLayeredBipartiteLayout2D(Set<V>, Comparator<V>, boolean) - Constructor for class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Create a new layout
- 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.alg.similarity.ZhangShashaTreeEditDistance.EditOperation
-
Type of this operation.
- type - Variable in class org.jgrapht.event.ConnectedComponentTraversalEvent
-
The type of this event.
- type - Variable in class org.jgrapht.event.GraphChangeEvent
-
The type of graph change this event indicates.
- type - Variable in class org.jgrapht.generate.netgen.NetworkGenerator.Node
-
Type of this node.
- type - Variable in class org.jgrapht.graph.AbstractBaseGraph
- type - Variable in class org.jgrapht.graph.AsGraphUnion
- type - Variable in class org.jgrapht.graph.guava.ElementOrderMethod
- type - Variable in class org.jgrapht.nio.DefaultAttribute
- type - Variable in class org.jgrapht.nio.gexf.GEXFExporter.AttributeDetails
- type - Variable in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.Attribute
- type - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Key
- type - Variable in class org.jgrapht.nio.graphml.GraphMLExporter.AttributeDetails
- type - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.Key
- type - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
- type - Variable in class org.jgrapht.util.SupplierUtil.ConstructorSupplier.SerializedForm
- Type() - Constructor for enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
- TYPE - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- TYPE_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.gexf.GEXFExporter
- type1 - Variable in class org.jgrapht.graph.AsGraphUnion
- type2 - Variable in class org.jgrapht.graph.AsGraphUnion
- 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
- uf - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Union-Find to store blossoms.
- unblock(Integer) - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- unblock(V) - Method in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- uncheckedCast(Object) - Static method in class org.jgrapht.util.TypeUtil
-
Casts an object to a type.
- uncovered(double[][], boolean[], boolean[]) - Static method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching.KuhnMunkresMatrixImplementation
-
Accounts for zeroes being uncovered
- undirected - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- undirected - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- undirected - Variable in class org.jgrapht.graph.DefaultGraphType
- 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.
- UNDIRECTED_GRAPH_EDGEOP - Static variable in class org.jgrapht.nio.dot.DOTUtils
-
Edge operation for undirected graphs.
- UNDIRECTED_GRAPH_KEYWORD - Static variable in class org.jgrapht.nio.dot.DOTUtils
-
Keyword for undirected graphs.
- UndirectedEdgeContainer<V,
E> - Class in org.jgrapht.graph.specifics -
A container for vertex edges.
- UndirectedEdgeContainer(EdgeSetFactory<V, E>, V) - Constructor for class org.jgrapht.graph.specifics.UndirectedEdgeContainer
- undirectedGraph(Graph<V, E>) - Static method in class org.jgrapht.Graphs
-
Returns an undirected view of the specified graph.
- UndirectedModularityMeasurer<V,
E> - Class in org.jgrapht.alg.clustering -
A modularity measurer.
- UndirectedModularityMeasurer(Graph<V, E>) - Constructor for class org.jgrapht.alg.clustering.UndirectedModularityMeasurer
-
Construct a new measurer
- 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.
- unequalSeparators(List<Pair<Integer, Integer>>, List<Pair<Integer, Integer>>) - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Compares two separators for inequality.
- unescapeDSV(String, char) - Static method in class org.jgrapht.nio.csv.DSVUtils
-
Unescape a Delimiter-separated values string.
- unescapeHtmlString(String) - Static method in class org.jgrapht.nio.dot.DOTEventDrivenImporter
-
Unescape an HTML string DOT identifier.
- unescapeId - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter
- unescapeId(String) - Method in class org.jgrapht.nio.dot.DOTEventDrivenImporter
-
Unescape a string DOT identifier.
- 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(int, int) - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
- union(T, T) - Method in class org.jgrapht.alg.util.UnionFind
-
Merges the sets which contain element1 and element2.
- unionFind - Variable in class org.jgrapht.alg.lca.TarjanLCAFinder
- 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.
- UnionIterator(UnmodifiableUnionSet.SetSizeOrdering) - Constructor for class org.jgrapht.util.UnmodifiableUnionSet.UnionIterator
- UNKNOWN - Enum constant in enum class org.jgrapht.nio.AttributeType
- UNLABELED - Enum constant in enum class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm.Label
- 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.
- unlink(DoublyLinkedList.ListNodeImpl<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Remove the non null
node
from the list. - unmark(int) - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- UNMATCHED - Static variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching.SimpleMatching
- UNMODIFIABLE - Static variable in class org.jgrapht.graph.AsUnmodifiableGraph
- UNMODIFIABLE - Static variable in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.CopyOnDemandSet
- UNMODIFIABLE - Static variable in class org.jgrapht.graph.MaskSubgraph
- UNMODIFIABLE - Static variable in class org.jgrapht.opt.graph.sparse.SparseIntDirectedGraph
- UNMODIFIABLE - Static variable in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- UNMODIFIABLE - Static variable in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- UNMODIFIABLE - Static variable in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- UNMODIFIABLE - Static variable in class org.jgrapht.sux4j.AbstractSuccinctGraph
- unmodifiableEdgeSet - Variable in class org.jgrapht.graph.AsSubgraph
- unmodifiableEdgeSet - Variable in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- unmodifiableEdgeSet - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- unmodifiableEdgeSet - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- unmodifiableEdgeSet - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- unmodifiableIncoming - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
- unmodifiableOutgoing - Variable in class org.jgrapht.graph.specifics.DirectedEdgeContainer
- 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.
- UnmodifiableUnionSet.SetSizeOrdering - Class in org.jgrapht.util
- UnmodifiableUnionSet.UnionIterator - Class in org.jgrapht.util
- unmodifiableVertexEdges - Variable in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
- unmodifiableVertexSet - Variable in class org.jgrapht.graph.AbstractBaseGraph
- unmodifiableVertexSet - Variable in class org.jgrapht.graph.AsSubgraph
- unmodifiableVertexSet - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- unmodifiableVertexSet - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- unmodifiableVertexSet - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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. - unpackPaths(ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths<V, E>) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Unpacks in parallel contracted paths stored in
shortestPaths
. - unquote(String) - Method in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- unregisterAttribute(String) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
-
Unregister a GraphML-Attribute
- unregisterAttribute(String, GEXFExporter.AttributeCategory) - Method in class org.jgrapht.nio.gexf.GEXFExporter
-
Unregister a GraphML-Attribute
- unvisitedVertex - Variable in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest
- UnweightedQueue() - Constructor for class org.jgrapht.alg.scoring.ApBetweennessCentrality.UnweightedQueue
- UnweightedQueue() - Constructor for class org.jgrapht.alg.scoring.BetweennessCentrality.UnweightedQueue
- UnweightedSpannerAlgorithm() - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- update(T, D) - Method in interface org.jgrapht.alg.scoring.ApBetweennessCentrality.MyQueue
- update(T, D) - Method in interface org.jgrapht.alg.scoring.BetweennessCentrality.MyQueue
- update(V, Double) - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.UnweightedQueue
- update(V, Double) - Method in class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- update(V, Double) - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.UnweightedQueue
- update(V, Double) - Method in class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- updateBuckets(Set<V>) - Method in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList
-
For every bucket B in this
BucketList
, which contains vertices from the setvertices
, creates a newBucket
B' and moves vertices from B to B' according to the following rule: $B' = B\cap vertices$ and $B = B\backslash B'$. - updateClosest(Map<V, NearestInsertionHeuristicTSP.Closest<V>>, NearestInsertionHeuristicTSP.Closest<V>, Set<V>, Graph<V, E>) - Method in class org.jgrapht.alg.tour.NearestInsertionHeuristicTSP
-
Update the Map storing closest unvisited vertex for each tour vertex
- updateDag(V, V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Update as if a new edge is added.
- updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V>, double, AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, AddressableHeap.Handle<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Updates distance for
vertex
in theheap
if needed. - updateDistance(ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>, double) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
If necessary updates distance of the
vertex
in theheap
. - updateDistance(V, E, double) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- updateDistance(V, E, double) - Method in class org.jgrapht.alg.shortestpath.DijkstraClosestFirstIterator
- updateDistance(V, E, double, double) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
- updateDuals(BlossomVOptions.DualUpdateStrategy) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Performs global dual update.
- updateDuals(AddressableHeap<Double, BlossomVEdge>, BlossomVNode, double) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer
-
Performs lazy delta spreading during the fractional matching initialization.
- updateDualsAfter - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Whether to update duals of the tree after growth
- updateDualsBefore - Variable in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Whether to update duals of the tree before growth
- updateDualsConnectedComponents() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Updates the duals via connected components.
- updateDualsSingle(BlossomVTree) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVDualUpdater
-
Updates the duals of the single tree.
- 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.
- updateHeightAndSubtreeSize() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Updates the height and subtree size of this node according to the values of the left and right children
- updateImprovementGraph(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<V, Pair<Set<V>, Double>>, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>, Set<Integer>, Set<V>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Updates the improvement graph.
- updateImprovementGraphEdge(Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, double, double) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Adds an edge between
v1
andv2
to the improvement graph ifnewCapacity
does not exceed the capacity constraint. - updateLabel(V) - Method in class org.jgrapht.alg.clustering.LabelPropagationClustering.Implementation
-
Update the label of a vertex.
- updateNeighbours(V) - Method in class org.jgrapht.traverse.MaximumCardinalityIterator
-
Increments the cardinalities of the neighbours of the
vertex
by 1. - updateNeighboursConsumer - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Updates neighbours priorities of a vertex.
- updateNeighboursData(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Updates neighbours priorities and theirs
depth
values for a givenvertex
. - updateNetwork() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Updates network for next computation, e.g edges from v to t and from s to v Enforces positivity on network weights if specified by adding subtracting the lowest weights to all edges $(v,t)$ and $(v,s)$.
- updateOriginNodeConnections(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<V, Pair<Set<V>, Double>>, Map<Integer, SpanningTreeAlgorithm.SpanningTree<E>>, Set<Integer>, V, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Updates the edges to the origin vertex.
- updatePathIndex(Map<AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey<V>, AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V>>, AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath<V>) - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Adds a path and removes the path, which has the same tail, head and label set, to the data structure
paths
, which contains all paths indexed by their head, tail and label set. - updatePriority(ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.VertexData) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Updates
priority
field value ofdata
, which corresponds to thevertex
. - updatePseudoNodesOfNewLabels(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Updates the pseudo nodes corresponding to new subsets in the partition.
- updateSingleNode(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<V, Pair<Set<V>, Double>>, Set<V>, int, double, Set<V>, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, V, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Updates all edges from
vertexOfV1Single
to nodes in the subset represented bylabel
. - updateSubtreeNode(AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation, Map<V, Pair<Set<V>, Double>>, Set<V>, int, double, Set<V>, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, V, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Updates all edges from
vertexOfV1Single
to nodes in the subset represented bylabel
. - updateTabuVertices(Set<V>, V, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>) - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph
-
Updates all nodes that correspond to
v1
and returns if the vertexv1
. - updateTreeStructure(BlossomVNode, BlossomVEdge, BlossomVNode) - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVPrimalUpdater
-
Updates the tree structure in the shrink operation.
- upper - Variable in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- upperBoundOnVertexCoverWeight - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Maximum weight of the vertex cover.
- upperBounds - Variable in class org.jgrapht.generate.netgen.Distributor
-
Upper bounds.
- upperLimitTabuExchanges - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
the upper limit of non-improving exchanges, this is the stopping criterion in the tabu search
- USE_GAP_RELABELING_HEURISTIC - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Deprecated, for removal: This API element is subject to removal in a future version.
- USE_GLOBAL_RELABELING_HEURISTIC - Static variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Deprecated, for removal: This API element is subject to removal in a future version.
- useHeuristics - Variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
- useSubtreeOperation - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
contains whether the local search uses the subtree operation
- useTabuSearch - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
contains whether a tabu search is used
- useVertexOperation - Variable in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
contains whether the local search uses the vertex operation
V
- v - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- v - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
A vertex from
tree
. - v - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
original vertex
- VALID_DISPLAY_DATA_TYPE - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- VALID_EDGE_DATA_FORMATS - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- VALID_EDGE_WEIGHT_FORMATS - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- VALID_EDGE_WEIGHT_TYPES - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- VALID_NODE_COORD_TYPES - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- VALID_TYPES - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- validate(double, int, double) - Method in class org.jgrapht.alg.scoring.KatzCentrality
- validate(int, double) - Method in class org.jgrapht.alg.scoring.EigenvectorCentrality
- validatedIds - Variable in class org.jgrapht.nio.dot.DOTExporter
- validateEdgeWeightFunction(Function<E, double[]>) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
-
Check the validity of the edge weight function
- validateForest(Graph<V, E>, Set<V>) - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
- validateInput() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Parser
-
Check whether the g6 or s6 encoding contains any obvious errors
- validateTree(Graph<V, E>) - Method in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
- validateTree(Graph<V, E>, V) - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
- validEdges - Variable in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
- value - Variable in class org.jgrapht.alg.connectivity.TreeDynamicConnectivity.Node
-
Node value
- value - Variable in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
- value - Variable in class org.jgrapht.alg.shortestpath.MartinShortestPath.Label
- value - Variable in class org.jgrapht.nio.DefaultAttribute
- value - Variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.Data
- value - Variable in class org.jgrapht.util.AVLTree.TreeNode
-
A value stored in this tree node
- value - Variable in class org.jgrapht.util.DoublyLinkedList.ListNodeImpl
- value - Variable in class org.jgrapht.util.ModifiableInteger
-
The int value represented by this
ModifiableInteger
. - value() - Method in class org.jgrapht.io.JsonParser.ArrayContext
- value() - Method in class org.jgrapht.io.JsonParser.JsonContext
- value() - Method in class org.jgrapht.io.JsonParser.PairContext
- value() - Method in class org.jgrapht.io.JsonParser
- value() - Method in class org.jgrapht.nio.json.JsonParser.ArrayContext
- value() - Method in class org.jgrapht.nio.json.JsonParser.JsonContext
- value() - Method in class org.jgrapht.nio.json.JsonParser.PairContext
- value() - Method in class org.jgrapht.nio.json.JsonParser
- value(int) - Method in class org.jgrapht.io.JsonParser.ArrayContext
- value(int) - Method in class org.jgrapht.nio.json.JsonParser.ArrayContext
- ValueContext(ParserRuleContext, int) - Constructor for class org.jgrapht.io.JsonParser.ValueContext
- ValueContext(ParserRuleContext, int) - Constructor for class org.jgrapht.nio.json.JsonParser.ValueContext
- valueConverter - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- valueGraph - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- valueOf(String) - Static method in enum class org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer.Action
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.Label
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm.Label
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.scoring.BetweennessCentrality.OverflowStrategy
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.OverflowStrategy
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Deprecated.Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.generate.DirectedScaleFreeGraphGenerator.Direction
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.generate.WindmillGraphsGenerator.Mode
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.AttributeType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.csv.CSVFormat.Parameter
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.csv.CSVFormat
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.dimacs.DIMACSExporter.Parameter
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.gexf.GEXFAttributeType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Format
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.graph6.Graph6Sparse6Exporter.Format
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.KeyTarget
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.ImportEvent
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.lemon.LemonExporter.Parameter
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.nio.matrix.MatrixExporter.Format
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Returns the enum constant of this class with the specified name.
- values - Variable in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath.IdentifierMap
- values() - Static method in enum class org.jgrapht.alg.cycle.ChordalityInspector.IterationOrder
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVInitializer.Action
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVNode.Label
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.DualUpdateStrategy
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.matching.blossom.v5.ObjectiveSense
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm.Label
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.scoring.BetweennessCentrality.OverflowStrategy
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.OverflowStrategy
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Deprecated.Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.generate.DirectedScaleFreeGraphGenerator.Direction
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.generate.netgen.NetworkGenerator.NodeType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.generate.WindmillGraphsGenerator.Mode
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.graph.guava.ElementOrderMethod.Type
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.AttributeType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.csv.CSVFormat.Parameter
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.csv.CSVFormat
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.dimacs.DIMACSExporter.Parameter
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.dimacs.DIMACSFormat
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.gexf.GEXFAttributeType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.gml.GmlExporter.Parameter
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.graph6.Graph6Sparse6EventDrivenImporter.Format
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.graph6.Graph6Sparse6Exporter.Format
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.KeyTarget
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.ImportEvent
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.lemon.LemonExporter.Parameter
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.nio.matrix.MatrixExporter.Format
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Returns an array containing the constants of this enum class, in the order they are declared.
- vAncestors - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- vChild - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Current child vertex of
v
. - vChildIterator - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Iterates over children of $v$ in
tree
. - vectorLength - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- 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.
- verifyAdd(Set<T>, T) - Static method in class org.jgrapht.graph.ParanoidGraph
- VERSION - Static variable in class org.jgrapht.nio.gml.GmlExporter
- VERSION - Static variable in class org.jgrapht.nio.json.JSONExporter
- VERSION - Static variable in class org.jgrapht.nio.lemon.LemonExporter
- vertex - Variable in class org.jgrapht.alg.color.SaturationDegreeColoring.HeapHandle
- vertex - Variable in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector.VertexNumber
- vertex - Variable in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData2
- vertex - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
-
Original vertex from
graph
this instance represents. - vertex - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.AccessVertex
-
Transit vertex.
- vertex - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- vertex - Variable in class org.jgrapht.event.GraphVertexChangeEvent
-
The vertex that this event is related to.
- vertex - Variable in class org.jgrapht.event.VertexTraversalEvent
-
The traversed vertex.
- vertex - Variable in class org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
-
The vertex reached.
- VERTEX_ADDED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
-
Vertex added event.
- VERTEX_LABEL_DEFAULT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.graphml.GraphMLExporter
- VERTEX_REMOVED - Static variable in class org.jgrapht.event.GraphVertexChangeEvent
-
Vertex removed event.
- VERTEX_RESERVED_ATTRIBUTES - Static variable in class org.jgrapht.nio.gexf.GEXFExporter
- vertex2block - Variable in class org.jgrapht.alg.connectivity.BlockCutpointGraph
- vertex2blocks - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- vertex2components - Variable in class org.jgrapht.alg.connectivity.BiconnectivityInspector
- vertex2node - Variable in class org.jgrapht.nio.tsplib.TSPLIBImporter.Metadata
- 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.
- vertexAdded(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.graph.AsSubgraph.BaseGraphListener
-
Notifies that a vertex has been added to the graph.
- VertexAndWeight(Set<V>, double, boolean) - Constructor for class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
Construct a new weighted vertex.
- vertexAttributeConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- vertexAttributeConsumer - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- vertexAttributeConsumer - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- vertexAttributeConsumer - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- vertexAttributeConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- vertexAttributeConsumer - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- vertexAttributeConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- vertexAttributeProvider - Variable in class org.jgrapht.nio.BaseExporter
-
A vertex attribute provider
- vertexClass(Class<V1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the vertex class.
- vertexColoring - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- 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.drawing.TwoLayeredBipartiteLayout2D
- vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2MappingIterator
- vertexComparator - Variable in class org.jgrapht.alg.isomorphism.VF2State
- vertexComparator - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Comparator for vertices in the graph which is used to create
ConcurrentSkipListSet
instances for thebucketStructure
. - vertexConsumer - Variable in class org.jgrapht.nio.csv.CSVImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.gml.GmlImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Importer.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.graphml.GraphMLImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter.Consumers
- vertexConsumer - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- vertexConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- vertexCount - Variable in class org.jgrapht.alg.isomorphism.GraphOrdering
- vertexCount() - Method in interface org.jgrapht.GraphIterables
-
Return the number of vertices in the graph.
- vertexCount() - Method in class org.jgrapht.sux4j.SuccinctDirectedGraph.SuccinctGraphIterables
- vertexCount() - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph.SuccinctGraphIterables
- vertexCount() - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph.SuccinctGraphIterables
- vertexCount() - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph.SuccinctGraphIterables
- vertexCountConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- vertexCounter - Static variable in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
- vertexCounter - Static variable in class org.jgrapht.alg.vertexcover.GreedyVCImpl
- 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
- VertexData(boolean, boolean) - Constructor for class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData
- VertexData(int) - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexData
-
Constructs an instance of data for given random value.
- VertexData1(KosarajuStrongConnectivityInspector.VertexData<V>, boolean, boolean) - Constructor for class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData1
- VertexData2(V, boolean, boolean) - Constructor for class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector.VertexData2
- 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
-
Deprecated, for removal: This API element is subject to removal in a future version.
- VertexDegreeComparator(Graph<V, E>, VertexDegreeComparator.Order) - Constructor for class org.jgrapht.alg.util.VertexDegreeComparator
-
Deprecated, for removal: This API element is subject to removal in a future version.use
VertexDegreeComparator.of(Graph)
for ascending order orreverse the comparator
for descending order. - VertexDegreeComparator.Order - Enum Class in org.jgrapht.alg.util
-
Deprecated, for removal: This API element is subject to removal in a future version.
- vertexDistance - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
For each vertex stores its distance in the policy graph.
- vertexDistance - Variable in class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm
- vertexEdges - Variable in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
- vertexExtension - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- VertexExtension() - Constructor for class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexExtension
-
Creates a new free vertex.
- VertexExtension() - Constructor for class org.jgrapht.alg.flow.DinicMFImpl.VertexExtension
- VertexExtension() - Constructor for class org.jgrapht.alg.flow.EdmondsKarpMFImpl.VertexExtension
- VertexExtension() - Constructor for class org.jgrapht.alg.flow.PushRelabelMFImpl.VertexExtension
- VertexExtensionBase() - Constructor for class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase.VertexExtensionBase
- vertexExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- vertexExtensionsFactory - Variable in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Vertex extension factory used during initialization.
- vertexExtensionsFactory - Variable in class org.jgrapht.alg.flow.DinicMFImpl
- vertexExtensionsFactory - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
- vertexExtensionsFactory - Variable in class org.jgrapht.alg.flow.PushRelabelMFImpl
- vertexFactory - Variable in class org.jgrapht.nio.csv.CSVImporter
- vertexFactory - Variable in class org.jgrapht.nio.dimacs.DIMACSImporter
- vertexFactory - Variable in class org.jgrapht.nio.dot.DOTImporter
- vertexFactory - Variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter
- vertexFactory - Variable in class org.jgrapht.nio.gml.GmlImporter
- vertexFactory - Variable in class org.jgrapht.nio.graph6.Graph6Sparse6Importer
- vertexFactory - Variable in class org.jgrapht.nio.graphml.GraphMLImporter
- vertexFactory - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLImporter
- vertexFactory - Variable in class org.jgrapht.nio.json.JSONImporter
- 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.
- vertexId - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
-
Identifies the position in
verticesData
andshortcutEdges
lists, that corresponds to this vertex. - vertexIDDictionary - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Mapping of a vertex to its index in the list of vertices
- vertexIdProvider - Variable in class org.jgrapht.nio.BaseExporter
-
A vertex id provider
- vertexIndexMap - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- vertexIndexMap - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- vertexIndexMap - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- vertexIndexMap - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- vertexIndices - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- vertexIndices - Variable in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
- VertexInfo() - Constructor for class org.jgrapht.alg.spanning.PrimMinimumSpanningTree.VertexInfo
- vertexIsIndependent(ContractionHierarchyPrecomputation.ContractionVertex<V>) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Determines if a
vertex
is independent wrt the overlay graph. - vertexLabelAttributeName - Variable in class org.jgrapht.nio.graphml.GraphMLExporter
- vertexLevel - Variable in class org.jgrapht.alg.cycle.HowardMinimumMeanCycle
-
For each vertex stores its level which is used to find a cycle in the policy graph.
- vertexList - Variable in class org.jgrapht.alg.color.BrownBacktrackColoring
- vertexList - Variable in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
- vertexList - Variable in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- vertexList - Variable in class org.jgrapht.graph.GraphWalk
- 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.alg.decomposition.HeavyPathDecomposition
- vertexMap - Variable in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
- vertexMap - Variable in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
- vertexMap - Variable in class org.jgrapht.alg.lca.HeavyPathLCAFinder
- vertexMap - Variable in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.Algorithm
- vertexMap - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- vertexMap - Variable in class org.jgrapht.generate.NamedGraphGenerator
- vertexMap - Variable in class org.jgrapht.graph.specifics.DirectedSpecifics
- vertexMap - Variable in class org.jgrapht.graph.specifics.UndirectedSpecifics
- vertexMap - Variable in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- vertexMap - Variable in class org.jgrapht.nio.graphml.SimpleGraphMLEdgeListImporter.Consumers
- vertexMap - Variable in class org.jgrapht.util.VertexToIntegerMapping
- vertexMask - Variable in class org.jgrapht.graph.MaskEdgeSet
- vertexMask - Variable in class org.jgrapht.graph.MaskSubgraph
- VertexNode(HierholzerEulerianCycle.VertexNode, V, HierholzerEulerianCycle.VertexNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
-
Create VertexNode
- VertexNumber(V) - Constructor for class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector.VertexNumber
- vertexOrder - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- vertexOrder - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- vertexOrder - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- vertexOrderMethod - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- vertexOrderMethod - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- vertexOrderMethod - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- vertexPair - Variable in exception class org.jgrapht.alg.linkprediction.LinkPredictionIndexNotWellDefinedException
- VertexPartition(int) - Constructor for class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching.VertexPartition
- 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.
- vertexRemoved(GraphVertexChangeEvent<V>) - Method in class org.jgrapht.graph.AsSubgraph.BaseGraphListener
-
Notifies that a vertex has been removed from the graph.
- VertexScoringAlgorithm<V,
D> - Interface in org.jgrapht.alg.interfaces -
An interface for all algorithms which assign scores to vertices of a graph.
- vertexSet - Variable in class org.jgrapht.graph.AsSubgraph
- vertexSet - Variable in class org.jgrapht.graph.MaskVertexSet
- 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.guava.BaseGraphAdapter
- vertexSet() - Method in class org.jgrapht.graph.guava.BaseNetworkAdapter
- vertexSet() - Method in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- 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.
- vertexSet() - Method in class org.jgrapht.opt.graph.sparse.specifics.AbstractSparseSpecificsGraph
- vertexSet() - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Returns a set of the vertices contained in this graph.
- vertexSet() - Method in class org.jgrapht.sux4j.AbstractSuccinctGraph
- vertexSet() - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- vertexSet() - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- vertexSet() - Method in class org.jgrapht.webgraph.ImmutableUndirectedBigGraphAdapter
- VertexSetListener<V> - Interface in org.jgrapht.event
-
A listener that is notified when the graph's vertex set changes.
- vertexSetListeners - Variable in class org.jgrapht.graph.DefaultListenableGraph
- vertexSetModified() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Inform allVerticesSet that the backing data has been modified.
- VertexStatistics() - Constructor for class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.VertexStatistics
- vertexSupplier - Variable in class org.jgrapht.graph.AbstractBaseGraph
- vertexSupplier - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- vertexSupplier - Variable in class org.jgrapht.graph.GraphDelegator
- vertexSupplier - Variable in class org.jgrapht.graph.guava.BaseGraphAdapter
- vertexSupplier - Variable in class org.jgrapht.graph.guava.BaseNetworkAdapter
- vertexSupplier - Variable in class org.jgrapht.graph.guava.BaseValueGraphAdapter
- vertexSupplier(Supplier<V1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the vertex supplier.
- vertexToConnectedSet - Variable in class org.jgrapht.alg.connectivity.ConnectivityInspector
- vertexToHeapNodeMap - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- vertexToHeapNodeMap - Variable in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath.AStarSearchFrontier
- 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.
- vertexToTopo - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- vertexToTopo - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- vertexToVertexData - Variable in class org.jgrapht.alg.connectivity.KosarajuStrongConnectivityInspector
- vertexToVertexNumber - Variable in class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
- VertexTraversalEvent<V> - Class in org.jgrapht.event
-
A traversal event for a graph vertex.
- VertexTraversalEvent(Object, V) - Constructor for class org.jgrapht.event.VertexTraversalEvent
-
Creates a new VertexTraversalEvent.
- vertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector.MyTraversalListener
- vertexTraversed(VertexTraversalEvent<V>) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform the listener that the specified vertex have been visited during the graph traversal.
- vertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.event.TraversalListenerAdapter
- VertexTreeStatus() - Constructor for enum class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl.VertexTreeStatus
- vertexWeight(Set<V>) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut
-
Compute the sum of the weights entering a vertex
- vertexWeightMap - Variable in class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
- vertexWeightMap - Variable in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
- vertexWeightMap - Variable in class org.jgrapht.alg.vertexcover.GreedyVCImpl
- vertexWeightMap - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
- vertexWithAttributesConsumer - Variable in class org.jgrapht.nio.dot.DOTImporter.Consumers
- vertexWithAttributesConsumer - Variable in class org.jgrapht.nio.json.JSONImporter.Consumers
- vertexWithAttributesConsumers - Variable in class org.jgrapht.nio.BaseEventDrivenImporter
- vertexWithAttributesFactory - Variable in class org.jgrapht.nio.dot.DOTImporter
- vertexWithAttributesFactory - Variable in class org.jgrapht.nio.json.JSONImporter
- vertical - Variable in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
- vertices - Variable in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.LabeledPath
-
the vertices in the path
- vertices - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Bijective mapping of vertices onto $\left[0,n-1\right]$
- vertices - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- vertices - Variable in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- vertices - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Vertices of the
contractionGraph
. - vertices - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.HeavyRelaxTask
-
Vertices which edges will be relaxed.
- vertices - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath.LightRelaxTask
-
Vertices which edges will be relaxed.
- vertices - Variable in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
- vertices - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Ordered list of vertices which will be iteratively considered to be included in a matching
- vertices - Variable in class org.jgrapht.generate.netgen.NetworkInfo
-
List of network vertices.
- vertices - Variable in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- vertices - Variable in class org.jgrapht.graph.MaskSubgraph
- vertices - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.RowCSVListener
- vertices - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.NotifyDOTListener
- vertices - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.State
- vertices - Variable in class org.jgrapht.nio.dot.DOTEventDrivenImporter.SubgraphScope
- vertices - Variable in class org.jgrapht.traverse.LexBreadthFirstIterator.BucketList.Bucket
-
Set of vertices currently stored in this bucket.
- vertices() - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable view over the vertices contained in this graph.
- vertices(List<V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
-
Set the generator vertices.
- verticesCollectionName - Variable in class org.jgrapht.nio.json.JSONEventDrivenImporter
- verticesCollectionName - Variable in class org.jgrapht.nio.json.JSONExporter
- verticesCollectionName - Variable in class org.jgrapht.nio.json.JSONImporter
- verticesCount - Variable in class org.jgrapht.nio.csv.CSVEventDrivenImporter.MatrixCSVListener
- verticesCount() - Method in class org.jgrapht.opt.graph.sparse.specifics.IncidenceMatrixSparseUndirectedSpecifics
- verticesCount() - Method in class org.jgrapht.opt.graph.sparse.specifics.NoIncomingNoReindexSparseDirectedSpecifics
- verticesCount() - Method in interface org.jgrapht.opt.graph.sparse.specifics.SparseGraphSpecifics
-
Get the number of vertices
- verticesData - Variable in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Data of each vertex int the
contractionGraph
. - verticesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- verticesQueue - Variable in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Queue of vertices which edges should be relaxed on current iteration.
- VF2AbstractIsomorphismInspector<V,
E> - Class in org.jgrapht.alg.isomorphism -
Base implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2AbstractIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
-
Construct a new base implementation of the VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector<V,
E> - Class in org.jgrapht.alg.isomorphism -
This is an implementation of the VF2 algorithm using its feature of detecting isomorphism between two graphs as described in Cordella et al.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismInspector(Graph<V, E>, Graph<V, E>, Comparator<V>, Comparator<E>, boolean) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
-
Construct a new VF2 isomorphism inspector.
- VF2GraphIsomorphismState<V,
E> - Class in org.jgrapht.alg.isomorphism - VF2GraphIsomorphismState(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismState
- VF2GraphIsomorphismState(VF2State<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismState
- VF2GraphMappingIterator<V,
E> - Class in org.jgrapht.alg.isomorphism -
This class is used to iterate over all existing (isomorphic) mappings between two graphs.
- VF2GraphMappingIterator(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2GraphMappingIterator
- VF2MappingIterator<V,
E> - Class in org.jgrapht.alg.isomorphism - VF2MappingIterator(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2MappingIterator
- VF2State<V,
E> - Class in org.jgrapht.alg.isomorphism -
controls the matching between two graphs according to the VF2 algorithm.
- VF2State(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2State
- VF2State(VF2State<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2State
-
copy constructor
- VF2SubgraphIsomorphismInspector<V,
E> - Class in org.jgrapht.alg.isomorphism -
This is an implementation of the VF2 algorithm using its feature of detecting subgraph isomorphism between two graphs as described in Cordella et al.
- VF2SubgraphIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
-
Construct a new VF2 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.
- VF2SubgraphIsomorphismState<V,
E> - Class in org.jgrapht.alg.isomorphism - VF2SubgraphIsomorphismState(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismState
- VF2SubgraphIsomorphismState(VF2State<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismState
- VF2SubgraphMappingIterator<V,
E> - Class in org.jgrapht.alg.isomorphism -
This class is used to iterate over all existing (subgraph isomorphic) mappings between two graphs.
- VF2SubgraphMappingIterator(GraphOrdering<V, E>, GraphOrdering<V, E>, Comparator<V>, Comparator<E>) - Constructor for class org.jgrapht.alg.isomorphism.VF2SubgraphMappingIterator
- vIn - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
The direction used to enter the parent biconnected component.
- vIndex - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- virtualRoot - Variable in class org.jgrapht.util.AVLTree
-
An auxiliary node which's always present in a tree and doesn't contain any data.
- VisioExporter<V,
E> - Class in org.jgrapht.nio.csv -
Exports a graph to a CSV format that can be imported into MS Visio.
- VisioExporter() - Constructor for class org.jgrapht.nio.csv.VisioExporter
-
Creates a new VisioExporter.
- VisioExporter(Function<V, String>) - Constructor for class org.jgrapht.nio.csv.VisioExporter
-
Creates a new exporter.
- VisitColor() - Constructor for enum class org.jgrapht.traverse.DepthFirstIterator.VisitColor
- visited - Variable in class org.jgrapht.alg.flow.EdmondsKarpMFImpl.VertexExtension
- visited - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
-
Stores some value to indicate whether this node is visited in the current context or not.
- visited - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- visited - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- visited - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- visited - Variable in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- 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
- visitedBackwardVoronoiCells - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilter
-
For every vertex in the contraction graph stores visited Voronoi cells ids by a backward
ContractionHierarchyBFS
. - visitedBackwardVoronoiCells - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilterBuilder
-
Visited Voronoi cells by a backward
ContractionHierarchyBFS
search. - VisitedBitSetImpl() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
-
Constructor
- visitedForwardVoronoiCells - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilter
-
For every vertex in the contraction graph stores visited Voronoi cells ids by a forward
ContractionHierarchyBFS
. - visitedForwardVoronoiCells - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.LocalityFilterBuilder
-
Visited Voronoi cells by a forward
ContractionHierarchyBFS
search. - VisitedHashSetImpl() - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
-
Constructor
- visitedStrategyFactory - Variable in class org.jgrapht.graph.DirectedAcyclicGraph
-
The visited strategy factory to use.
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.io.CSVBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.io.DOTBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.io.GmlBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.io.JsonBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.nio.csv.CSVBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.nio.dot.DOTBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.nio.gml.GmlBaseListener
- visitErrorNode(ErrorNode) - Method in class org.jgrapht.nio.json.JsonBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.io.CSVBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.io.DOTBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.io.GmlBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.io.JsonBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.nio.csv.CSVBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.nio.dot.DOTBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.nio.gml.GmlBaseListener
- visitTerminal(TerminalNode) - Method in class org.jgrapht.nio.json.JsonBaseListener
- visitVertex(ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>, double) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
If necessary updates Voronoi cell id and distance in
voronoiCells
anddistanceToCenter
for vertex. - vLowlink - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- VOCABULARY - Static variable in class org.jgrapht.io.CSVLexer
- VOCABULARY - Static variable in class org.jgrapht.io.CSVParser
- VOCABULARY - Static variable in class org.jgrapht.io.DOTLexer
- VOCABULARY - Static variable in class org.jgrapht.io.DOTParser
- VOCABULARY - Static variable in class org.jgrapht.io.GmlLexer
- VOCABULARY - Static variable in class org.jgrapht.io.GmlParser
- VOCABULARY - Static variable in class org.jgrapht.io.JsonLexer
- VOCABULARY - Static variable in class org.jgrapht.io.JsonParser
- VOCABULARY - Static variable in class org.jgrapht.nio.csv.CSVLexer
- VOCABULARY - Static variable in class org.jgrapht.nio.csv.CSVParser
- VOCABULARY - Static variable in class org.jgrapht.nio.dot.DOTLexer
- VOCABULARY - Static variable in class org.jgrapht.nio.dot.DOTParser
- VOCABULARY - Static variable in class org.jgrapht.nio.gml.GmlLexer
- VOCABULARY - Static variable in class org.jgrapht.nio.gml.GmlParser
- VOCABULARY - Static variable in class org.jgrapht.nio.json.JsonLexer
- VOCABULARY - Static variable in class org.jgrapht.nio.json.JsonParser
- voronoiCells - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagram
-
For each vertex in
contractionGraph
contains id of its Voronoi cell, orNO_VORONOI_CELL
if it does not belong to any cell. - voronoiCells - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
For every vertex stores an id of a corresponding Voronoi cell center.
- voronoiDiagram - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.TransitNodeRouting
-
Voronoi diagram of the graph using
transitVertices
as cells centers. - voronoiDiagram - Variable in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Voronoi diagram for the contraction graph.
- VoronoiDiagram(int[]) - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagram
-
Constructs a new instance for the given
voronoiCells
. - VoronoiDiagramComputation() - Constructor for class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation.VoronoiDiagramComputation
-
Constructs a new instance of the algorithm.
- vOut - Variable in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.MergeInfo
-
The direction used to start the traversal of the child biconnected component.
- vParent - Variable in class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.TreeOrdering.StackEntry
-
Parent vertex of
v
intree
or $null$ ifv
is root oftree
. - vs - Variable in class org.jgrapht.alg.util.FixedSizeIntegerQueue
- vToI - Variable in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
- vToI - Variable in class org.jgrapht.alg.cycle.JohnsonSimpleCycles
- vToI - Variable in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
- vToI - Variable in class org.jgrapht.alg.cycle.TarjanSimpleCycles
W
- w(Graph<V, E>, Set<V>, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
W(a,b,c) is the anticomponent of N(a,b)+{c} that contains c
- waitForTasksCompletion(int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Takes
numOfTasks
tasks from theContractionHierarchyPrecomputation.completionService
. - waitForTasksCompletion(int) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Takes
numOfTasks
tasks from theDeltaSteppingShortestPath.completionService
. - waitForTasksCompletion(int) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Takes
numberOfTasks
tasks from thecompletionService
. - walkDown(BoyerMyrvoldPlanarityInspector.Node) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The walkdown procedure from the original paper.
- walkUp(BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Node, BoyerMyrvoldPlanarityInspector.Edge) - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
The walkup procedure from the original paper.
- wAncestors - Variable in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
- warmStart() - Method in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
-
Greedily compute an initial feasible matching
- warmStart(MatchingAlgorithm<V, E>) - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Calculates an initial feasible matching.
- warning(SAXParseException) - Method in class org.jgrapht.nio.gexf.SimpleGEXFEventDrivenImporter.GEXFHandler
- warning(SAXParseException) - Method in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter.GraphMLHandler
- warning(SAXParseException) - Method in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter.GraphMLHandler
- wasCheckedInThisIteration(BoykovKolmogorovMFImpl.VertexExtension) - Method in class org.jgrapht.alg.flow.BoykovKolmogorovMFImpl
-
Checks if the distance of the
vertex
was updated during this iteration. - 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
- weaklyChordal - Variable in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Contains true if the graph is weakly chordal, otherwise false.
- weight - Variable in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- weight - Variable in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
- weight - Variable in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- weight - Variable in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- weight - Variable in class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator.EppsteinGraphPath
-
Weight of tha path.
- weight - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- weight - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
- weight - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
weight of the vertex
- weight - Variable in class org.jgrapht.graph.GraphWalk
- weight - Variable in class org.jgrapht.graph.IntrusiveWeightedEdge
- weight - Variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- weight - Variable in class org.jgrapht.util.WeightedUnmodifiableSet
- WEIGHT - Static variable in class org.jgrapht.nio.gexf.SimpleGEXFImporter
- WEIGHT - Static variable in class org.jgrapht.nio.gml.GmlEventDrivenImporter.NotifyGmlListener
- WEIGHT - Static variable in class org.jgrapht.nio.json.JSONEventDrivenImporter.NotifyJsonListener
- WEIGHT_ATTRIBUTE_KEY - Static variable in class org.jgrapht.nio.gml.GmlExporter
- WEIGHT_ATTRIBUTE_NAME - Static variable in class org.jgrapht.nio.gexf.GEXFExporter
- WeightCombiner - Interface in org.jgrapht.util
-
Binary operator for edge weights.
- weighted - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
-
Indicates whether we are solving a weighted or unweighted version of the problem
- weighted - Variable in class org.jgrapht.generate.netgen.BipartiteMatchingProblem.BipartiteMatchingProblemImpl
- weighted - Variable in class org.jgrapht.graph.builder.GraphTypeBuilder
- weighted - Variable in class org.jgrapht.graph.DefaultGraphType.Builder
- weighted - Variable in class org.jgrapht.graph.DefaultGraphType
- weighted - Variable in class org.jgrapht.traverse.RandomWalkVertexIterator
- 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.
- WeightedAlgorithm() - Constructor for class org.jgrapht.alg.scoring.EdgeBetweennessCentrality.WeightedAlgorithm
- 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.
- WeightedQueue() - Constructor for class org.jgrapht.alg.scoring.ApBetweennessCentrality.WeightedQueue
- WeightedQueue() - Constructor for class org.jgrapht.alg.scoring.BetweennessCentrality.WeightedQueue
- WeightedSpannerAlgorithm() - Constructor for class org.jgrapht.alg.spanning.GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm
- 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
- weightFunction - Variable in class org.jgrapht.graph.AsWeightedGraph
- weights - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
- weights - Variable in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- weights - Variable in class org.jgrapht.graph.AsWeightedGraph
- weights - Variable in class org.jgrapht.opt.graph.sparse.SparseIntDirectedWeightedGraph
-
The edge weights
- weights - Variable in class org.jgrapht.opt.graph.sparse.SparseIntUndirectedWeightedGraph
-
The edge weights
- 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.
- weightsList - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- weightSum - Variable in class org.jgrapht.alg.scoring.PageRank.Algorithm
- 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 - Enum constant in enum class org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has not been returned via iterator yet.
- WHITE_SPACE - Static variable in class org.jgrapht.nio.tsplib.TSPLIBImporter
- WINDMILL - Enum constant in enum class 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 Class in org.jgrapht.generate
-
WINDMILL and DUTCHWINDMILL Modes for the Constructor
- withFirstPartition(Set<V>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Specify the first of the two bipartite partitions.
- withVertexComparator(Comparator<V>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Adjust the vertex comparator which specifies the vertex order.
- withVertical(boolean) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Adjust whether the layout will be vertical or horizontal.
- WORK_ARRAY_INITIAL_SIZE - Static variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching.DynamicProgrammingPathSolver
- workerSegmentEnd(int, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
Computes end of the working chunk for this task.
- workerSegmentEnd(int, int, int) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Computes end of the working chunk for this task.
- workerSegmentStart(int, int) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionTask
-
Computes start of the working chunk for this task.
- workerSegmentStart(int, int, int) - Method in class org.jgrapht.alg.shortestpath.TransitNodeRoutingPrecomputation
-
Computes start of the working chunk for this task.
- workingGraph - Variable in class org.jgrapht.alg.shortestpath.BaseKDisjointShortestPathsAlgorithm
-
Graph on which shortest paths are searched.
- workingGraph - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut
- writeAttribute(TransformerHandler, String, GEXFExporter.AttributeDetails) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeAttribute(TransformerHandler, String, GraphMLExporter.AttributeDetails) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeAttributeValue(TransformerHandler, String, String) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeBit(boolean) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- writeByte() - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- writeData(TransformerHandler, String, String) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeEdgeAttributes(TransformerHandler) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeEdgeAttributeValues(TransformerHandler, E) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeEdges(TransformerHandler, Graph<V, E>) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeEdges(TransformerHandler, Graph<V, E>) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeFooter(TransformerHandler) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeFooter(TransformerHandler) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeGraph6(Graph<V, E>, List<V>) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- writeGraphEnd(TransformerHandler) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeGraphEnd(TransformerHandler) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeGraphStart(TransformerHandler, Graph<V, E>) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeGraphStart(TransformerHandler, Graph<V, E>) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeHeader(TransformerHandler) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeHeader(TransformerHandler) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeIntInKBits(int, int) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- writeKeys(TransformerHandler) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeMeta(TransformerHandler) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeNodes(TransformerHandler, Graph<V, E>) - Method in class org.jgrapht.nio.graphml.GraphMLExporter
- writeNumberOfVertices(int) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- writeObject(ObjectOutputStream) - Method in class org.jgrapht.graph.guava.ImmutableGraphAdapter
- writeObject(ObjectOutputStream) - Method in class org.jgrapht.graph.guava.ImmutableNetworkAdapter
- writeObject(ObjectOutputStream) - Method in class org.jgrapht.graph.guava.ImmutableValueGraphAdapter
- writeObject(ObjectOutputStream) - Method in class org.jgrapht.graph.guava.MutableGraphAdapter
- writeObject(ObjectOutputStream) - Method in class org.jgrapht.graph.guava.MutableNetworkAdapter
- writeObject(ObjectOutputStream) - Method in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- writeReplace() - Method in class org.jgrapht.util.SupplierUtil.ConstructorSupplier
- writeSparse6(Graph<V, E>, List<V>) - Method in class org.jgrapht.nio.graph6.Graph6Sparse6Exporter
- writeVertexAttributes(TransformerHandler) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeVertexAttributeValues(TransformerHandler, V) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeVertices(TransformerHandler, Graph<V, E>) - Method in class org.jgrapht.nio.gexf.GEXFExporter
- writeWeightsThrough - Variable in class org.jgrapht.graph.AsWeightedGraph
- WS - Static variable in class org.jgrapht.io.DOTLexer
- WS - Static variable in class org.jgrapht.io.DOTParser
- WS - Static variable in class org.jgrapht.io.GmlLexer
- WS - Static variable in class org.jgrapht.io.GmlParser
- WS - Static variable in class org.jgrapht.io.JsonLexer
- WS - Static variable in class org.jgrapht.io.JsonParser
- WS - Static variable in class org.jgrapht.nio.dot.DOTLexer
- WS - Static variable in class org.jgrapht.nio.dot.DOTParser
- WS - Static variable in class org.jgrapht.nio.gml.GmlLexer
- WS - Static variable in class org.jgrapht.nio.gml.GmlParser
- WS - Static variable in class org.jgrapht.nio.json.JsonLexer
- WS - Static variable in class org.jgrapht.nio.json.JsonParser
X
- x - Variable in class org.jgrapht.alg.drawing.model.Point2D
- x - Variable in class org.jgrapht.sux4j.AbstractSuccinctDirectedGraph.CumulativeSuccessors
- x - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeDegrees
- x - Variable in class org.jgrapht.sux4j.AbstractSuccinctUndirectedGraph.CumulativeSuccessors
- x(Graph<V, E>, Set<V>, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
X(a,b,c)=Y(a,b,c)+Z(a,b,c)
- XLINK_SCHEMA_FILENAME - Static variable in class org.jgrapht.nio.graphml.GraphMLEventDrivenImporter
- XLINK_SCHEMA_FILENAME - Static variable in class org.jgrapht.nio.graphml.SimpleGraphMLEventDrivenImporter
Y
- y - Variable in class org.jgrapht.alg.drawing.model.Point2D
- y(Graph<V, E>, Set<V>, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Y(a,b,c) is the union of all anticomponents of N(a,b) that have cardinality strictly greater than r(a,b,c)
- 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
. - YenKShortestPath(Graph<V, E>, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.YenKShortestPath
-
Constructs an instance of the algorithm for the given
graph
andpathValidator
. - 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, Pair<GraphPath<V, E>, Boolean>>>) - Constructor for class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Constructs an instance of the algorithm for given
graph
,source
,sink
andheapSupplier
. - YenShortestPathIterator(Graph<V, E>, V, V, Supplier<AddressableHeap<Double, Pair<GraphPath<V, E>, Boolean>>>, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Constructs an instance of the algorithm for given
graph
,source
,sink
,heapSupplier
andpathValidator
. - YenShortestPathIterator(Graph<V, E>, V, V, PathValidator<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.YenShortestPathIterator
-
Constructs an instance of the algorithm for given
graph
,source
,sink
andpathValidator
. - YenShortestPathIterator.YenShortestPathsTree - Class in org.jgrapht.alg.shortestpath
-
Helper class which represents the shortest paths tree using which the spur parts are computed and appended to the candidate paths
- YenShortestPathsTree(Graph<V, E>, Set<V>, Set<E>, Map<V, Pair<Double, E>>, V) - Constructor for class org.jgrapht.alg.shortestpath.YenShortestPathIterator.YenShortestPathsTree
-
Constructs an instance of the shortest paths tree for the given
maskSubgraph
,maskedVertices
,maskedEdges
,reversedTree
,treeSource
.
Z
- z(Graph<V, E>, Set<V>, V) - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Z(a,b,c) is the set of all (Y(a,b,c)+W(a,b,c))-complete vertices
- zeroBasedNumbering - Variable in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
- zeroBasedNumbering(boolean) - Method in class org.jgrapht.nio.dimacs.DIMACSEventDrivenImporter
-
Set whether to use zero-based numbering for vertices.
- ZhangShashaTreeEditDistance<V,
E> - Class in org.jgrapht.alg.similarity -
Dynamic programming algorithm for computing edit distance between trees.
- ZhangShashaTreeEditDistance(Graph<V, E>, V, Graph<V, E>, V) - Constructor for class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Constructs an instance of the algorithm for the given
tree1
,root1
,tree2
androot2
. - ZhangShashaTreeEditDistance(Graph<V, E>, V, Graph<V, E>, V, ToDoubleFunction<V>, ToDoubleFunction<V>, ToDoubleBiFunction<V, V>) - Constructor for class org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance
-
Constructs an instance of the algorithm for the given
tree1
,root1
,tree2
,root2
,insertCost
,removeCost
andchangeCost
. - ZhangShashaTreeEditDistance.CacheEntry - Class in org.jgrapht.alg.similarity
-
Auxiliary class which is used in
treeDistance()
function to store intermediate edit operations during dynamic programming computation. - ZhangShashaTreeEditDistance.EditOperation<V> - Class in org.jgrapht.alg.similarity
-
Represents elementary action which changes the structure of a tree.
- ZhangShashaTreeEditDistance.OperationType - Enum Class in org.jgrapht.alg.similarity
-
Type of an edit operation.
- ZhangShashaTreeEditDistance.TreeOrdering - Class in org.jgrapht.alg.similarity
-
Auxiliary class which for computes keyroot vertices, tree ordering and $l()$ function for a particular tree.
- ZhangShashaTreeEditDistance.TreeOrdering.StackEntry - Class in org.jgrapht.alg.similarity
-
Auxiliary class which stores all needed variables to emulate recursive execution of DFS algorithm in
computeKeyrootsAndMapping()
method.
_
- _ATN - Static variable in class org.jgrapht.io.CSVLexer
- _ATN - Static variable in class org.jgrapht.io.CSVParser
- _ATN - Static variable in class org.jgrapht.io.DOTLexer
- _ATN - Static variable in class org.jgrapht.io.DOTParser
- _ATN - Static variable in class org.jgrapht.io.GmlLexer
- _ATN - Static variable in class org.jgrapht.io.GmlParser
- _ATN - Static variable in class org.jgrapht.io.JsonLexer
- _ATN - Static variable in class org.jgrapht.io.JsonParser
- _ATN - Static variable in class org.jgrapht.nio.csv.CSVLexer
- _ATN - Static variable in class org.jgrapht.nio.csv.CSVParser
- _ATN - Static variable in class org.jgrapht.nio.dot.DOTLexer
- _ATN - Static variable in class org.jgrapht.nio.dot.DOTParser
- _ATN - Static variable in class org.jgrapht.nio.gml.GmlLexer
- _ATN - Static variable in class org.jgrapht.nio.gml.GmlParser
- _ATN - Static variable in class org.jgrapht.nio.json.JsonLexer
- _ATN - Static variable in class org.jgrapht.nio.json.JsonParser
- _decisionToDFA - Static variable in class org.jgrapht.io.CSVLexer
- _decisionToDFA - Static variable in class org.jgrapht.io.CSVParser
- _decisionToDFA - Static variable in class org.jgrapht.io.DOTLexer
- _decisionToDFA - Static variable in class org.jgrapht.io.DOTParser
- _decisionToDFA - Static variable in class org.jgrapht.io.GmlLexer
- _decisionToDFA - Static variable in class org.jgrapht.io.GmlParser
- _decisionToDFA - Static variable in class org.jgrapht.io.JsonLexer
- _decisionToDFA - Static variable in class org.jgrapht.io.JsonParser
- _decisionToDFA - Static variable in class org.jgrapht.nio.csv.CSVLexer
- _decisionToDFA - Static variable in class org.jgrapht.nio.csv.CSVParser
- _decisionToDFA - Static variable in class org.jgrapht.nio.dot.DOTLexer
- _decisionToDFA - Static variable in class org.jgrapht.nio.dot.DOTParser
- _decisionToDFA - Static variable in class org.jgrapht.nio.gml.GmlLexer
- _decisionToDFA - Static variable in class org.jgrapht.nio.gml.GmlParser
- _decisionToDFA - Static variable in class org.jgrapht.nio.json.JsonLexer
- _decisionToDFA - Static variable in class org.jgrapht.nio.json.JsonParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.CSVLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.CSVParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.DOTLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.DOTParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.GmlLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.GmlParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.JsonLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.io.JsonParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.csv.CSVLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.csv.CSVParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.dot.DOTLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.dot.DOTParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.gml.GmlLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.gml.GmlParser
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.json.JsonLexer
- _LITERAL_NAMES - Static variable in class org.jgrapht.nio.json.JsonParser
- _serializedATN - Static variable in class org.jgrapht.io.CSVLexer
- _serializedATN - Static variable in class org.jgrapht.io.CSVParser
- _serializedATN - Static variable in class org.jgrapht.io.DOTLexer
- _serializedATN - Static variable in class org.jgrapht.io.DOTParser
- _serializedATN - Static variable in class org.jgrapht.io.GmlLexer
- _serializedATN - Static variable in class org.jgrapht.io.GmlParser
- _serializedATN - Static variable in class org.jgrapht.io.JsonLexer
- _serializedATN - Static variable in class org.jgrapht.io.JsonParser
- _serializedATN - Static variable in class org.jgrapht.nio.csv.CSVLexer
- _serializedATN - Static variable in class org.jgrapht.nio.csv.CSVParser
- _serializedATN - Static variable in class org.jgrapht.nio.dot.DOTLexer
- _serializedATN - Static variable in class org.jgrapht.nio.dot.DOTParser
- _serializedATN - Static variable in class org.jgrapht.nio.gml.GmlLexer
- _serializedATN - Static variable in class org.jgrapht.nio.gml.GmlParser
- _serializedATN - Static variable in class org.jgrapht.nio.json.JsonLexer
- _serializedATN - Static variable in class org.jgrapht.nio.json.JsonParser
- _sharedContextCache - Static variable in class org.jgrapht.io.CSVLexer
- _sharedContextCache - Static variable in class org.jgrapht.io.CSVParser
- _sharedContextCache - Static variable in class org.jgrapht.io.DOTLexer
- _sharedContextCache - Static variable in class org.jgrapht.io.DOTParser
- _sharedContextCache - Static variable in class org.jgrapht.io.GmlLexer
- _sharedContextCache - Static variable in class org.jgrapht.io.GmlParser
- _sharedContextCache - Static variable in class org.jgrapht.io.JsonLexer
- _sharedContextCache - Static variable in class org.jgrapht.io.JsonParser
- _sharedContextCache - Static variable in class org.jgrapht.nio.csv.CSVLexer
- _sharedContextCache - Static variable in class org.jgrapht.nio.csv.CSVParser
- _sharedContextCache - Static variable in class org.jgrapht.nio.dot.DOTLexer
- _sharedContextCache - Static variable in class org.jgrapht.nio.dot.DOTParser
- _sharedContextCache - Static variable in class org.jgrapht.nio.gml.GmlLexer
- _sharedContextCache - Static variable in class org.jgrapht.nio.gml.GmlParser
- _sharedContextCache - Static variable in class org.jgrapht.nio.json.JsonLexer
- _sharedContextCache - Static variable in class org.jgrapht.nio.json.JsonParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.CSVLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.CSVParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.DOTLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.DOTParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.GmlLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.GmlParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.JsonLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.io.JsonParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.csv.CSVLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.csv.CSVParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.dot.DOTLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.dot.DOTParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.gml.GmlLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.gml.GmlParser
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.json.JsonLexer
- _SYMBOLIC_NAMES - Static variable in class org.jgrapht.nio.json.JsonParser
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form
VertexDegreeComparator.of(Graph)