A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
All Classes All Packages
All Classes All Packages
A
- AbstractBaseGraph<V,E> - Class in org.jgrapht.graph
-
The most general implementation of the
Graph
interface. - AbstractBaseGraph(Supplier<V>, Supplier<E>, GraphType) - Constructor for class org.jgrapht.graph.AbstractBaseGraph
-
Construct a new graph.
- AbstractBaseGraph(Supplier<V>, Supplier<E>, GraphType, GraphSpecificsStrategy<V, E>) - Constructor for class org.jgrapht.graph.AbstractBaseGraph
-
Construct a new graph.
- AbstractCapacitatedMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
This is an abstract class for capacitated minimum spanning tree algorithms.
- AbstractCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>) - Constructor for class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
Construct a new abstract capacitated minimum spanning tree algorithm.
- AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation - Class in org.jgrapht.alg.spanning
-
This class represents a solution instance by managing the labels and the partition mapping.
- AbstractFundamentalCycleBasis<V,E> - Class in org.jgrapht.alg.cycle
-
A base implementation for the computation of a fundamental cycle basis of a graph.
- AbstractFundamentalCycleBasis(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
-
Constructor
- AbstractGraph<V,E> - Class in org.jgrapht.graph
-
A skeletal implementation of the
Graph
interface, to minimize the effort required to implement graph interfaces. - AbstractGraph() - Constructor for class org.jgrapht.graph.AbstractGraph
-
Construct a new empty graph object.
- AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>> - Class in org.jgrapht.graph.builder
-
Base class for builders of
Graph
- AbstractGraphBuilder(G) - Constructor for class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Creates a builder based on
baseGraph
. - AbstractGraphIterator<V,E> - Class in org.jgrapht.traverse
-
An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.
- AbstractGraphIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.AbstractGraphIterator
-
Create a new iterator
- AbstractImmutableBigGraphAdapter<E extends it.unimi.dsi.fastutil.longs.LongLongPair> - 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 extends it.unimi.dsi.fastutil.ints.IntIntPair> - Class in org.jgrapht.webgraph
-
An abstract base class for adapters using WebGraph's
ImmutableGraph
. - AbstractImmutableGraphAdapter(ImmutableGraph) - Constructor for class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- 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. - active - Variable in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
- 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.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.util.WeightedUnmodifiableSet
- addAllEdges(Graph<? super V, ? super E>, Graph<V, E>, Collection<? extends E>) - Static method in class org.jgrapht.Graphs
-
Adds a subset of the edges of the specified source graph to the specified destination graph.
- addAllVertices(List<Integer>, double) - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Add multiple vertices in the vertex cover.
- addAllVertices(Graph<? super V, ? super E>, Collection<? extends V>) - Static method in class org.jgrapht.Graphs
-
Adds all of the specified vertices to the destination graph.
- addEdge(E) - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Add a vertex edge
- addEdge(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(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(Graph<V, E>, V, V, double) - Static method in class org.jgrapht.Graphs
-
Creates a new edge and adds it to the specified graph similarly to the
Graph.addEdge(Object, Object)
method. - addEdge(V, V) - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in interface org.jgrapht.Graph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsGraphUnion
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsSubgraph
-
Add an edge to the subgraph.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsUndirectedGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.AsUnmodifiableGraph
- addEdge(V, V) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds an edge to the graph being built.
- addEdge(V, V) - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.DefaultListenableGraph
- addEdge(V, V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.EdgeReversedGraph
- addEdge(V, V) - Method in class org.jgrapht.graph.GraphDelegator
-
Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.
- addEdge(V, V) - Method in class org.jgrapht.graph.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.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. - addElement(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Adds a new element to the data structure in its own set.
- addElementBeforeNode(DoublyLinkedList.ListNode<E>, E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified element before the specified
successor
in this list. - addElementFirst(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified element at the front of this list.
- addElementLast(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified element at the end of this list.
- addFirst(E) - Method in class org.jgrapht.util.DoublyLinkedList
- addGraph(Graph<? extends V, ? extends E>) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds all the vertices and all the edges of the
sourceGraph
to the graph being built. - addGraph(Graph<? super V, ? super E>, Graph<V, E>) - Static method in class org.jgrapht.Graphs
-
Adds all the vertices and all the edges of the specified source graph to the specified destination graph.
- 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.
- 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.
- 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.
- 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 - addNeighbor(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
Add a neighbor.
- addNode(int, DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
at the specified position in this list. - addNodeBefore(DoublyLinkedList.ListNode<E>, DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
before the specifiedsuccessor
in this list. - addNodeFirst(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
at the front of this list. - addNodeLast(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Inserts the specified
node
at the end of this list. - addOutgoingEdge(E) - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
Add an outgoing edge.
- addOutgoingEdges(Graph<V, E>, V, Iterable<V>) - Static method in class org.jgrapht.Graphs
-
Add edges from one source vertex to multiple target vertices.
- addToIndex(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
-
Add an edge to the index.
- addToIndex(V, V, E) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
-
Add an edge to the index.
- addTraversalListener(TraversalListener<V, E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
- addTraversalListener(TraversalListener<V, E>) - Method in interface org.jgrapht.traverse.GraphIterator
-
Adds the specified traversal listener to this iterator.
- 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.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.sux4j.AbstractSuccinctGraph
- addVertex(Integer) - Method in class org.jgrapht.webgraph.AbstractImmutableGraphAdapter
- addVertex(Long) - Method in class org.jgrapht.webgraph.AbstractImmutableBigGraphAdapter
- 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.
- 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(V...) - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Adds each vertex of
vertices
to the graph being built. - ADJACENCY_LIST - org.jgrapht.nio.csv.CSVFormat
-
Adjacency list
- adjEdgesHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- admissibleHeuristic - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- AHUForestIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted forests.
- AHUForestIsomorphismInspector(Graph<V, E>, Set<V>, Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Construct a new AHU rooted forest isomorphism inspector.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree<V,E> - Class in org.jgrapht.alg.spanning
-
Implementation of an algorithm for the capacitated minimum spanning tree problem using a cyclic exchange neighborhood, based on Ravindra K.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V, E>, Graph<V, E>, V, double, Map<V, Double>, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm with the proposed initial solution.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V, E>, Graph<V, E>, V, double, Map<V, Double>, int, boolean, boolean, boolean, boolean, int, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm with the proposed initial solution.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>, int, boolean, int, boolean, boolean, boolean, int, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm.
- AhujaOrlinSharmaCapacitatedMinimumSpanningTree(Graph<V, E>, V, double, Map<V, Double>, int, int) - Constructor for class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
-
Constructs a new instance of this algorithm.
- AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E> - Class in org.jgrapht.alg.cycle
-
Implementation of an algorithm for the local augmentation problem for the cyclic exchange neighborhood, i.e.
- AhujaOrlinSharmaCyclicExchangeLocalAugmentation(Graph<V, E>, int, Map<V, Integer>, boolean) - Constructor for class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Constructs an algorithm with given inputs
- AHURootedTreeIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two rooted trees.
- AHURootedTreeIsomorphismInspector(Graph<V, E>, V, Graph<V, E>, V) - Constructor for class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Construct a new AHU rooted tree isomorphism inspector.
- AHUUnrootedTreeIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
This is an implementation of the AHU algorithm for detecting an (unweighted) isomorphism between two unrooted trees.
- AHUUnrootedTreeIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Construct a new AHU unrooted tree isomorphism inspector.
- AliasMethodSampler - Class in org.jgrapht.alg.util
-
The alias method for sampling from a discrete probability distribution.
- AliasMethodSampler(double[]) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- AliasMethodSampler(double[], long) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- AliasMethodSampler(double[], Random) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- AliasMethodSampler(double[], Random, double) - Constructor for class org.jgrapht.alg.util.AliasMethodSampler
-
Constructor
- ALL - org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- 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.
- allowCycles(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether the graph will allow cycles.
- allowingMultipleEdges(boolean) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set whether the graph will allow multiple (parallel) edges between the same two vertices.
- allowingSelfLoops(boolean) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set whether the graph will allow self loops (edges with same source and target vertices).
- allowMultipleEdges(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether to allow multiple edges.
- allowSelfLoops(boolean) - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set whether to allow self-loops.
- 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. - ANYURI - 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.
- 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
- ArrayUnenforcedSet<E> - Class in org.jgrapht.util
-
Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness property in the data structure itself.
- ArrayUnenforcedSet() - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs a new empty set
- ArrayUnenforcedSet(int) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs an empty set with the specified initial capacity.
- ArrayUnenforcedSet(Collection<? extends E>) - Constructor for class org.jgrapht.util.ArrayUnenforcedSet
-
Constructs a set containing the elements of the specified collection.
- ArrayUnenforcedSetEdgeSetFactory<V,E> - Class in org.jgrapht.graph.specifics
-
An edge set factory which creates
ArrayUnenforcedSet
of size 1, suitable for small degree vertices. - ArrayUnenforcedSetEdgeSetFactory() - Constructor for class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
- ArrayUtil - Class in org.jgrapht.util
-
Utility class to simplify handling of arrays.
- ASCENDING - 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.
- 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 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.
- 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.
- AsSubgraph<V,E> - Class in org.jgrapht.graph
-
A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.
- AsSubgraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsSubgraph
-
Creates a new induced Subgraph with all vertices included.
- AsSubgraph(Graph<V, E>, Set<? extends V>) - Constructor for class org.jgrapht.graph.AsSubgraph
-
Creates a new induced subgraph.
- AsSubgraph(Graph<V, E>, Set<? extends V>, Set<? extends E>) - Constructor for class org.jgrapht.graph.AsSubgraph
-
Creates a new subgraph.
- AsSynchronizedGraph<V,E> - Class in org.jgrapht.graph.concurrent
-
Create a synchronized (thread-safe) Graph backed by the specified Graph.
- AsSynchronizedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Constructor for AsSynchronizedGraph with default settings (cache disabled, non-fair mode, and copyless mode disabled).
- AsSynchronizedGraph.Builder<V,E> - Class in org.jgrapht.graph.concurrent
-
A builder for
AsSynchronizedGraph
. - AStarAdmissibleHeuristic<V> - Interface in org.jgrapht.alg.interfaces
-
Interface for an admissible heuristic used in A* search.
- AStarShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
A* shortest path.
- AStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Create a new instance of the A* shortest path algorithm.
- AStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>, Supplier<AddressableHeap<Double, V>>) - Constructor for class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Create a new instance of the A* shortest path algorithm.
- asUndirected() - Method in class org.jgrapht.graph.DefaultGraphType
- asUndirected() - Method in interface org.jgrapht.GraphType
-
Create an undirected variant of the current graph type.
- AsUndirectedGraph<V,E> - Class in org.jgrapht.graph
-
An undirected view of the backing directed graph specified in the constructor.
- AsUndirectedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUndirectedGraph
-
Constructor for AsUndirectedGraph.
- asUnmodifiable() - Method in class org.jgrapht.graph.DefaultGraphType
- asUnmodifiable() - Method in interface org.jgrapht.GraphType
-
Create an unmodifiable variant of the current graph type.
- AsUnmodifiableGraph<V,E> - Class in org.jgrapht.graph
-
An unmodifiable view of the backing graph specified in the constructor.
- AsUnmodifiableGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUnmodifiableGraph
-
Creates a new unmodifiable graph based on the specified backing graph.
- asUnweighted() - Method in class org.jgrapht.graph.DefaultGraphType
- asUnweighted() - Method in interface org.jgrapht.GraphType
-
Create an unweighted variant of the current graph type.
- AsUnweightedGraph<V,E> - Class in org.jgrapht.graph
-
Provides an unweighted view on a graph.
- AsUnweightedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.AsUnweightedGraph
-
Constructor for AsUnweightedGraph.
- asWeighted() - Method in class org.jgrapht.graph.DefaultGraphType
- asWeighted() - Method in interface org.jgrapht.GraphType
-
Create a weighted variant of the current graph type.
- AsWeightedGraph<V,E> - Class in org.jgrapht.graph
-
Provides a weighted view of a graph.
- AsWeightedGraph(Graph<V, E>, Function<E, Double>, boolean, boolean) - Constructor for class org.jgrapht.graph.AsWeightedGraph
-
Constructor for AsWeightedGraph which uses a weight function to compute edge weights.
- AsWeightedGraph(Graph<V, E>, Map<E, Double>) - Constructor for class org.jgrapht.graph.AsWeightedGraph
-
Constructor for AsWeightedGraph where the weights are provided through a map.
- AsWeightedGraph(Graph<V, E>, Map<E, Double>, boolean) - Constructor for class org.jgrapht.graph.AsWeightedGraph
-
Constructor for AsWeightedGraph which allows weight write propagation to be requested explicitly.
- attractiveForce(double) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the attractive force.
- Attribute - Interface in org.jgrapht.nio
-
An attribute
- AttributeType - Enum in org.jgrapht.nio
-
Denotes the type of an attribute.
- 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.TreeNode<T> - Class in org.jgrapht.util
-
Container holding the values stored in the tree.
B
- backingSet - Variable in class org.jgrapht.util.WeightedUnmodifiableSet
- BarabasiAlbertForestGenerator<V,E> - Class in org.jgrapht.generate
-
Barabási-Albert growth and preferential attachment forest generator.
- BarabasiAlbertForestGenerator(int, int) - Constructor for class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Constructor
- BarabasiAlbertForestGenerator(int, int, long) - Constructor for class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Constructor
- BarabasiAlbertForestGenerator(int, int, Random) - Constructor for class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Constructor
- BarabasiAlbertGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Barabási-Albert growth and preferential attachment graph generator.
- BarabasiAlbertGraphGenerator(int, int, int) - Constructor for class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Constructor
- BarabasiAlbertGraphGenerator(int, int, int, long) - Constructor for class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Constructor
- BarabasiAlbertGraphGenerator(int, int, int, Random) - Constructor for class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Constructor
- 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.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.
- 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 extends com.google.common.graph.Graph<V>> - 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.
- BaseIntrusiveEdgesSpecifics<V,E,IE extends org.jgrapht.graph.IntrusiveEdge> - Class in org.jgrapht.graph
-
A base implementation for the intrusive edges specifics.
- BaseIntrusiveEdgesSpecifics(Map<E, IE>) - Constructor for class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Constructor
- BaseManyToManyShortestPathsImpl(Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
-
Constructs an instance for the given
sources
andtargets
. - BaseNetworkAdapter<V,E,N extends com.google.common.graph.Network<V,E>> - Class in org.jgrapht.graph.guava
-
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.
- baseType - Variable in class org.jgrapht.graph.AsSubgraph
- baseType - Variable in class org.jgrapht.graph.MaskSubgraph
- BaseValueGraphAdapter<V,W,VG extends com.google.common.graph.ValueGraph<V,W>> - Class in org.jgrapht.graph.guava
-
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
- 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.OverflowStrategy - Enum in org.jgrapht.alg.scoring
-
Strategy followed when counting paths.
- BFSShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
The BFS Shortest Path algorithm.
- BFSShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Construct a new instance.
- BhandariKDisjointShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of Bhandari algorithm for finding $K$ edge-disjoint shortest paths.
- BhandariKDisjointShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths
-
Creates a new instance of the algorithm.
- BiconnectivityInspector<V,E> - Class in org.jgrapht.alg.connectivity
-
Allows obtaining various connectivity aspects of a graph.
- BiconnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Constructs a new BiconnectivityInspector
- bidiakisCubeGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- BidirectionalAStarShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
A bidirectional version of A* algorithm.
- BidirectionalAStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Constructs a new instance of the algorithm for a given graph and heuristic.
- BidirectionalAStarShortestPath(Graph<V, E>, AStarAdmissibleHeuristic<V>, Supplier<AddressableHeap<Double, V>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Constructs a new instance of the algorithm for a given graph, heuristic and heap supplier.
- BidirectionalDijkstraShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
A bidirectional version of Dijkstra's algorithm.
- BidirectionalDijkstraShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BidirectionalDijkstraShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BidirectionalDijkstraShortestPath(Graph<V, E>, double, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BidirectionalDijkstraShortestPath(Graph<V, E>, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Constructs a new instance for a specified graph.
- BinaryLiftingLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Algorithm for computing lowest common ancestors in rooted trees and forests using the binary lifting method.
- BinaryLiftingLCAFinder(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Construct a new instance of the algorithm.
- BinaryLiftingLCAFinder(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Construct a new instance of the algorithm.
- 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.
- bitSetCover - Variable in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
- BitSetCover(int, int) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Construct a new empty vertex cover as a BitSet.
- BitSetCover(RecursiveExactVCImpl.BitSetCover) - Constructor for class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Copy constructor
- BLACK - org.jgrapht.traverse.DepthFirstIterator.VisitColor
-
Vertex has been returned via iterator, and we're done with all of its out-edges.
- blanusaFirstSnarkGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- blanusaSecondSnarkGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- BlockCutpointGraph<V,E> - Class in org.jgrapht.alg.connectivity
-
A Block-Cutpoint graph (also known as a block-cut tree).
- BlockCutpointGraph(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Constructs a Block-Cutpoint graph
- BlossomVOptions - Class in org.jgrapht.alg.matching.blossom.v5
-
BlossomVOptions that define the strategies to use during the algorithm for updating duals and initializing the matching
- BlossomVOptions() - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Constructs a default set of options for the algorithm
- BlossomVOptions(BlossomVOptions.InitializationType) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Constructs a new options instance with a
initializationType
- BlossomVOptions(BlossomVOptions.InitializationType, BlossomVOptions.DualUpdateStrategy, boolean, boolean) - Constructor for class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Constructs a custom set of options for the algorithm
- BlossomVOptions.DualUpdateStrategy - Enum in org.jgrapht.alg.matching.blossom.v5
-
Enum for choosing dual updates strategy
- BlossomVOptions.InitializationType - Enum in org.jgrapht.alg.matching.blossom.v5
-
Enum for types of matching initialization
- BOOLEAN - org.jgrapht.nio.AttributeType
- BOOLEAN - 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.
- 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
. - 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
. - 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.
- brinkmannGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- BronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Bron-Kerbosch maximal clique enumeration algorithm.
- BronKerboschCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.BronKerboschCliqueFinder
-
Constructs a new clique finder.
- BronKerboschCliqueFinder(Graph<V, E>, long, TimeUnit) - Constructor for class org.jgrapht.alg.clique.BronKerboschCliqueFinder
-
Constructs a new clique finder.
- BrownBacktrackColoring<V,E> - Class in org.jgrapht.alg.color
-
Brown graph coloring algorithm.
- BrownBacktrackColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.BrownBacktrackColoring
-
Construct a new Brown backtracking algorithm.
- buckyBallGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- build() - Method in class org.jgrapht.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.
- buildAsUnmodifiable() - Method in class org.jgrapht.graph.builder.AbstractGraphBuilder
-
Build an unmodifiable version graph.
- Builder() - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Construct a new Builder with non-fair mode, cache disabled, and copyless mode disabled.
- Builder() - Constructor for class org.jgrapht.graph.DefaultGraphType.Builder
-
Construct a new Builder.
- Builder(boolean, boolean) - Constructor for class org.jgrapht.graph.DefaultGraphType.Builder
-
Construct a new Builder.
- Builder(AsSynchronizedGraph<V, E>) - Constructor for class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Construct a new Builder matching the settings of an existing graph.
- Builder(GraphType) - Constructor for class org.jgrapht.graph.DefaultGraphType.Builder
-
Construct a new Builder.
- buildGraph() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the actual graph.
- buildGraphBuilder() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the graph and acquire a
GraphBuilder
in order to add vertices and edges. - buildType() - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Build the graph type.
- buildWalk() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Build final walk
- bullGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- butterflyGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
C
- cacheDisable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph without caching.
- cacheEnable() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph.Builder
-
Request a synchronized graph with caching.
- calculateAttractiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the repulsive forces between vertices connected with edges.
- calculateDensest() - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
-
Algorithm to compute max density subgraph Performs binary search on the initial interval lower-upper until interval is smaller than epsilon In case no solution is found because epsilon is too big, the computation continues until a (first) solution is found, thereby avoiding to return an empty graph.
- calculateDensest() - Method in interface org.jgrapht.alg.interfaces.MaximumDensitySubgraphAlgorithm
-
Calculate a maximum density subgraph
- calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.EdmondsKarpMFImpl
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - calculateMaximumFlow(V, V) - Method in class org.jgrapht.alg.flow.PushRelabelMFImpl
-
Sets current source to
source
, current sink tosink
, then calculates maximum flow fromsource
tosink
. - calculateMinCut() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Calculates the minimum cut in the graph, that is, the minimum cut over all $s-t$ pairs.
- calculateMinCut(Set<V>, boolean) - Method in class org.jgrapht.alg.flow.PadbergRaoOddMinimumCutset
-
Calculates the minimum odd cut.
- calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
- calculateMinCut(V, V) - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- calculateMinCut(V, V) - Method in interface org.jgrapht.alg.interfaces.MinimumSTCutAlgorithm
-
Computes a minimum capacity $s-t$ cut.
- calculateRepulsiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Calculate the repulsive forces between vertices
- calculateRepulsiveForces(Graph<V, E>, LayoutModel2D<V>) - Method in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
- calculateResultingSpanningTree() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Calculates the resulting spanning tree based on this solution representation.
- calculateShortestPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BhandariKDisjointShortestPaths
- calculateShortestPath(V, V) - Method in class org.jgrapht.alg.shortestpath.SuurballeKDisjointShortestPaths
- calculateSourcePartition() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Calculate the set of reachable vertices from $s$ in the residual graph.
- cameFrom - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- CAP_INF - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
A capacity which is considered to be infinite.
- CapacitatedSpanningTreeAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a capacitated (minimum) spanning tree of a given connected graph with a designated root vertex.
- CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V,E> - Interface in org.jgrapht.alg.interfaces
-
A spanning tree.
- CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the spanning tree interface.
- CapacitatedSpanningTreeImpl(Map<V, Integer>, Map<Integer, Pair<Set<V>, Double>>, Set<E>, double) - Constructor for class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
-
Construct a new capacitated spanning tree.
- CapacitatedSpanningTreeSolutionRepresentation() - Constructor for class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Constructs a new solution representation for the CMST problem.
- CapacitatedSpanningTreeSolutionRepresentation(Map<V, Integer>, Map<Integer, Pair<Set<V>, Double>>) - Constructor for class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Constructs a new solution representation for the CMST problem based on
labels
andpartition
. - capacity - Variable in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
-
the maximal capacity for each subtree.
- 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
- CapacityScalingMinimumCostFlow<V,E> - Class in org.jgrapht.alg.flow.mincost
-
This class computes a solution to a minimum cost flow problem using the successive shortest path algorithm with capacity scaling.
- CapacityScalingMinimumCostFlow() - Constructor for class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Constructs a new instance of the algorithm which uses default scaling factor.
- CapacityScalingMinimumCostFlow(int) - Constructor for class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Constructs a new instance of the algorithm with custom
scalingFactor
. - CENTER_VERTEX - Static variable in class org.jgrapht.generate.StarGraphGenerator
- CHANGE - org.jgrapht.alg.similarity.ZhangShashaTreeEditDistance.OperationType
-
Indicates that an edit operation is changing a vertex in one tree to a vertex in another three.
- checkGraph(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Checks that graph is undirected, complete, and non-empty
- ChinesePostman<V,E> - Class in org.jgrapht.alg.cycle
-
This class solves the Chinese Postman Problem (CPP), also known as the Route Inspection Problem.
- ChinesePostman() - Constructor for class org.jgrapht.alg.cycle.ChinesePostman
- CHManyToManyShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Efficient algorithm for the many-to-many shortest paths problem based on contraction hierarchy.
- CHManyToManyShortestPaths(ContractionHierarchyPrecomputation.ContractionHierarchy<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
contractionHierarchy
. - CHManyToManyShortestPaths(Graph<V, E>, ThreadPoolExecutor) - Constructor for class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
graph
andexecutor
. - ChordalGraphColoring<V,E> - Class in org.jgrapht.alg.color
-
Calculates a minimum vertex coloring for a chordal graph.
- ChordalGraphColoring(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.ChordalGraphColoring
-
Creates a new ChordalGraphColoring instance.
- ChordalGraphColoring(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.color.ChordalGraphColoring
-
Creates a new ChordalGraphColoring instance.
- ChordalGraphIndependentSetFinder<V,E> - Class in org.jgrapht.alg.independentset
-
Calculates a maximum cardinality independent set in a chordal graph.
- ChordalGraphIndependentSetFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Creates a new ChordalGraphIndependentSetFinder instance.
- ChordalGraphIndependentSetFinder(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Creates a new ChordalGraphIndependentSetFinder instance.
- ChordalGraphMaxCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Calculates a maximum cardinality clique in a chordal graph.
- ChordalGraphMaxCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Creates a new ChordalGraphMaxCliqueFinder instance.
- ChordalGraphMaxCliqueFinder(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Creates a new ChordalGraphMaxCliqueFinder instance.
- ChordalGraphMinimalVertexSeparatorFinder<V,E> - Class in org.jgrapht.alg.cycle
-
Allows obtaining a mapping of all minimal vertex separators of a graph to their multiplicities
- ChordalGraphMinimalVertexSeparatorFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.ChordalGraphMinimalVertexSeparatorFinder
-
Creates new
ChordalGraphMinimalVertexSeparatorFinder
instance. - ChordalityInspector<V,E> - Class in org.jgrapht.alg.cycle
-
Tests whether a graph is chordal.
- ChordalityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.ChordalityInspector
-
Creates a chordality inspector for
graph
, which usesMaximumCardinalityIterator
as a default iterator. - ChordalityInspector(Graph<V, E>, ChordalityInspector.IterationOrder) - Constructor for class org.jgrapht.alg.cycle.ChordalityInspector
-
Creates a chordality inspector for
graph
, which uses an iterator defined by the second parameter as an internal iterator. - ChordalityInspector.IterationOrder - Enum in org.jgrapht.alg.cycle
-
Specifies internal iterator type.
- ChristofidesThreeHalvesApproxMetricTSP<V,E> - Class in org.jgrapht.alg.tour
-
A $3/2$-approximation algorithm for the metric TSP problem.
- ChristofidesThreeHalvesApproxMetricTSP() - Constructor for class org.jgrapht.alg.tour.ChristofidesThreeHalvesApproxMetricTSP
- chvatalGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- circularIterator(E) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns a
DoublyLinkedList.NodeIterator
that starts at the firstDoublyLinkedList.ListNode
of this list that is equal to the specifiedfirstElement
, iterates in forward direction over the end of this list until the first node. - CircularLayoutAlgorithm2D<V,E> - Class in org.jgrapht.alg.drawing
-
Circular layout.
- CircularLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
-
Create a new layout algorithm
- CircularLayoutAlgorithm2D(double) - Constructor for class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
-
Create a new layout algorithm
- CircularLayoutAlgorithm2D(double, Comparator<V>) - Constructor for class org.jgrapht.alg.drawing.CircularLayoutAlgorithm2D
-
Create a new layout algorithm.
- ClarksonTwoApproxVCImpl<V,E> - Class in org.jgrapht.alg.vertexcover
-
Implementation of the 2-opt algorithm for a minimum weighted vertex cover by Clarkson, Kenneth L.
- ClarksonTwoApproxVCImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
-
Constructs a new ClarksonTwoApproxVCImpl instance where all vertices have uniform weights.
- ClarksonTwoApproxVCImpl(Graph<V, E>, Map<V, Double>) - Constructor for class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
-
Constructs a new ClarksonTwoApproxVCImpl instance
- clawGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- cleanup() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Release any memory held.
- cleanUp() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Cleans up the solution representation by removing all empty sets from the partition.
- clear() - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Empty the queue.
- clear() - Method in class org.jgrapht.util.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.
- clearPathLimit() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
This is the default behaviour of the algorithm.
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayImpl
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedArrayListImpl
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedBitSetImpl
- clearVisited(int) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.VisitedHashSetImpl
- clearVisited(int) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.VisitedStrategy
-
Clear the visited state of the given topological index.
- clebschGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- CliqueAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
Algorithm to compute a (weighted) Clique in a graph.
- CliqueAlgorithm.Clique<V> - Interface in org.jgrapht.alg.interfaces
-
A Clique
- CliqueAlgorithm.CliqueImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of a (weighted) clique
- CliqueImpl(Set<V>) - Constructor for class org.jgrapht.alg.interfaces.CliqueAlgorithm.CliqueImpl
- CliqueImpl(Set<V>, double) - Constructor for class org.jgrapht.alg.interfaces.CliqueAlgorithm.CliqueImpl
- CliqueMinimalSeparatorDecomposition<V,E> - Class in org.jgrapht.alg.clique
-
Clique Minimal Separator Decomposition using MCS-M+ and Atoms algorithm as described in Berry et al.
- CliqueMinimalSeparatorDecomposition(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Setup a clique minimal separator decomposition on undirected graph
g
. - clone() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns a shallow copy of this solution representation instance.
- clone() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a shallow copy of this graph instance.
- clone() - Method in class org.jgrapht.graph.DefaultListenableGraph
- 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.
- 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
- 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.
- ClosestFirstIterator<V,E> - Class in org.jgrapht.traverse
-
A closest-first iterator for a directed or undirected graph.
- ClosestFirstIterator(Graph<V, E>, Iterable<V>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, Iterable<V>, double) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, Iterable<V>, double, Supplier<AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V, E>>>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, V, double) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClosestFirstIterator(Graph<V, E>, V, double, Supplier<AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V, E>>>) - Constructor for class org.jgrapht.traverse.ClosestFirstIterator
-
Creates a new radius-bounded closest-first iterator for the specified graph.
- ClusteringAlgorithm<V> - Interface in org.jgrapht.alg.interfaces
-
An algorithm which computes a graph vertex clustering.
- ClusteringAlgorithm.Clustering<V> - Interface in org.jgrapht.alg.interfaces
-
A clustering.
- ClusteringAlgorithm.ClusteringImpl<V> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the clustering interface.
- ClusteringCoefficient<V,E> - Class in org.jgrapht.alg.scoring
-
Clustering coefficient.
- ClusteringCoefficient(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Construct a new instance
- ClusteringImpl(List<Set<V>>) - Constructor for class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl
-
Construct a new clustering.
- collect() - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Collect a map of all vertices locations.
- CollectionUtil - Class in org.jgrapht.util
-
Utility class to create
Collection
instances. - COLORING - 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.
- ColorRefinementAlgorithm<V,E> - Class in org.jgrapht.alg.color
-
Color refinement algorithm that finds the coarsest stable coloring of a graph based on a given
alpha
coloring as described in the following paper: C. - ColorRefinementAlgorithm(Graph<V, E>) - Constructor for class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Construct a new coloring algorithm.
- ColorRefinementAlgorithm(Graph<V, E>, VertexColoringAlgorithm.Coloring<V>) - Constructor for class org.jgrapht.alg.color.ColorRefinementAlgorithm
-
Construct a new coloring algorithm.
- ColorRefinementIsomorphismInspector<V,E> - Class in org.jgrapht.alg.isomorphism
-
Implementation of the color refinement algorithm isomorphism test using its feature of detecting isomorphism between two graphs as described in C.
- ColorRefinementIsomorphismInspector(Graph<V, E>, Graph<V, E>) - Constructor for class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Constructor for a isomorphism inspector based on color refinement.
- combine(double, double) - Method in interface org.jgrapht.util.WeightCombiner
-
Combines two weights.
- 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
- 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 - Variable in class org.jgrapht.alg.shortestpath.AStarShortestPath
- comparator - Variable in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
- 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 - org.jgrapht.graph.guava.ElementOrderMethod.Type
-
Usage of an actual comparator instance to order the elements.
- compare(Double, Double) - Method in class org.jgrapht.alg.util.ToleranceDoubleComparator
-
Compares two floating point values.
- compare(V, V) - Method in class org.jgrapht.alg.util.VertexDegreeComparator
-
Deprecated, for removal: This API element is subject to removal in a future version.
- compareTo(StoerWagnerMinimumCut.VertexAndWeight) - Method in class org.jgrapht.alg.StoerWagnerMinimumCut.VertexAndWeight
-
compareTo that sorts in reverse order because we need extract-max and queue provides extract-min.
- compareTo(RatioVertex<V>) - Method in class org.jgrapht.alg.vertexcover.util.RatioVertex
- compareTo(ModifiableInteger) - Method in class org.jgrapht.util.ModifiableInteger
-
Compares two
ModifiableInteger
objects numerically. - ComplementGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generator which produces the complement graph of a given input graph.
- ComplementGraphGenerator(Graph<V, E>) - Constructor for class org.jgrapht.generate.ComplementGraphGenerator
-
Complement Graph Generator
- ComplementGraphGenerator(Graph<V, E>, boolean) - Constructor for class org.jgrapht.generate.ComplementGraphGenerator
-
Complement Graph Generator.
- CompleteBipartiteGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a complete bipartite graph of any size.
- CompleteBipartiteGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.CompleteBipartiteGraphGenerator
-
Creates a new CompleteBipartiteGraphGenerator object.
- CompleteBipartiteGraphGenerator(Set<V>, Set<V>) - Constructor for class org.jgrapht.generate.CompleteBipartiteGraphGenerator
-
Creates a new CompleteBipartiteGraphGenerator object.
- CompleteGraphDemo - Class in org.jgrapht.demo
-
Demonstrates how to create a complete graph and perform a depth first search on it.
- CompleteGraphDemo() - Constructor for class org.jgrapht.demo.CompleteGraphDemo
- CompleteGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates a complete graph of any size.
- CompleteGraphGenerator() - Constructor for class org.jgrapht.generate.CompleteGraphGenerator
-
Construct a new CompleteGraphGenerator.
- CompleteGraphGenerator(int) - Constructor for class org.jgrapht.generate.CompleteGraphGenerator
-
Construct a new CompleteGraphGenerator.
- compose(IsomorphicGraphMapping<V, E>) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Computes the composition of two isomorphisms.
- composeFlow() - Method in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
-
Create a map which specifies for each edge in the input map the amount of flow that flows through it
- compute() - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Compute the centrality index
- compute() - Method in class org.jgrapht.alg.scoring.HarmonicCentrality
- computeContractionHierarchy() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation
-
Computes contraction hierarchy for
graph
. - computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
- computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
- computeDensityDenominator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithm
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmBase
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
- computeDensityNumerator(Graph<V, E>) - Method in class org.jgrapht.alg.densesubgraph.GoldbergMaximumDensitySubgraphAlgorithmNodeWeights
- computePartialCycle() - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Computes a partial cycle assuming that all vertices have an even degree.
- computePartitions(Graph<V, E>) - Method in class org.jgrapht.alg.drawing.TwoLayeredBipartiteLayout2D
-
Compute the vertex partitions.
- computeSpanningForest() - Method in class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
-
Compute a spanning forest of the graph.
- computeSpanningForest() - Method in class org.jgrapht.alg.cycle.QueueBFSFundamentalCycleBasis
-
Compute a spanning forest of the graph using a straightforward BFS implementation.
- computeSpanningForest() - Method in class org.jgrapht.alg.cycle.StackBFSFundamentalCycleBasis
-
Compute a spanning forest of the graph using a stack (LIFO) based BFS implementation.
- concat(GraphWalk<V, E>, Function<GraphWalk<V, E>, Double>) - Method in class org.jgrapht.graph.GraphWalk
-
Concatenates the specified GraphWalk to the end of this GraphWalk.
- 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
- 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 interface org.jgrapht.event.TraversalListener
-
Called to inform listeners that the traversal of the current connected component has finished.
- connectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform listeners that a traversal of a new connected component has started.
- connectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.event.TraversalListenerAdapter
- ConnectedComponentTraversalEvent - Class in org.jgrapht.event
-
A traversal event with respect to a connected component.
- ConnectedComponentTraversalEvent(Object, int) - Constructor for class org.jgrapht.event.ConnectedComponentTraversalEvent
-
Creates a new ConnectedComponentTraversalEvent.
- connectedSetOf(V) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
-
Returns a set of all vertices that are in the maximally connected component together with the specified vertex.
- connectedSets() - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
-
Returns a list of
Set
s, where each set contains all vertices that are in the same maximally connected component. - ConnectivityInspector<V,E> - Class in org.jgrapht.alg.connectivity
-
Allows obtaining various connectivity aspects of a graph.
- ConnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.ConnectivityInspector
-
Creates a connectivity inspector for the specified graph.
- contains(Object) - Method in class org.jgrapht.util.UnmodifiableUnionSet
- contains(Object) - Method in class org.jgrapht.util.WeightedUnmodifiableSet
- 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.util.WeightedUnmodifiableSet
- 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.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
- containsNode(DoublyLinkedList.ListNode<E>) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns true if this
DoublyLinkedList
contains the specifiedDoublyLinkedList.ListNode
. - containsPoint(Box2D, Point2D) - Static method in class org.jgrapht.alg.drawing.model.Boxes
-
Test whether a box contains a point.
- containsPoint(Box2D, Point2D, Comparator<Double>) - Static method in class org.jgrapht.alg.drawing.model.Boxes
-
Test whether a box contains a point.
- containsVertex(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. - 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
. - 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.ContractionVertex<V1> - Class in org.jgrapht.alg.shortestpath
-
Vertex for building the contraction hierarchy, which contains an original vertex from
graph
. - convertToLineGraph(Graph<E, EE>) - Method in class org.jgrapht.alg.transform.LineGraphConverter
-
Constructs a line graph $L(G)$ of the input graph $G(V,E)$.
- convertToLineGraph(Graph<E, EE>, BiFunction<E, E, Double>) - Method in class org.jgrapht.alg.transform.LineGraphConverter
-
Constructs a line graph of the input graph.
- coordinates - Variable in class org.jgrapht.alg.drawing.model.Box2D
-
The coordinates of the lower corner
- copy() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl.BitSetCover
-
Copy a vertex cover.
- 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
- Coreness<V,E> - Class in org.jgrapht.alg.scoring
-
Computes the coreness of each vertex in an undirected graph.
- Coreness(Graph<V, E>) - Constructor for class org.jgrapht.alg.scoring.Coreness
-
Constructor
- CORNER_VERTEX - Static variable in class org.jgrapht.generate.GridGraphGenerator
-
Role for the vertices at the corners.
- COST_INF - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
A cost which is considered to be infinite.
- countSimpleCycles() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Count the number of simple cycles.
- coxeterGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- create() - Method in interface org.jgrapht.alg.util.extension.ExtensionFactory
-
Factory method which creates a new object which extends Extension
- create(String) - Static method in enum org.jgrapht.nio.AttributeType
-
Create a type from a string representation
- create(String) - Static method in enum 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
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultUndirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.Multigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.Pseudograph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Class<? extends E>) - Static method in class org.jgrapht.graph.WeightedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultUndirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedAcyclicGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedWeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.DirectedWeightedPseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.Multigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.Pseudograph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleDirectedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleDirectedWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.SimpleWeightedGraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.WeightedMultigraph
-
Create a builder for this kind of graph.
- createBuilder(Supplier<E>) - Static method in class org.jgrapht.graph.WeightedPseudograph
-
Create a builder for this kind of graph.
- createDefaultEdgeSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a default edge supplier.
- createDefaultWeightedEdgeSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a default weighted edge supplier.
- createEdgeSet(V) - Method in interface org.jgrapht.graph.EdgeSetFactory
-
Create a new edge set for a particular vertex.
- createEdgeSet(V) - Method in class org.jgrapht.graph.specifics.ArrayUnenforcedSetEdgeSetFactory
-
Create a new edge set for a particular vertex.
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.DirectedSpecifics
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.FastLookupDirectedSpecifics
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.FastLookupUndirectedSpecifics
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in interface org.jgrapht.graph.specifics.Specifics
-
Creates an edge given an edge supplier and adds it to the edge containers of its source and target vertices only if the graph does not contain other edges with the same source and target vertices.
- createEdgeToTouchingVerticesIfAbsent(V, V, Supplier<E>) - Method in class org.jgrapht.graph.specifics.UndirectedSpecifics
- createEdgeTraversalEvent(E) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Create an edge traversal event.
- createExtension() - Method in class org.jgrapht.alg.util.extension.ExtensionManager
-
Creates and returns an extension object.
- createIntegerSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create an integer supplier which returns a sequence starting from zero.
- createIntegerSupplier(int) - Static method in class org.jgrapht.util.SupplierUtil
-
Create an integer supplier which returns a sequence starting from a specific numbers.
- createLongSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a long supplier which returns a sequence starting from zero.
- createLongSupplier(long) - Static method in class org.jgrapht.util.SupplierUtil
-
Create a long supplier which returns a sequence starting from a specific numbers.
- createPath(BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V, E>, BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V, E>, double, V, V, V) - Method in class org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm
-
Builds shortest path between
source
andsink
based on the information provided by search frontiers and common vertex. - createRandomUUIDStringSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a string supplier which returns random UUIDs.
- createStringSupplier() - Static method in class org.jgrapht.util.SupplierUtil
-
Create a string supplier which returns unique strings.
- createStringSupplier(int) - Static method in class org.jgrapht.util.SupplierUtil
-
Create a string supplier which returns unique strings.
- createSupplier(Class<? extends T>) - Static method in class org.jgrapht.util.SupplierUtil
-
Create a supplier from a class which calls the default constructor.
- createThreadPoolExecutor(int) - Static method in class org.jgrapht.util.ConcurrencyUtil
-
Creates a
ThreadPoolExecutor
with fixed number of threads which is equal toparallelism
. - 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.
- CrossComponentIterator<V,E,D> - Class in org.jgrapht.traverse
-
Provides a cross-connected-component traversal functionality for iterator subclasses.
- CrossComponentIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- CrossComponentIterator(Graph<V, E>, Iterable<V>) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- CrossComponentIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.CrossComponentIterator
-
Creates a new iterator for the specified graph.
- crossComponentTraversal - Variable in class org.jgrapht.traverse.AbstractGraphIterator
- 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.
- 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 in org.jgrapht.nio.csv
-
Supported CSV formats.
- CSVFormat.Parameter - Enum 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.
- 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
- 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
- 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
- CycleBasisAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Allows to derive an undirected cycle basis of a given graph.
- CycleBasisAlgorithm.CycleBasis<V,E> - Interface in org.jgrapht.alg.interfaces
-
An undirected cycle basis.
- CycleBasisAlgorithm.CycleBasisImpl<V,E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of the undirected cycle basis interface.
- CycleBasisImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Construct a new instance.
- CycleBasisImpl(Graph<V, E>, Set<List<E>>, int, double) - Constructor for class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Construct a new instance.
- CycleDetector<V,E> - Class in org.jgrapht.alg.cycle
-
Performs cycle detection on a graph.
- CycleDetector(Graph<V, E>) - Constructor for class org.jgrapht.alg.cycle.CycleDetector
-
Creates a cycle detector for the specified graph.
- Cycles - Class in org.jgrapht.alg.cycle
-
Collection of helper methods related to cycles.
- Cycles() - Constructor for class org.jgrapht.alg.cycle.Cycles
D
- dag() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed acyclic graph.
- DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.KatzCentrality
-
Damping factor default value.
- DAMPING_FACTOR_DEFAULT - Static variable in class org.jgrapht.alg.scoring.PageRank
-
Damping factor default value.
- decompose(MatchingAlgorithm.Matching<V, E>, boolean) - Method in class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
-
Perform the decomposition, using a pre-calculated bipartite matching
- decrement() - Method in class org.jgrapht.util.ModifiableInteger
-
Subtracts one from the value of this modifiable integer.
- DEFAULT_DIMACS_FORMAT - Static variable in class org.jgrapht.nio.dimacs.DIMACSExporter
-
The default format used by the exporter.
- 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_ITERATIONS - Static variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Default number of iterations
- DEFAULT_NORMALIZATION_FACTOR - Static variable in class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Default normalization factor when calculating optimal distance
- DEFAULT_OPTIONS - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default options
- DEFAULT_SCALING_FACTOR - Static variable in class org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow
-
Default scaling factor
- DEFAULT_THETA_FACTOR - Static variable in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Default $\theta$ value for approximation using the Barnes-Hut technique
- DEFAULT_USE_HEURISTICS - Static variable in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Default value on whether to use extra heuristics to improve the result.
- DEFAULT_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_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.Builder - Class in org.jgrapht.graph
-
A builder for
DefaultGraphType
. - DefaultListenableGraph<V,E> - Class in org.jgrapht.graph
-
A graph backed by the the graph specified at the constructor, which can be listened by
GraphListener
s and byVertexSetListener
s. - DefaultListenableGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.DefaultListenableGraph
-
Creates a new listenable graph.
- DefaultListenableGraph(Graph<V, E>, boolean) - Constructor for class org.jgrapht.graph.DefaultListenableGraph
-
Creates a new listenable graph.
- DefaultManyToManyShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Naive algorithm for many-to-many shortest paths problem using.
- DefaultManyToManyShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
-
Constructs a new instance of the algorithm for a given
graph
. - DefaultManyToManyShortestPaths(Graph<V, E>, Function<Graph<V, E>, ShortestPathAlgorithm<V, E>>) - Constructor for class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
-
Constructs a new instance of the algorithm for a given
graph
andfunction
. - DefaultUndirectedGraph<V,E> - Class in org.jgrapht.graph
-
The default implementation of an undirected graph.
- DefaultUndirectedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultUndirectedGraph
-
Creates a new graph.
- DefaultUndirectedGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DefaultUndirectedGraph
-
Creates a new graph.
- DefaultUndirectedWeightedGraph<V,E> - Class in org.jgrapht.graph
-
The default implementation of an undirected weighted graph.
- DefaultUndirectedWeightedGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Creates a new graph.
- DefaultUndirectedWeightedGraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DefaultUndirectedWeightedGraph
-
Creates a new graph.
- defaultValue - Variable in class org.jgrapht.graph.DefaultEdgeFunction
- defaultValue - Variable in class org.jgrapht.graph.guava.MutableValueGraphAdapter
- DefaultWeightedEdge - Class in org.jgrapht.graph
-
A default implementation for edges in a weighted graph.
- DefaultWeightedEdge() - Constructor for class org.jgrapht.graph.DefaultWeightedEdge
- DegeneracyBronKerboschCliqueFinder<V,E> - Class in org.jgrapht.alg.clique
-
Bron-Kerbosch maximal clique enumeration algorithm with pivot and degeneracy ordering.
- DegeneracyBronKerboschCliqueFinder(Graph<V, E>) - Constructor for class org.jgrapht.alg.clique.DegeneracyBronKerboschCliqueFinder
-
Constructs a new clique finder.
- DegeneracyBronKerboschCliqueFinder(Graph<V, E>, long, TimeUnit) - Constructor for class org.jgrapht.alg.clique.DegeneracyBronKerboschCliqueFinder
-
Constructs a new clique finder.
- DegeneracyOrderingIterator<V,E> - Class in org.jgrapht.traverse
-
A degeneracy ordering iterator.
- DegeneracyOrderingIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.DegeneracyOrderingIterator
-
Constructor
- degree - Variable in class org.jgrapht.alg.vertexcover.util.RatioVertex
-
degree of this vertex
- degreeOf(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.
- 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
. - 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.
- DependencyDemo - Class in org.jgrapht.demo
-
This class is a demonstration program for creating a dependency chart, directed graph, then locating and outputting any implicit loops, cycles.
- DependencyDemo() - Constructor for class org.jgrapht.demo.DependencyDemo
- DepthFirstIterator<V,E> - Class in org.jgrapht.traverse
-
A depth-first iterator for a directed or undirected graph.
- DepthFirstIterator(Graph<V, E>) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
-
Creates a new depth-first iterator for the specified graph.
- DepthFirstIterator(Graph<V, E>, Iterable<V>) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
-
Creates a new depth-first iterator for the specified graph.
- DepthFirstIterator(Graph<V, E>, V) - Constructor for class org.jgrapht.traverse.DepthFirstIterator
-
Creates a new depth-first iterator for the specified graph.
- DepthFirstIterator.VisitColor - Enum in org.jgrapht.traverse
-
Standard vertex visit state enumeration.
- desarguesGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DESCENDING - org.jgrapht.alg.util.VertexDegreeComparator.Order
-
Deprecated.
- descendingIterator() - Method in class org.jgrapht.util.DoublyLinkedList
- detectCycles() - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Performs yes/no cycle detection on the entire graph.
- detectCyclesContainingVertex(V) - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Performs yes/no cycle detection on an individual vertex.
- dfs(DinicMFImpl.VertexExtension, double) - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Finds a blocking flow in the network.
- diamondGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- DijkstraManyToManyShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
Naive algorithm for many-to-many shortest paths problem using
DijkstraClosestFirstIterator
. - DijkstraManyToManyShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths
-
Constructs an instance of the algorithm for a given
graph
. - DijkstraShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
An implementation of Dijkstra's shortest path algorithm using a pairing heap by default.
- DijkstraShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DijkstraShortestPath(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DijkstraShortestPath(Graph<V, E>, double, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- DijkstraShortestPath(Graph<V, E>, Supplier<AddressableHeap<Double, Pair<V, E>>>) - Constructor for class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Constructs a new instance of the algorithm for a given graph.
- 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 in org.jgrapht.nio.dimacs
-
Parameters that affect the behavior of the
DIMACSExporter
exporter. - DIMACSFormat - Enum in org.jgrapht.nio.dimacs
-
DIMACS challenge format.
- 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
- dinic() - Method in class org.jgrapht.alg.flow.DinicMFImpl
-
Runs Dinic algorithm with scaling.
- DinicMFImpl<V,E> - Class in org.jgrapht.alg.flow
-
Implementation of <a href = "https://en.wikipedia.org/wiki/Dinic%27s_algorithm">Dinic algorithm</a> with scaling for <a href = "https://en.wikipedia.org/wiki/Maximum_flow_problem"maximum"maximum flow problem</a>.
- DinicMFImpl(Graph<V, E>) - Constructor for class org.jgrapht.alg.flow.DinicMFImpl
-
Constructor.
- DinicMFImpl(Graph<V, E>, double) - Constructor for class org.jgrapht.alg.flow.DinicMFImpl
-
Constructor.
- directed() - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder for a directed graph.
- directed() - Method in class org.jgrapht.graph.DefaultGraphType.Builder
-
Set the type as directed.
- DirectedAcyclicGraph<V,E> - Class in org.jgrapht.graph
-
A directed acyclic graph (DAG).
- DirectedAcyclicGraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, boolean, boolean) - Constructor for class org.jgrapht.graph.DirectedAcyclicGraph
-
Construct a directed acyclic graph.
- DirectedAcyclicGraph(Supplier<V>, Supplier<E>, 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.Region - Class in org.jgrapht.graph
-
An inclusive range of indices: [start, finish].
- DirectedAcyclicGraph.TopoOrderMap<V> - Interface in org.jgrapht.graph
-
An interface for storing the topological ordering.
- DirectedAcyclicGraph.TopoVertexBiMap<V> - Class in org.jgrapht.graph
-
A dual map implementation of the topological order map.
- DirectedAcyclicGraph.TopoVertexMap - Class in org.jgrapht.graph
-
An implementation of the topological order map which for performance and flexibility uses an ArrayList for topological index to vertex mapping, and a HashMap for vertex to topological index mapping.
- DirectedAcyclicGraph.VisitedArrayImpl - Class in org.jgrapht.graph
-
A visited strategy using an array.
- DirectedAcyclicGraph.VisitedArrayListImpl - Class in org.jgrapht.graph
-
A visited strategy using an
ArrayList
. - DirectedAcyclicGraph.VisitedBitSetImpl - Class in org.jgrapht.graph
-
A visited strategy which uses a
BitSet
. - DirectedAcyclicGraph.VisitedHashSetImpl - Class in org.jgrapht.graph
-
A visited strategy using a
HashSet
. - DirectedAcyclicGraph.VisitedStrategy - Interface in org.jgrapht.graph
-
A strategy for marking vertices as visited.
- DirectedAcyclicGraph.VisitedStrategyFactory - Interface in org.jgrapht.graph
-
A visited strategy factory.
- DirectedEdgeContainer<V,E> - Class in org.jgrapht.graph.specifics
-
A container for vertex edges.
- directedGraph - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- DirectedGraphDemo - Class in org.jgrapht.demo
-
This class demonstrates some of the operations that can be performed on directed graphs.
- DirectedGraphDemo() - Constructor for class org.jgrapht.demo.DirectedGraphDemo
- directedMultigraph() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed multigraph type.
- DirectedMultigraph<V,E> - Class in org.jgrapht.graph
-
A directed multigraph.
- DirectedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedMultigraph
-
Creates a new graph.
- DirectedMultigraph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DirectedMultigraph
-
Creates a new graph.
- directedPseudograph() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed pseudograph type.
- DirectedPseudograph<V,E> - Class in org.jgrapht.graph
-
A directed pseudograph.
- DirectedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedPseudograph
-
Creates a new graph.
- DirectedPseudograph(Supplier<V>, Supplier<E>, boolean) - Constructor for class org.jgrapht.graph.DirectedPseudograph
-
Creates a new graph.
- DirectedScaleFreeGraphGenerator<V,E> - Class in org.jgrapht.generate
-
A generator for directed scale-free graphs.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Constructs a Generator.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, long) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Constructs a Generator using a seed for the random number generator.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, long, boolean, boolean) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Constructs a Generator using a seed for the random number generator and sets the two relaxation options
allowingMultipleEdges
andallowingSelfLoops
. - DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, Random) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Construct a new generator using the provided random number generator.
- DirectedScaleFreeGraphGenerator(float, float, float, float, int, int, Random, boolean, boolean) - Constructor for class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Construct a new generator using the provided random number generator and sets the two relaxation options
allowingMultipleEdges
andallowingSelfLoops
. - directedSimple() - Static method in class org.jgrapht.graph.DefaultGraphType
-
A directed simple graph type.
- DirectedSimpleCycles<V,E> - Interface in org.jgrapht.alg.cycle
-
A common interface for classes implementing algorithms for enumeration of the simple cycles of a directed graph.
- DirectedSpecifics<V,E> - Class in org.jgrapht.graph.specifics
-
Plain implementation of DirectedSpecifics.
- DirectedSpecifics(Graph<V, E>, Map<V, DirectedEdgeContainer<V, E>>, EdgeSetFactory<V, E>) - Constructor for class org.jgrapht.graph.specifics.DirectedSpecifics
-
Construct a new directed specifics.
- DirectedWeightedMultigraph<V,E> - Class in org.jgrapht.graph
-
A directed weighted multigraph.
- DirectedWeightedMultigraph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
-
Creates a new graph.
- DirectedWeightedMultigraph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DirectedWeightedMultigraph
-
Creates a new graph.
- DirectedWeightedPseudograph<V,E> - Class in org.jgrapht.graph
-
A directed weighted pseudograph.
- DirectedWeightedPseudograph(Class<? extends E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
-
Creates a new weighted graph.
- DirectedWeightedPseudograph(Supplier<V>, Supplier<E>) - Constructor for class org.jgrapht.graph.DirectedWeightedPseudograph
-
Creates a new weighted graph.
- 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
. - dodecahedronGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- 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.
- 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.
- DOUBLE - org.jgrapht.nio.AttributeType
- DOUBLE - org.jgrapht.nio.gexf.GEXFAttributeType
- doubleStarSnarkGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- doubleValue() - Method in class org.jgrapht.util.ModifiableInteger
- DoublyLinkedList<E> - Class in org.jgrapht.util
-
DoublyLinkedList
implements a doubly linkedList
data structure, that exposes itsListNodes
where the data is stored in. - DoublyLinkedList() - Constructor for class org.jgrapht.util.DoublyLinkedList
- DoublyLinkedList.ListNode<V> - Interface in org.jgrapht.util
-
Container for the elements stored in a
DoublyLinkedList
. - DoublyLinkedList.ListNodeIterator<E> - Interface in org.jgrapht.util
- DoublyLinkedList.NodeIterator<E> - Interface in org.jgrapht.util
- doyleGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
-
Generate the Doyle Graph
- drawableArea - Variable in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- 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
- DualSolution(Graph<V, E>, Map<Set<V>, Double>) - Constructor for class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
-
Constructs a new solution for the dual linear program
- DulmageMendelsohnDecomposition<V,E> - Class in org.jgrapht.alg.decomposition
-
This class computes a Dulmage-Mendelsohn Decomposition of a bipartite graph.
- DulmageMendelsohnDecomposition(Graph<V, E>, Set<V>, Set<V>) - Constructor for class org.jgrapht.alg.decomposition.DulmageMendelsohnDecomposition
-
Construct the algorithm for a given bipartite graph $G=(V_1,V_2,E)$ and it's partitions $V_1$ and $V_2$, where $V_1\cap V_2=\emptyset$.
- DulmageMendelsohnDecomposition.Decomposition<V,E> - Class in org.jgrapht.alg.decomposition
-
The output of a decomposition operation
- 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 - org.jgrapht.generate.WindmillGraphsGenerator.Mode
E
- e - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- edge - Variable in class org.jgrapht.event.EdgeTraversalEvent
-
The traversed edge.
- edge - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The edge that this event is related to.
- EDGE - org.jgrapht.nio.gexf.GEXFExporter.AttributeCategory
- EDGE - org.jgrapht.nio.graphml.GraphMLExporter.AttributeCategory
- EDGE_ADDED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge added event.
- EDGE_LIST - org.jgrapht.nio.csv.CSVFormat
-
Edge list
- EDGE_REMOVED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge removed event.
- EDGE_WEIGHT_UPDATED - Static variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
Edge weight updated event.
- EDGE_WEIGHTS - 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.ext.JGraphXAdapter
- edgeAttributeProvider - Variable in class org.jgrapht.nio.BaseExporter
-
An edge attribute provider
- 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.OverflowStrategy - Enum in org.jgrapht.alg.scoring
-
Strategy followed when counting paths.
- edgeClass(Class<E1>) - Method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Set the edge class.
- edgeComparator - Variable in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- edgeCount() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
Get number of vertex edges
- edgeCount() - Method in interface org.jgrapht.GraphIterables
-
Return the number of edges in the graph.
- edgeExtensionManager - Variable in class org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
- edgeIdProvider - Variable in class org.jgrapht.nio.BaseExporter
-
An edge id provider
- edgeList - Variable in class org.jgrapht.graph.GraphWalk
- edgeMap - Variable in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
- edgeMask - Variable in class org.jgrapht.graph.MaskSubgraph
- EdgeNode(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode, E, HierholzerEulerianCycle.EdgeNode, HierholzerEulerianCycle.EdgeNode) - Constructor for class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
-
Create EdgeNode
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.connectivity.ConnectivityInspector
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.alg.util.NeighborCache
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
-
Notifies that an edge has been removed from the graph.
- edgeRemoved(GraphEdgeChangeEvent<V, E>) - Method in class org.jgrapht.ext.JGraphXAdapter
- EdgeReversedGraph<V,E> - Class in org.jgrapht.graph
-
Provides an edge-reversed view $g'$ of a directed graph $g$.
- EdgeReversedGraph(Graph<V, E>) - Constructor for class org.jgrapht.graph.EdgeReversedGraph
-
Creates a new EdgeReversedGraph.
- edges - Variable in class org.jgrapht.graph.MaskSubgraph
- edges() - Method in interface org.jgrapht.GraphIterables
-
Returns an iterable over the edges of the graph.
- EdgeScoringAlgorithm<E,D> - Interface in org.jgrapht.alg.interfaces
-
An interface for all algorithms which assign scores to edges of a graph.
- edgeSet - Variable in class org.jgrapht.graph.AsSubgraph
- edgeSet() - Method in class org.jgrapht.graph.AbstractBaseGraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.AsGraphUnion
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.AsSubgraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in interface org.jgrapht.Graph
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of the edges contained in this graph.
- edgeSet() - Method in class org.jgrapht.graph.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.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.
- 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.sux4j.SuccinctDirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntDirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- edgesOf(Integer) - Method in class org.jgrapht.sux4j.SuccinctUndirectedGraph
- 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
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in interface org.jgrapht.Graph
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.GraphDelegator
-
Returns a set of all edges touching the specified vertex.
- edgesOf(V) - Method in class org.jgrapht.graph.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.
- edgeSource - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The source vertex of the edge that this event is related to.
- 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.
- EdgeTraversalEvent<E> - Class in org.jgrapht.event
-
A traversal event for a graph edge.
- EdgeTraversalEvent(Object, E) - Constructor for class org.jgrapht.event.EdgeTraversalEvent
-
Creates a new EdgeTraversalEvent.
- edgeTraversed(EdgeTraversalEvent<E>) - Method in interface org.jgrapht.event.TraversalListener
-
Called to inform the listener that the specified edge have been visited during the graph traversal.
- edgeTraversed(EdgeTraversalEvent<E>) - Method in class org.jgrapht.event.TraversalListenerAdapter
- edgeWeight - Variable in class org.jgrapht.event.GraphEdgeChangeEvent
-
The weight of the edge that this event is related to.
- edgeWeightUpdated(GraphEdgeChangeEvent<V, E>) - Method in interface org.jgrapht.event.GraphListener
-
Notifies that an edge weight has been updated.
- 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
. - 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
. - 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
- 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.Type - Enum in org.jgrapht.graph.guava
-
Element order method type
- 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
- EmbeddingImpl(Graph<V, E>, Map<V, List<E>>) - Constructor for class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Creates new embedding of the
graph
- EmptyGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generates an empty graph of any size.
- EmptyGraphGenerator(int) - Constructor for class org.jgrapht.generate.EmptyGraphGenerator
-
Construct a new EmptyGraphGenerator.
- emptyWalk(Graph<V, E>) - Static method in class org.jgrapht.graph.GraphWalk
-
Convenience method which creates an empty walk.
- encounterVertex(V, E) - Method in class org.jgrapht.traverse.BreadthFirstIterator
-
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.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 - org.jgrapht.nio.ImportEvent
-
End of the import
- END_VERTEX - Static variable in class org.jgrapht.generate.LinearGraphGenerator
-
Role for the last vertex generated.
- endVertex - Variable in class org.jgrapht.graph.GraphWalk
- enqueue(int) - Method in class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Add an element to the queue.
- EppsteinKShortestPath<V,E> - Class in org.jgrapht.alg.shortestpath
-
Implementation of the Eppstein`s algorithm for finding $k$ shortest path between two vertices in a graph.
- EppsteinKShortestPath(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinKShortestPath
-
Constructs the algorithm instance for the given
graph
. - EppsteinShortestPathIterator<V,E> - Class in org.jgrapht.alg.shortestpath
-
Iterator over the shortest paths (not required to be simple) between two vertices in a graph sorted by weight.
- EppsteinShortestPathIterator(Graph<V, E>, V, V) - Constructor for class org.jgrapht.alg.shortestpath.EppsteinShortestPathIterator
-
Constructs an instance of the algorithm for the given
graph
,source
andsink
. - EPS - Static variable in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Default epsilon used in the algorithm
- equals(Object) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.EdgeNode
- equals(Object) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle.VertexNode
- equals(Object) - Method in class org.jgrapht.alg.drawing.model.Box2D
- equals(Object) - Method in class org.jgrapht.alg.drawing.model.Point2D
- equals(Object) - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
- equals(Object) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionVertex
- equals(Object) - Method in class org.jgrapht.alg.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
-
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
- 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 - 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 - org.jgrapht.nio.lemon.LemonExporter.Parameter
-
If set the exporter escapes all strings as Java strings, otherwise no escaping is performed.
- EulerianCycleAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Computes an Eulerian cycle of an Eulerian graph.
- eulerianHead - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- EulerTourRMQLCAFinder<V,E> - Class in org.jgrapht.alg.lca
-
Algorithm for computing lowest common ancestors in rooted trees and forests based on Berkman, Omer; Vishkin, Uzi (1993), "Recursive Star-Tree Parallel Data Structure", SIAM Journal on Computing, 22 (2): 221–242, doi:10.1137/0222017.
- EulerTourRMQLCAFinder(Graph<V, E>, Set<V>) - Constructor for class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Construct a new instance of the algorithm.
- EulerTourRMQLCAFinder(Graph<V, E>, V) - Constructor for class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Construct a new instance of the algorithm.
- EventDrivenImporter<V,E> - Interface in org.jgrapht.nio
-
Interface for an importer using consumers.
- exogenousFactorDefaultFunction() - Static method in class org.jgrapht.alg.scoring.KatzCentrality
-
Exogenous factor default function (the constant function returning 1).
- EXPORT_CUSTOM_EDGE_ATTRIBUTES - org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs all custom edge attributes.
- EXPORT_CUSTOM_VERTEX_ATTRIBUTES - org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs all custom vertex attributes.
- EXPORT_EDGE_LABELS - org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs edge labels.
- EXPORT_EDGE_LABELS - org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs edge labels.
- EXPORT_EDGE_TYPES - org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs edge types.
- EXPORT_EDGE_WEIGHTS - org.jgrapht.nio.dimacs.DIMACSExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_EDGE_WEIGHTS - org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_EDGE_WEIGHTS - org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_EDGE_WEIGHTS - org.jgrapht.nio.lemon.LemonExporter.Parameter
-
If set the exporter outputs edge weights
- EXPORT_META - org.jgrapht.nio.gexf.GEXFExporter.Parameter
-
If set the exporter outputs the metadata information.
- EXPORT_VERTEX_LABELS - org.jgrapht.nio.gml.GmlExporter.Parameter
-
If set the exporter outputs vertex labels.
- ExportException - Exception in org.jgrapht.nio
-
An exception that the library throws in case of graph export errors.
- ExportException() - Constructor for exception org.jgrapht.nio.ExportException
-
Constructs an
ExportException
withnull
as its error detail message. - ExportException(String) - Constructor for exception org.jgrapht.nio.ExportException
-
Constructs an
ExportException
with the specified detail message. - ExportException(String, Throwable) - Constructor for exception org.jgrapht.nio.ExportException
-
Constructs an
ExportException
with the specified detail message and cause. - ExportException(Throwable) - Constructor for exception 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
- Extension - Interface in org.jgrapht.alg.util.extension
-
Class which represents an abstract extension/encapsulation object.
- ExtensionFactory<B extends Extension> - Interface in org.jgrapht.alg.util.extension
-
Factory class which creates extension/encapsulation objects
- ExtensionManager<T,B extends Extension> - Class in org.jgrapht.alg.util.extension
-
Convenience class to manage extensions/encapsulations.
- ExtensionManager(ExtensionFactory<B>) - Constructor for class org.jgrapht.alg.util.extension.ExtensionManager
-
Create a new extension manager.
- 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$.
- 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.
- find(T) - Method in class org.jgrapht.alg.util.UnionFind
-
Returns the representative element of the set that element is in.
- findCliques(Set<V>, Set<V>, Set<V>, long) - Method in class org.jgrapht.alg.clique.PivotBronKerboschCliqueFinder
-
Recursive implementation of the Bron-Kerbosch with pivot.
- findCycles() - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Finds the vertex set for the subgraph of all cycles.
- findCyclesContainingVertex(V) - Method in class org.jgrapht.alg.cycle.CycleDetector
-
Finds the vertex set for the subgraph of all cycles which contain a particular vertex.
- findPathBetween(Graph<Integer, E>, Integer, Integer) - Static method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
-
Find a path between two vertices.
- findPathBetween(Graph<V, E>, V, V) - Static method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Find a path between two vertices.
- findSimpleCycles() - Method in interface org.jgrapht.alg.cycle.DirectedSimpleCycles
-
Find the simple cycles of the graph.
- findSimpleCycles(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.
- finishVertex(V) - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Called when a vertex has been finished (meaning is dependent on traversal represented by subclass).
- fireConnectedComponentFinished(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that the traversal of the current connected component finished.
- fireConnectedComponentStarted(ConnectedComponentTraversalEvent) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a traversal of a new connected component has started.
- fireEdgeAdded(E, V, V, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified edge was added.
- fireEdgeRemoved(E, V, V, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified edge was removed.
- fireEdgeTraversed(EdgeTraversalEvent<E>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified edge was visited.
- fireEdgeWeightUpdated(E, V, V, double) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the weight of an edge has changed.
- fireVertexAdded(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified vertex was added.
- fireVertexFinished(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified vertex was finished.
- fireVertexRemoved(V) - Method in class org.jgrapht.graph.DefaultListenableGraph
-
Notify listeners that the specified vertex was removed.
- fireVertexTraversed(VertexTraversalEvent<V>) - Method in class org.jgrapht.traverse.AbstractGraphIterator
-
Informs all listeners that a the specified vertex was visited.
- first - Variable in class org.jgrapht.alg.util.Pair
-
The first pair element
- first - Variable in class org.jgrapht.alg.util.Triple
-
The first element
- first - Variable in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
- first(List<? extends V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
Set the first partition of the generator.
- FIRST - Static variable in interface org.jgrapht.util.WeightCombiner
-
First weight.
- fixed - Variable in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- FixedSizeIntegerQueue - Class in org.jgrapht.alg.util
-
Primitive but efficient implementation of a fixed size queue for integers.
- FixedSizeIntegerQueue(int) - Constructor for class org.jgrapht.alg.util.FixedSizeIntegerQueue
-
Create a queue of fixed size.
- FLOAT - org.jgrapht.nio.AttributeType
- FLOAT - org.jgrapht.nio.gexf.GEXFAttributeType
- floatValue() - Method in class org.jgrapht.util.ModifiableInteger
- FlowAlgorithm<V,E> - Interface in org.jgrapht.alg.interfaces
-
Interface for flow algorithms
- FlowAlgorithm.Flow<E> - Interface in org.jgrapht.alg.interfaces
-
Represents a flow.
- FlowAlgorithm.FlowImpl<E> - Class in org.jgrapht.alg.interfaces
-
Default implementation of
FlowAlgorithm.Flow
- FlowImpl(Map<E, Double>) - Constructor for class org.jgrapht.alg.interfaces.FlowAlgorithm.FlowImpl
-
Constructs a new flow
- FloydWarshallShortestPaths<V,E> - Class in org.jgrapht.alg.shortestpath
-
The Floyd-Warshall algorithm.
- FloydWarshallShortestPaths(Graph<V, E>) - Constructor for class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.
- folkmanGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- forGraph(Graph<V, E>) - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder which will create the same graph type as the parameter graph.
- forGraphType(GraphType) - Static method in class org.jgrapht.graph.builder.GraphTypeBuilder
-
Create a graph type builder which will create a graph with the same type as the one provided.
- FRACTIONAL - org.jgrapht.alg.matching.blossom.v5.BlossomVOptions.InitializationType
- franklinGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- FRLayoutAlgorithm2D<V,E> - Class in org.jgrapht.alg.drawing
-
Fruchterman and Reingold Force-Directed Placement Algorithm.
- FRLayoutAlgorithm2D() - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int, double) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int, double, BiFunction<LayoutModel2D<V>, Integer, FRLayoutAlgorithm2D.TemperatureModel>, Random) - Constructor for class org.jgrapht.alg.drawing.FRLayoutAlgorithm2D
-
Create a new layout algorithm
- FRLayoutAlgorithm2D(int, double, 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.
- fruchtGraph() - Static method in class org.jgrapht.generate.NamedGraphGenerator
- FULL_INCOMING_EDGES - org.jgrapht.opt.graph.sparse.IncomingEdgesSupport
-
Support incoming edges.
G
- g - Variable in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
- g - Variable in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
The graph
- GabowStrongConnectivityInspector<V,E> - Class in org.jgrapht.alg.connectivity
-
Computes the strongly connected components of a directed graph.
- GabowStrongConnectivityInspector(Graph<V, E>) - Constructor for class org.jgrapht.alg.connectivity.GabowStrongConnectivityInspector
-
Constructor
- generalizedPetersenGraph(int, int) - Static method in class org.jgrapht.generate.NamedGraphGenerator
- GeneralizedPetersenGraphGenerator<V,E> - Class in org.jgrapht.generate
-
Generator for Generalized Petersen Graphs The Generalized Petersen graphs $GP(n,k)$ are a family of cubic graphs formed by connecting the vertices of a regular polygon (cycle graph $C_n$) to the corresponding vertices of a star polygon ${n,k}$.
- GeneralizedPetersenGraphGenerator(int, int) - Constructor for class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Constructs a GeneralizedPetersenGraphGenerator used to generate a Generalized Petersen graphs $GP(n,k)$.
- generateBidiakisCubeGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Bidiakis cube Graph.
- 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.
- generateChvatalGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Chvatal Graph.
- generateClawGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Claw Graph.
- generateClebschGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Clebsch Graph.
- generateCoxeterGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Coxeter Graph.
- generateDesarguesGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Desargues Graph.
- generateDiamondGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Diamond Graph.
- generateDodecahedronGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Dodecahedron Graph.
- generateDoubleStarSnarkGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Double Star Snark Graph.
- generateDoyleGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Doyle Graph.
- generateDürerGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Dürer Graph.
- generateEllinghamHorton54Graph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Ellingham-Horton 54 Graph.
- generateEllinghamHorton78Graph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Ellingham-Horton 78 Graph.
- generateErreraGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Errera Graph.
- generateFolkmanGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Folkman Graph.
- generateFranklinGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Franklin Graph.
- generateFruchtGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Frucht Graph.
- generateGoldnerHararyGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Goldner-Harary Graph.
- generateGossetGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Gosset Graph.
- generateGraph(Graph<V, E>) - Method in interface org.jgrapht.generate.GraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, List<V>>) - Method in class org.jgrapht.generate.GeneralizedPetersenGraphGenerator
-
Generates the Generalized Petersen Graph
- generateGraph(Graph<V, E>, Map<String, T>) - Method in interface org.jgrapht.generate.GraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.BarabasiAlbertForestGenerator
-
Generates an instance.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.BarabasiAlbertGraphGenerator
-
Generates an instance.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.ComplementGraphGenerator
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteBipartiteGraphGenerator
-
Construct a complete bipartite graph
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.CompleteGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.DirectedScaleFreeGraphGenerator
-
Generates an instance of the
Graph
. - generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.EmptyGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnmRandomBipartiteGraphGenerator
-
Generates a random bipartite graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnmRandomGraphGenerator
-
Generates a random graph based on the $G(n, M)$ model
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnpRandomBipartiteGraphGenerator
-
Generates a random bipartite graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GnpRandomGraphGenerator
-
Generates a random graph based on the $G(n, p)$ model.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.GridGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.HyperCubeGraphGenerator
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.KleinbergSmallWorldGraphGenerator
-
Generates a small-world graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.LinearGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.LinearizedChordDiagramGraphGenerator
-
Generates an instance.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.PlantedPartitionGraphGenerator
-
Generate an $l$-planted partition graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.PruferTreeGenerator
-
Generates a tree.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.RandomRegularGraphGenerator
-
Generate a random regular graph.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.RingGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.ScaleFreeGraphGenerator
-
Generates scale-free network with
size
passed to the constructor. - generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedBipartiteGraphMatrixGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.StarGraphGenerator
-
Generates a star graph with the designated order from the constructor
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.WattsStrogatzGraphGenerator
-
Generates a small-world graph based on the Watts-Strogatz model.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.WheelGraphGenerator
-
Generate a graph structure.
- generateGraph(Graph<V, E>, Map<String, V>) - Method in class org.jgrapht.generate.WindmillGraphsGenerator
- generateGrötzschGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Grötzsch Graph.
- generateHeawoodGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Heawood Graph.
- generateHerschelGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Herschel Graph.
- generateHoffmanGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Hoffman Graph.
- generateKittellGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Kittell Graph.
- generateKlein3RegularGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Klein 3-regular Graph.
- generateKlein7RegularGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Klein 7-regular Graph.
- generateKrackhardtKiteGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Krackhardt kite Graph.
- 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.
- generatePappusGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Pappus Graph.
- generatePetersenGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates a Petersen Graph.
- generatePoussinGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Poussin Graph.
- generateSchläfliGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Schläfli Graph.
- generateThomsenGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Thomsen Graph.
- generateTietzeGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Tietze Graph.
- generateTutteGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Tutte Graph.
- generateZacharyKarateClubGraph(Graph<V, E>) - Method in class org.jgrapht.generate.NamedGraphGenerator
-
Generates the Zachary's karate club Graph.
- get(int) - Method in class org.jgrapht.util.DoublyLinkedList
- get(E) - Method in class org.jgrapht.graph.DefaultEdgeFunction
-
Get the function value for an edge.
- get(V) - Method in interface org.jgrapht.alg.drawing.model.LayoutModel2D
-
Get the last location of a particular vertex in the model.
- get(V) - Method in class org.jgrapht.alg.drawing.model.ListenableLayoutModel2D
- get(V) - Method in class org.jgrapht.alg.drawing.model.MapLayoutModel2D
- getAllEdges(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(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.
- getAtoms() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the atoms generated by the decomposition.
- getAugmentTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getAverageClusteringCoefficient() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Computes the average clustering coefficient.
- getBackwardMapping() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get an unmodifiable version of the backward mapping function.
- getBatchLCA(List<Pair<V, V>>) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return a list of LCAs for a batch of queries
- getBatchLCA(List<Pair<V, V>>) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
-
Return a list of LCAs for a batch of queries
- getBatchLCASet(List<Pair<V, V>>) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return a list of computed sets of LCAs for a batch of queries
- getBlock(V) - Method in class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Returns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected component) containing the vertex.
- getBlocks() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns all blocks (biconnected components) in the graph.
- getBlocks() - Method in class org.jgrapht.alg.connectivity.BlockCutpointGraph
-
Returns all blocks (biconnected components) in the graph
- getBlocks(V) - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns a set of blocks (biconnected components) containing the specified vertex.
- getBridges() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns the graph's bridges.
- getCapacitatedSpanningTree() - Method in interface org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm
-
Computes a capacitated spanning tree.
- getCapacitatedSpanningTree() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree
- getCapacitatedSpanningTree() - Method in class org.jgrapht.alg.spanning.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
- getCapacitatedSpanningTree() - Method in class org.jgrapht.alg.spanning.EsauWilliamsCapacitatedMinimumSpanningTree
-
Computes a capacitated spanning tree.
- 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.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the CAPACITY keyword in the imported file.
- getCellToEdgeMap() - Method in class org.jgrapht.ext.JGraphXAdapter
-
Returns Hashmap which maps the visualization mxICells onto their edges.
- getCellToVertexMap() - Method in class org.jgrapht.ext.JGraphXAdapter
-
Returns Hashmap which maps the visualization mxICells onto their vertices.
- getCertificate() - Method in class org.jgrapht.alg.cycle.BergeGraphInspector
-
Returns the certificate in the form of a hole or anti-hole in the inspected graph, when the
BergeGraphInspector.isBerge(org.jgrapht.Graph<V, E>, boolean)
method is previously called withcomputeCertificate=true
. - getCertificate() - Method in class org.jgrapht.alg.cycle.WeakChordalityInspector
-
Computes and returns the certificate in the form of a hole or anti-hole in the inspected
graph
. - getChromaticNumber() - Method in class org.jgrapht.alg.color.BrownBacktrackColoring
-
Returns the chromatic number of the input graph
- getClique() - Method in class org.jgrapht.alg.clique.ChordalGraphMaxCliqueFinder
-
Returns a maximum cardinality clique of the inspected
graph
. - getClique() - Method in interface org.jgrapht.alg.interfaces.CliqueAlgorithm
-
Computes a clique.
- getClustering() - Method in class org.jgrapht.alg.clustering.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.
- getCondensation() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Compute the condensation of the given graph.
- getConnectedComponent(V) - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns the connected component containing the given vertex.
- getConnectedComponents() - Method in class org.jgrapht.alg.connectivity.BiconnectivityInspector
-
Returns all connected components in the graph.
- getContractionGraph() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns contracted graph.
- getContractionMapping() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns mapping of the vertices in the original graph to the vertices in the contracted graph.
- 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.
- getCost() - Method in interface org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlow
-
Returns the cost of the flow
- getCost() - Method in class org.jgrapht.alg.interfaces.MinimumCostFlowAlgorithm.MinimumCostFlowImpl
-
Returns the cost of the flow
- getCostEstimate(V, V) - Method in interface org.jgrapht.alg.interfaces.AStarAdmissibleHeuristic
-
An admissible "heuristic estimate" of the distance from $x$, the sourceVertex, to the goal (usually denoted $h(x)$).
- getCostEstimate(V, V) - Method in class org.jgrapht.alg.shortestpath.ALTAdmissibleHeuristic
-
An admissible heuristic estimate from a source vertex to a target vertex.
- 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.
- 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 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.
- 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.
- 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
. - getDistanceAndPredecessorMap() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Get the internal map used for representing the paths.
- 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(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 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.graph.GraphWalk
- getEdgeList() - Method in interface org.jgrapht.GraphPath
-
Returns the edges making up the path.
- getEdges() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- getEdges() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Get the edges of the matching.
- getEdges() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
-
Get the edges of the matching.
- getEdges() - Method in interface org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree
-
Set of edges of the spanning tree.
- getEdges() - Method in class org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTreeImpl
- getEdges() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition
-
Set of edges of the path decomposition.
- getEdges() - Method in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- getEdgesAround(V) - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.Embedding
-
Returns the clockwise order of edges incident to the
vertex
- getEdgesAround(V) - Method in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Returns the clockwise order of edges incident to the
vertex
- 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.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.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.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.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.sux4j.SuccinctIntDirectedGraph
- getEdgeTarget(Integer) - Method in class org.jgrapht.sux4j.SuccinctIntUndirectedGraph
- getEdgeToCellMap() - Method in class org.jgrapht.ext.JGraphXAdapter
-
Returns Hashmap which maps the edges onto their visualization mxICells.
- 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
- 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
- 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
. - getEmbedding() - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm
-
Computes combinatorial embedding of the input
graph
. - getEmbedding() - Method in class org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector
-
Computes combinatorial embedding of the input
graph
. - getEndVertex() - Method in class org.jgrapht.graph.GraphWalk
- getEndVertex() - Method in interface org.jgrapht.GraphPath
-
Returns the end vertex in the path.
- getEntireGraphVertexIterator() - Method in class org.jgrapht.traverse.CrossComponentIterator
-
Lazily instantiates
entireGraphVertexIterator
. - getEquivalentFlowTree() - Method in class org.jgrapht.alg.flow.GusfieldEquivalentFlowTree
-
Returns the Equivalent Flow Tree as an actual tree (graph).
- getError() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Computes the error in the solution to the dual linear program.
- getError() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes the error in the solution to the dual linear program.
- getEulerianCycle(Graph<V, E>) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Compute an Eulerian cycle of a graph.
- getEulerianCycle(Graph<V, E>) - Method in interface org.jgrapht.alg.interfaces.EulerianCycleAlgorithm
-
Compute an Eulerian cycle of a graph.
- getExpandNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getExpandTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getExtension(T) - Method in class org.jgrapht.alg.util.extension.ExtensionManager
-
Creates a new singleton extension object for original t if no such object exists, returns the old one otherwise.
- getFillEdges() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the fill edges generated by the triangulation.
- getFinish() - Method in class org.jgrapht.graph.DirectedAcyclicGraph.Region
-
Get the end of the region (inclusive).
- getFirst() - Method in class org.jgrapht.alg.util.Pair
-
Get the first element of the pair
- getFirst() - Method in class org.jgrapht.alg.util.Triple
-
Get the first element
- getFirst() - Method in class org.jgrapht.util.DoublyLinkedList
- getFirstHop(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Returns the first hop, i.e., the second node on the shortest path from $a$ to $b$.
- getFirstNode() - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the first
node
of this list. - getFirstNodeInPathArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal firstNodeInPath array.
- 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.
- 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.
- getForwardMapping() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get an unmodifiable version of the forward mapping function.
- getFullComponentCount() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get a map to know for each separator how many components it produces.
- getGenerators() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the generators of the separators of the triangulated graph, i.e.
- getGirth(Graph<V, E>) - Static method in class org.jgrapht.GraphMetrics
-
Compute the girth of the graph.
- getGlobalClusteringCoefficient() - Method in class org.jgrapht.alg.scoring.ClusteringCoefficient
-
Computes the global clustering coefficient.
- getGomoryHuTree() - Method in class org.jgrapht.alg.flow.GusfieldGomoryHuCutTree
-
Returns the Gomory-Hu Tree as an actual tree (graph).
- getGraph() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the original graph.
- getGraph() - Method in class org.jgrapht.alg.cycle.HawickJamesSimpleCycles
-
Get the graph
- getGraph() - Method in class org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles
-
Get the graph
- getGraph() - Method in class org.jgrapht.alg.cycle.TarjanSimpleCycles
-
Get the graph
- getGraph() - Method in class org.jgrapht.alg.cycle.TiernanSimpleCycles
-
Get the graph
- getGraph() - Method in interface org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem
-
Returns the flow network
- getGraph() - Method in class org.jgrapht.alg.flow.mincost.MinimumCostFlowProblem.MinimumCostFlowProblemImpl
-
Returns the flow network
- getGraph() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm.Matching
-
Returns the graph over which this matching is defined.
- getGraph() - Method in class org.jgrapht.alg.interfaces.MatchingAlgorithm.MatchingImpl
- getGraph() - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in interface org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.Embedding
-
Returns the underlying
graph
- getGraph() - Method in class org.jgrapht.alg.interfaces.PlanarityTestingAlgorithm.EmbeddingImpl
-
Returns the underlying
graph
- getGraph() - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Return the underlying graph.
- getGraph() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.DualSolution
- getGraph() - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyPrecomputation.ContractionHierarchy
-
Returns the underlying graph of this contraction hierarchy.
- getGraph() - Method in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
- getGraph() - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Returns the graph over which this set of paths is defined.
- getGraph() - Method in class org.jgrapht.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.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
- getHeavyEdges() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Set of heavy edges.
- getHeight() - Method in class org.jgrapht.alg.drawing.model.Box2D
-
Get the height
- getHole() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
A graph which is not chordal, must contain a hole (chordless cycle on 4 or more vertices).
- getIndependentSet() - Method in class org.jgrapht.alg.independentset.ChordalGraphIndependentSetFinder
-
Returns a maximum cardinality independent set of the inspected
graph
. - getIndependentSet() - Method in interface org.jgrapht.alg.interfaces.IndependentSetAlgorithm
-
Computes an independent set; all vertices are considered to have equal weight.
- 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. - getInitializationType() - Method in class org.jgrapht.alg.matching.blossom.v5.BlossomVOptions
-
Returns initialization type
- getInternalState() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Return the internal representation of the data.
- getIntrusiveEdge(E) - Method in class org.jgrapht.graph.BaseIntrusiveEdgesSpecifics
-
Get the intrusive edge of an edge.
- getIntrusiveEdge(E) - Method in class org.jgrapht.graph.UniformIntrusiveEdgesSpecifics
- getIntrusiveEdge(E) - Method in class org.jgrapht.graph.WeightedIntrusiveEdgesSpecifics
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.graph.DefaultGraphSpecificsStrategy
- getIntrusiveEdgesSpecificsFactory() - Method in class org.jgrapht.graph.FastLookupGraphSpecificsStrategy
- getIntrusiveEdgesSpecificsFactory() - Method in interface org.jgrapht.graph.GraphSpecificsStrategy
-
Get a function which creates the intrusive edges specifics.
- 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
- getIterationOrder() - Method in class org.jgrapht.alg.cycle.ChordalityInspector
-
Returns the type of iterator used in this
ChordalityInspector
- 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
. - getLabel(V) - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the label of the subset that contains
vertex
. - getLabels() - Method in interface org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree
-
Return the set of labels of the underlying partition of the capacitated spanning tree.
- getLabels() - Method in class org.jgrapht.alg.interfaces.CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl
- getLabels() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns all labels of all subsets.
- getLast() - Method in class org.jgrapht.util.DoublyLinkedList
- getLastHop(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Returns the last hop, i.e., the second to last node on the shortest path from $a$ to $b$.
- getLastNode() - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the last
node
of this list. - getLCA(V, V) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.NaiveLCAFinder
-
Return the LCA of a and b
- getLCA(V, V) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
-
Return the LCA of a and b
- getLCASet(V, V) - Method in interface org.jgrapht.alg.interfaces.LowestCommonAncestorAlgorithm
-
Return the computed set of LCAs of a and b
- getLCASet(V, V) - Method in class org.jgrapht.alg.lca.BinaryLiftingLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLCASet(V, V) - Method in class org.jgrapht.alg.lca.EulerTourRMQLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLCASet(V, V) - Method in class org.jgrapht.alg.lca.HeavyPathLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLCASet(V, V) - Method in class org.jgrapht.alg.lca.NaiveLCAFinder
-
Return the computed set of LCAs of a and b
- getLCASet(V, V) - Method in class org.jgrapht.alg.lca.TarjanLCAFinder
-
Note: This operation is not supported.
Return the computed set of LCAs of a and b - getLeft() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a left child of this node
- getLength() - Method in interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasis
-
Get the length of the cycle basis.
- getLength() - Method in class org.jgrapht.alg.interfaces.CycleBasisAlgorithm.CycleBasisImpl
-
Get the length of the cycle basis.
- getLength() - Method in class org.jgrapht.graph.GraphWalk
- getLength() - Method in interface org.jgrapht.GraphPath
-
Returns the length of the path, measured in the number of edges.
- getLightEdges() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Set of light edges.
- getLocalAugmentationCycle() - Method in class org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation
-
Calculates a valid subset-disjoint negative cycle.
- getLock() - Method in class org.jgrapht.graph.concurrent.AsSynchronizedGraph
-
Get the read/write lock used to synchronize all access to this graph.
- getManyToManyPaths(Set<V>, Set<V>) - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm
-
Computes shortest paths from all vertices in
sources
to all vertices intargets
. - getManyToManyPaths(Set<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.CHManyToManyShortestPaths
-
Computes shortest paths from all vertices in
sources
to all vertices intargets
. - getManyToManyPaths(Set<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.DefaultManyToManyShortestPaths
- getManyToManyPaths(Set<V>, Set<V>) - Method in class org.jgrapht.alg.shortestpath.DijkstraManyToManyShortestPaths
-
Computes shortest paths from all vertices in
sources
to all vertices intargets
. - getMapping() - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Get an isomorphism between the input forests or
null
if none exists. - getMapping() - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Get an isomorphism between the input trees or
null
if none exists. - getMapping() - Method in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Get an isomorphism between the input trees or
null
if none exists. - getMappingDomain() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get the active domain of the isomorphism.
- getMappingRange() - Method in class org.jgrapht.alg.isomorphism.IsomorphicGraphMapping
-
Get the range of the isomorphism.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.AHUForestIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.AHURootedTreeIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.AHUUnrootedTreeIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.ColorRefinementIsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in interface org.jgrapht.alg.isomorphism.IsomorphismInspector
-
Get an iterator over all calculated (isomorphic) mappings between two graphs.
- getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2AbstractIsomorphismInspector
- getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2GraphIsomorphismInspector
- getMappings() - Method in class org.jgrapht.alg.isomorphism.VF2SubgraphIsomorphismInspector
- getMatching() - Method in interface org.jgrapht.alg.interfaces.MatchingAlgorithm
-
Compute a matching for a given graph.
- getMatching() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedMatching
-
Computes and returns a matching of maximum or minimum weight in the
initialGraph
depending on the goal of the algorithm. - getMatching() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Computes and returns a weighted perfect matching in the
graph
. - getMatching() - Method in class org.jgrapht.alg.matching.DenseEdmondsMaximumCardinalityMatching
-
Returns a matching of maximum cardinality.
- getMatching() - Method in class org.jgrapht.alg.matching.GreedyMaximumCardinalityMatching
-
Get a matching that is a $\frac{1}{2}$-approximation of the maximum cardinality matching.
- getMatching() - Method in class org.jgrapht.alg.matching.GreedyWeightedMatching
-
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
- getMatching() - Method in class org.jgrapht.alg.matching.HopcroftKarpMaximumCardinalityBipartiteMatching
- getMatching() - Method in class org.jgrapht.alg.matching.KuhnMunkresMinimalWeightBipartitePerfectMatching
-
Compute a matching for a given graph.
- getMatching() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Compute a matching for a given graph.
- getMatching() - Method in class org.jgrapht.alg.matching.PathGrowingWeightedMatching
-
Get a matching that is a $\frac{1}{2}$-approximation of the maximum weighted matching.
- getMatching() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
- getMatchingWeight() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Get the weight of the matching.
- 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.
- 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
. - 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.
- 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.
- 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
- getName() - Method in class org.jgrapht.nio.tsplib.TSPLIBImporter.Specification
-
Returns the value of the NAME keyword in the imported file.
- 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
- getNextFreeLabel() - Method in class org.jgrapht.alg.spanning.AbstractCapacitatedMinimumSpanningTree.CapacitatedSpanningTreeSolutionRepresentation
-
Returns the next free label in the label map respectively partition
- getNode(int) - Method in class org.jgrapht.util.DoublyLinkedList
-
Returns the
node
at the specified position in this list. - 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.
- getNumberOfTriangles(Graph<V, E>) - Static method in class org.jgrapht.GraphMetrics
-
An $O(|E|^{3/2})$ algorithm for counting the number of non-trivial triangles in an undirected graph.
- getNumberPartitions() - Method in interface org.jgrapht.alg.interfaces.PartitioningAlgorithm.Partitioning
-
Get the number of partitions.
- getNumberPartitions() - Method in class org.jgrapht.alg.interfaces.PartitioningAlgorithm.PartitioningImpl
-
Get the number of partitions.
- getNumDimensions() - Method in class org.jgrapht.alg.drawing.model.Point2D
-
Get the number of dimensions of the point
- getOddSetCover() - Method in class org.jgrapht.alg.matching.SparseEdmondsMaximumCardinalityMatching
-
Get an odd set cover which proves the optimality of the computed matching.
- getOppositeVertex(HierholzerEulerianCycle.VertexNode, HierholzerEulerianCycle.EdgeNode) - Method in class org.jgrapht.alg.cycle.HierholzerEulerianCycle
-
Compute the opposite end-point of an end-point of an edge.
- getOppositeVertex(Graph<V, E>, E, V) - Static method in class org.jgrapht.Graphs
-
Gets the vertex opposite another vertex across an edge.
- getParent() - 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(Integer, Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
- getPath(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm.SingleSourcePaths
-
Return the path from the source vertex to the sink vertex.
- getPath(V) - Method in class org.jgrapht.alg.shortestpath.ListSingleSourcePathsImpl
-
Return the path from the source vertex to the sink vertex.
- getPath(V) - Method in class org.jgrapht.alg.shortestpath.TreeSingleSourcePathsImpl
-
Return the path from the source vertex to the sink vertex.
- getPath(V, V) - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
-
Return the path from the
source
vertex to thetarget
vertex. - getPath(V, V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.AStarShortestPath
-
Calculates (and returns) the shortest path from the sourceVertex to the targetVertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalAStarShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.BidirectionalDijkstraShortestPath
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.ContractionHierarchyBidirectionalDijkstra
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get a shortest path from a source vertex to a sink vertex.
- getPath(V, V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Get a shortest path from a source vertex to a sink vertex.
- 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.
- getPathDecomposition() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition
-
Computes a path decomposition.
- getPathDecomposition() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm
-
Computes a path decomposition.
- getPaths() - Method in interface org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecomposition
-
Set of disjoint paths of the decomposition
- getPaths() - Method in class org.jgrapht.alg.interfaces.TreeToPathDecompositionAlgorithm.PathDecompositionImpl
- getPaths(Integer) - Method in class org.jgrapht.alg.shortestpath.IntVertexDijkstraShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths
-
Return the path from the source vertex to the sink vertex.
- getPaths(V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BellmanFordShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.BFSShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.DeltaSteppingShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.DijkstraShortestPath
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Compute all shortest paths starting from a single source vertex.
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl
- getPaths(V) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
- getPaths(V, V) - Method in interface org.jgrapht.alg.interfaces.MultiObjectiveShortestPathAlgorithm
-
Get a shortest path from a source vertex to a sink vertex.
- getPaths(V, V) - Method in class org.jgrapht.alg.shortestpath.MartinShortestPath
- getPaths(V, V, int) - Method in interface org.jgrapht.alg.interfaces.KShortestPathAlgorithm
-
Get a list of k-shortest paths from a source vertex to a sink vertex.
- getPaths(V, V, int) - Method in class org.jgrapht.alg.shortestpath.EppsteinKShortestPath
-
Computes
k
shortest paths betweensource
andsink
. - getPaths(V, V, int) - Method in class org.jgrapht.alg.shortestpath.YenKShortestPath
-
Computes
k
shortest loopless paths betweensource
andsink
. - getPathWeight(V, V) - Method in interface org.jgrapht.alg.interfaces.ShortestPathAlgorithm
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- getPathWeight(V, V) - Method in class org.jgrapht.alg.shortestpath.JohnsonShortestPaths
-
Get the weight of the shortest path from a source vertex to a sink vertex.
- 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.
- 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.
- getPositionInPathArray() - Method in class org.jgrapht.alg.decomposition.HeavyPathDecomposition.InternalState
-
Return the internal positionInPath array.
- getPotentials() - Method in class org.jgrapht.alg.matching.MaximumWeightBipartiteMatching
-
Get the vertex potentials.
- 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 - getPrev() - Method in interface org.jgrapht.util.DoublyLinkedList.ListNode
-
Returns the previous node in the list structure with respect to this node
- getProblem() - Method in enum org.jgrapht.nio.dimacs.DIMACSFormat
-
Get the name of the problem.
- 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
- getRight() - Method in class org.jgrapht.util.AVLTree.TreeNode
-
Returns a right child of this node
- 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
- getSavedComparisons() - Method in class org.jgrapht.alg.drawing.IndexedFRLayoutAlgorithm2D
-
Get the total number of saved comparisons due to the Barnes-Hut technique.
- getScores() - Method in interface org.jgrapht.alg.interfaces.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
- 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
-
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.
- getSeparators() - Method in class org.jgrapht.alg.clique.CliqueMinimalSeparatorDecomposition
-
Get the clique minimal separators.
- getShortestPathAlgorithm() - Method in class org.jgrapht.alg.scoring.ClosenessCentrality
-
Get the shortest path algorithm for the paths computation.
- getShortestPathLength(V) - Method in class org.jgrapht.traverse.ClosestFirstIterator
-
Get the weighted length of the shortest path known to the given vertex.
- getShortestPathsCount() - Method in class org.jgrapht.alg.shortestpath.FloydWarshallShortestPaths
-
Get the total number of shortest paths.
- getShrinkNum() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getShrinkTime() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching.Statistics
- getSingletonTour(Graph<V, E>) - Method in class org.jgrapht.alg.tour.HamiltonianCycleAlgorithmBase
-
Creates a tour for a graph with 1 vertex
- 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.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.
- 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.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.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.graph.GraphWalk
- getStartVertex() - Method in interface org.jgrapht.GraphPath
-
Returns the start vertex in the path.
- getStatistics() - Method in class org.jgrapht.alg.matching.blossom.v5.KolmogorovWeightedPerfectMatching
-
Returns the statistics describing the performance characteristics of the algorithm.
- getStronglyConnectedComponents() - Method in interface org.jgrapht.alg.interfaces.StrongConnectivityAlgorithm
-
Computes a list of subgraphs of the given graph.
- 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
- 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
- getTarget() - Method in class org.jgrapht.graph.DefaultEdge
-
Retrieves the target of this edge.
- getTarget() - Method in class org.jgrapht.graph.DefaultWeightedEdge
-
Retrieves the target of this edge.
- getTargets() - Method in class org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.BaseManyToManyShortestPathsImpl
- getTargets() - Method in interface org.jgrapht.alg.interfaces.ManyToManyShortestPathsAlgorithm.ManyToManyShortestPaths
-
Returns the set of target vertices for which this many-to-many shortest paths were computed.
- getThird() - Method in class org.jgrapht.alg.util.Triple
-
Get the third element
- getTopologicalIndex(V) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Get the topological index of the given vertex.
- getTopologicalIndex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- getTopologicalIndex(V) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- getTotalSupply() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the total supply of the network.
- getTour() - Method in class org.jgrapht.demo.ParberryKnightTour
-
Returns a closed knight's tour.
- 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(TourType, boolean, int, int) - Method in class org.jgrapht.demo.WarnsdorffRuleKnightTourHeuristic
-
Generates a knight's tour that satisfies the input parameters.
- 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.
- 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.
- getTransshipSinkNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of transshipment sinks in the network.
- getTransshipSourceNum() - Method in class org.jgrapht.generate.netgen.NetworkGeneratorConfig
-
Returns the number of transshipment sources in the network.
- 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
- 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.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
- getUnmodifiableIncomingEdges() - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
A lazy build of unmodifiable incoming edge set.
- getUnmodifiableOutgoingEdges() - Method in class org.jgrapht.graph.specifics.DirectedEdgeContainer
-
A lazy build of unmodifiable outgoing edge set.
- getUnmodifiableVertexEdges() - Method in class org.jgrapht.graph.specifics.UndirectedEdgeContainer
-
A lazy build of unmodifiable list of vertex edges
- getValue() - Method in interface org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlow
-
Returns value of the maximum-flow for the given network
- getValue() - Method in class org.jgrapht.alg.interfaces.MaximumFlowAlgorithm.MaximumFlowImpl
- getValue() - Method in interface org.jgrapht.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.ModifiableInteger
-
Returns the value of this object, similarly to
ModifiableInteger.intValue()
. - getVertex() - Method in class org.jgrapht.event.GraphVertexChangeEvent
-
Returns the vertex that this event is related to.
- getVertex() - Method in class org.jgrapht.event.VertexTraversalEvent
-
Returns the traversed vertex.
- getVertex(Integer) - Method in interface org.jgrapht.graph.DirectedAcyclicGraph.TopoOrderMap
-
Get the vertex at the given topological index.
- getVertex(Integer) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexBiMap
- getVertex(Integer) - Method in class org.jgrapht.graph.DirectedAcyclicGraph.TopoVertexMap
- 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
- getVertexCover() - Method in interface org.jgrapht.alg.interfaces.VertexCoverAlgorithm
-
Computes a vertex cover.
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.BarYehudaEvenTwoApproxVCImpl
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.ClarksonTwoApproxVCImpl
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.EdgeBasedTwoApproxVCImpl
-
Finds a 2-approximation for a minimal vertex cover of the specified graph.
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.GreedyVCImpl
-
Finds a greedy solution to the minimum weighted vertex cover problem.
- getVertexCover() - Method in class org.jgrapht.alg.vertexcover.RecursiveExactVCImpl
- getVertexEccentricityMap() - Method in class org.jgrapht.alg.shortestpath.GraphMeasurer
-
Compute the eccentricity of each vertex in the graph.
- 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.