Uses of Interface
org.jgrapht.Graph
Packages that use Graph
Package
Description
The front-end API's interfaces and classes, including
Graph
.Algorithms provided with JGraphT.
Clique related algorithms.
Graph clustering algorithms.
Graph coloring algorithms.
Algorithms dealing with various connectivity aspects of a graph.
Algorithms related to graph cycles.
Algorithms for computing decompositions.
Algorithms for computing maximum density subgraphs.
Graph Drawing.
Flow related algorithms.
Algorithms for minimum cost flow
Algorithms for Independent
Set in a graph.
Algorithm related interfaces.
Algorithms for (sub)graph isomorphism.
Algorithms for computing lowest common ancestors in graphs.
Algorithms for link prediction
Algorithms for the computation of matchings.
Package for Kolmogorov's Blossom V algorithm
Algorithm for computing partitions.
Algorithms for testing planarity of the graphs
Vertex and/or edge scoring algorithms.
Shortest-path related algorithms.
Algorithms for computing graph similarity metrics.
Spanning tree and spanner algorithms.
Graph tours related algorithms.
Package for graph transformers
Utilities used by JGraphT algorithms.
Vertex cover algorithms.
Generators for graphs of various topologies.
Network generator components
Implementations of various graphs.
Various builder for graphs.
Implementations of various concurrent graph structures.
Implementations of specifics for various graph types.
Importers/Exporters for various graph formats.
CSV importers/exporters
DIMACS Challenges importers/exporters
DOT importers/exporters
Graph Exchange XML Format (GEXF) importers/exporters.
GML importers/exporters
Graph6, sparse6 and digraph6 importers/exporters
GraphML importers/exporters
Json importers/exporters
Lemon input/output.
Matrix input/output
TSPLIB95 importers/exporters
Specialized graph implementations using the FastUtil library
Specialized graph implementations using sparse matrix representations.
Implementations of different sparse graphs with different tradeoffs.
Immutable graphs stored using Sux4J's quasi-succinct data
structures.
Graph traversal means.
Adapters for graphs stored using
WebGraph's compressed and succinct
formats.
-
Uses of Graph in org.jgrapht
Subinterfaces of Graph in org.jgraphtModifier and TypeInterfaceDescriptioninterface
ListenableGraph<V,
E> A graph that supports listeners on structural change events.Methods in org.jgrapht that return GraphModifier and TypeMethodDescriptionGraphIterables.getGraph()
Get the underlying graph.GraphPath.getGraph()
Returns the graph over which this path is defined.static <V,
E> Graph <V, E> GraphTests.requireDirected
(Graph<V, E> graph) Checks that the specified graph is directed and throws anIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireDirected
(Graph<V, E> graph, String message) Checks that the specified graph is directed and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireDirectedOrUndirected
(Graph<V, E> graph) Checks that the specified graph is directed and throws anIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireDirectedOrUndirected
(Graph<V, E> graph, String message) Checks that the specified graph is directed or undirected and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireUndirected
(Graph<V, E> graph) Checks that the specified graph is undirected and throws anIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireUndirected
(Graph<V, E> graph, String message) Checks that the specified graph is undirected and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireWeighted
(Graph<V, E> graph) Checks that the specified graph is weighted and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> Graphs.undirectedGraph
(Graph<V, E> g) Returns an undirected view of the specified graph.Methods in org.jgrapht with parameters of type GraphModifier and TypeMethodDescriptionstatic <V,
E> boolean Graphs.addAllEdges
(Graph<? super V, ? super E> destination, Graph<V, E> source, Collection<? extends E> edges) Adds a subset of the edges of the specified source graph to the specified destination graph.static <V,
E> boolean Graphs.addAllVertices
(Graph<? super V, ? super E> destination, Collection<? extends V> vertices) Adds all of the specified vertices to the destination graph.static <V,
E> E Creates a new edge and adds it to the specified graph similarly to theaddEdge(Object, Object)
method.static <V,
E> boolean Graphs.addEdgeWithVertices
(Graph<V, E> targetGraph, Graph<V, E> sourceGraph, E edge) Adds the specified edge to the graph, including its vertices if not already included.static <V,
E> E Graphs.addEdgeWithVertices
(Graph<V, E> g, V sourceVertex, V targetVertex) 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 theaddEdge(Object, Object)
method.static <V,
E> E Graphs.addEdgeWithVertices
(Graph<V, E> g, V sourceVertex, V targetVertex, double weight) 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 theaddEdge(Object, Object)
method.static <V,
E> boolean Adds all the vertices and all the edges of the specified source graph to the specified destination graph.static <V,
E> void Graphs.addGraphReversed
(Graph<? super V, ? super E> destination, Graph<V, E> source) Adds all the vertices and all the edges of the specified source digraph to the specified destination digraph, reversing all of the edges.static <V,
E> void Graphs.addIncomingEdges
(Graph<V, E> graph, V target, Iterable<V> sources) Add edges from multiple source vertices to one target vertex.static <V,
E> void Graphs.addOutgoingEdges
(Graph<V, E> graph, V source, Iterable<V> targets) Add edges from one source vertex to multiple target vertices.static <V,
E> double GraphMetrics.getDiameter
(Graph<V, E> graph) Compute the diameter of the graph.static <V,
E> int Compute the girth of the graph.static <V,
E> long GraphMetrics.getNumberOfTriangles
(Graph<V, E> graph) An $O(|E|^{3/2})$ algorithm for counting the number of non-trivial triangles in an undirected graph.static <V,
E> V Graphs.getOppositeVertex
(Graph<V, E> g, E e, V v) Gets the vertex opposite another vertex across an edge.static <V,
E> double Compute the radius of the graph.static <V,
E> VertexToIntegerMapping <V> Graphs.getVertexToIntegerMapping
(Graph<V, E> graph) Compute a new mapping from the vertices of a graph to the integer range $[0, n)$ where $n$ is the number of vertices in the graph.static <V,
E> boolean GraphTests.hasMultipleEdges
(Graph<V, E> graph) Check if a graph has multiple edges (parallel edges), that is, whether the graph contains two or more edges connecting the same pair of vertices.static <V,
E> boolean GraphTests.hasOreProperty
(Graph<V, E> graph) Tests whether an undirected graph meets Ore's condition to be Hamiltonian.static <V,
E> boolean GraphTests.hasSelfLoops
(Graph<V, E> graph) Check if a graph has self-loops.static <V,
E> boolean GraphTests.isBiconnected
(Graph<V, E> graph) Tests if the inspected graph is biconnected.static <V,
E> boolean GraphTests.isBipartite
(Graph<V, E> graph) Test whether a graph is bipartite.static <V,
E> boolean GraphTests.isBipartitePartition
(Graph<V, E> graph, Set<? extends V> firstPartition, Set<? extends V> secondPartition) Test whether a partition of the vertices into two sets is a bipartite partition.static <V,
E> boolean Checks whether a graph is chordal.static <V,
E> boolean GraphTests.isComplete
(Graph<V, E> graph) Test whether a graph is complete.static <V,
E> boolean GraphTests.isConnected
(Graph<V, E> graph) Test if the inspected graph is connected.static <V,
E> boolean Tests whether a graph is cubic.static <V,
E> boolean Test whether a graph is empty.static <V,
E> boolean GraphTests.isEulerian
(Graph<V, E> graph) Test whether a graph is Eulerian.static <V,
E> boolean Test whether an undirected graph is a forest.static <V,
E> boolean GraphTests.isK33Subdivision
(Graph<V, E> graph) Checks whether thegraph
is a $K_{3,3}$ subdivision.static <V,
E> boolean GraphTests.isK5Subdivision
(Graph<V, E> graph) Checks whether thegraph
is a $K_5$ subdivision.static <V,
E> boolean GraphTests.isKuratowskiSubdivision
(Graph<V, E> graph) Checks whether thegraph
is a Kuratowski subdivision.static <V,
E> boolean GraphTests.isOverfull
(Graph<V, E> graph) Test whether a graph is overfull.static <V,
E> boolean Checks that the specified graph is perfect.static <V,
E> boolean Checks that the specified graph is planar.static <V,
E> boolean Check if a graph is simple.static <V,
E> boolean Test whether an undirected graph is a split graph.static <V,
E> boolean GraphTests.isStronglyConnected
(Graph<V, E> graph) Test whether a graph is strongly connected.static <V,
E> boolean Test whether an undirected graph is a tree.static <V,
E> boolean GraphTests.isTriangleFree
(Graph<V, E> graph) Tests whether an undirected graph is triangle-free (i.e.static <V,
E> boolean GraphTests.isWeaklyChordal
(Graph<V, E> graph) Checks whether a graph is weakly chordal.static <V,
E> boolean GraphTests.isWeaklyConnected
(Graph<V, E> graph) Test whether a directed graph is weakly connected.(package private) static <V,
E> long GraphMetrics.naiveCountTriangles
(Graph<V, E> graph, List<V> vertexSubset) An $O(|V|^3)$ (assuming vertexSubset provides constant time indexing) naive implementation for counting non-trivial triangles in an undirected graph induced by the subset of vertices.static <V,
E> List <V> Graphs.neighborListOf
(Graph<V, E> g, V vertex) Returns a list of vertices that are the neighbors of a specified vertex.static <V,
E> Set <V> Graphs.neighborSetOf
(Graph<V, E> g, V vertex) Returns a set of vertices that are neighbors of a specified vertex.static <V,
E> List <V> Graphs.predecessorListOf
(Graph<V, E> g, V vertex) Returns a list of vertices that are the direct predecessors of a specified vertex.private static <V,
E> Set <V> GraphTests.reachableWithDegree
(Graph<V, E> graph, V startVertex, int degree) Uses BFS to find all vertices of thegraph
which have a degreedegree
.static <V,
E> boolean Graphs.removeVertexAndPreserveConnectivity
(Graph<V, E> graph, Iterable<V> vertices) Removes all the given vertices from the given graph.static <V,
E> boolean Graphs.removeVertexAndPreserveConnectivity
(Graph<V, E> graph, V vertex) Removes the given vertex from the given graph.static <V,
E> boolean Graphs.removeVerticesAndPreserveConnectivity
(Graph<V, E> graph, Predicate<V> predicate) Filters vertices from the given graph and subsequently removes them.static <V,
E> Graph <V, E> GraphTests.requireDirected
(Graph<V, E> graph) Checks that the specified graph is directed and throws anIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireDirected
(Graph<V, E> graph, String message) Checks that the specified graph is directed and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireDirectedOrUndirected
(Graph<V, E> graph) Checks that the specified graph is directed and throws anIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireDirectedOrUndirected
(Graph<V, E> graph, String message) Checks that the specified graph is directed or undirected and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireUndirected
(Graph<V, E> graph) Checks that the specified graph is undirected and throws anIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireUndirected
(Graph<V, E> graph, String message) Checks that the specified graph is undirected and throws a customizedIllegalArgumentException
if it is not.static <V,
E> Graph <V, E> GraphTests.requireWeighted
(Graph<V, E> graph) Checks that the specified graph is weighted and throws a customizedIllegalArgumentException
if it is not.static <V,
E> List <V> Graphs.successorListOf
(Graph<V, E> g, V vertex) Returns a list of vertices that are the direct successors of a specified vertex.static <V,
E> boolean Graphs.testIncidence
(Graph<V, E> g, E e, V v) Tests whether an edge is incident to a vertex.static <V,
E> Graph <V, E> Graphs.undirectedGraph
(Graph<V, E> g) Returns an undirected view of the specified graph.static <V,
E> boolean Graphs.vertexHasPredecessors
(Graph<V, E> graph, V vertex) Check if a vertex has any direct predecessors.static <V,
E> boolean Graphs.vertexHasSuccessors
(Graph<V, E> graph, V vertex) Check if a vertex has any direct successors. -
Uses of Graph in org.jgrapht.alg
Fields in org.jgrapht.alg declared as GraphModifier and TypeFieldDescription(package private) final Graph
<Set<V>, DefaultWeightedEdge> StoerWagnerMinimumCut.workingGraph
Methods in org.jgrapht.alg with parameters of type GraphModifier and TypeMethodDescription<V,
E> void This method will remove all transitive edges from the graph passed as input parameter.Constructors in org.jgrapht.alg with parameters of type GraphModifierConstructorDescriptionStoerWagnerMinimumCut
(Graph<V, E> graph) Will compute the minimum cut in graph. -
Uses of Graph in org.jgrapht.alg.clique
Fields in org.jgrapht.alg.clique declared as GraphModifier and TypeFieldDescriptionCliqueMinimalSeparatorDecomposition.chordalGraph
Minimal triangulation of graphBaseBronKerboschCliqueFinder.graph
The underlying graphChordalGraphMaxCliqueFinder.graph
CliqueMinimalSeparatorDecomposition.graph
Source graph to operate onMethods in org.jgrapht.alg.clique that return GraphModifier and TypeMethodDescriptionprivate static <V,
E> Graph <V, E> CliqueMinimalSeparatorDecomposition.copyAsSimpleGraph
(Graph<V, E> graph) Create a copy of a graph for internal use.CliqueMinimalSeparatorDecomposition.getGraph()
Get the original graph.CliqueMinimalSeparatorDecomposition.getMinimalTriangulation()
Get the minimal triangulation of the graph.Methods in org.jgrapht.alg.clique with parameters of type GraphModifier and TypeMethodDescriptionprivate static <V,
E> Graph <V, E> CliqueMinimalSeparatorDecomposition.copyAsSimpleGraph
(Graph<V, E> graph) Create a copy of a graph for internal use.private static <V,
E> boolean Check whether the subgraph ofgraph
induced by the givenvertices
is complete, i.e.Constructors in org.jgrapht.alg.clique with parameters of type GraphModifierConstructorDescriptionBaseBronKerboschCliqueFinder
(Graph<V, E> graph, long timeout, TimeUnit unit) ConstructorBronKerboschCliqueFinder
(Graph<V, E> graph) Constructs a new clique finder.BronKerboschCliqueFinder
(Graph<V, E> graph, long timeout, TimeUnit unit) Constructs a new clique finder.ChordalGraphMaxCliqueFinder
(Graph<V, E> graph) Creates a new ChordalGraphMaxCliqueFinder instance.ChordalGraphMaxCliqueFinder
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a new ChordalGraphMaxCliqueFinder instance.Setup a clique minimal separator decomposition on undirected graphg
.DegeneracyBronKerboschCliqueFinder
(Graph<V, E> graph) Constructs a new clique finder.DegeneracyBronKerboschCliqueFinder
(Graph<V, E> graph, long timeout, TimeUnit unit) Constructs a new clique finder.PivotBronKerboschCliqueFinder
(Graph<V, E> graph) Constructs a new clique finder.PivotBronKerboschCliqueFinder
(Graph<V, E> graph, long timeout, TimeUnit unit) Constructs a new clique finder. -
Uses of Graph in org.jgrapht.alg.clustering
Fields in org.jgrapht.alg.clustering declared as GraphModifier and TypeFieldDescriptionGirvanNewmanClustering.graph
KSpanningTreeClustering.graph
LabelPropagationClustering.graph
LabelPropagationClustering.Implementation.graph
UndirectedModularityMeasurer.graph
Methods in org.jgrapht.alg.clustering with parameters of type GraphModifier and TypeMethodDescriptionConvert from a map representation to a list of sets.private void
UndirectedModularityMeasurer.precomputeDegrees
(Graph<V, E> graph) Pre-compute vertex (weighted) degrees.Constructors in org.jgrapht.alg.clustering with parameters of type GraphModifierConstructorDescriptionGirvanNewmanClustering
(Graph<V, E> graph, int k) Create a new clustering algorithm.GirvanNewmanClustering
(Graph<V, E> graph, int k, EdgeBetweennessCentrality.OverflowStrategy overflowStrategy, Iterable<V> startVertices) Create a new clustering algorithm.Implementation
(Graph<V, E> graph, Random rng, int maxIterations) Initialize the computationKSpanningTreeClustering
(Graph<V, E> graph, int k) Create a new clustering algorithm.LabelPropagationClustering
(Graph<V, E> graph) Create a new clustering algorithm.LabelPropagationClustering
(Graph<V, E> graph, int maxIterations) Create a new clustering algorithm.LabelPropagationClustering
(Graph<V, E> graph, int maxIterations, Random rng) Create a new clustering algorithm.LabelPropagationClustering
(Graph<V, E> graph, Random rng) Create a new clustering algorithm.UndirectedModularityMeasurer
(Graph<V, E> graph) Construct a new measurer -
Uses of Graph in org.jgrapht.alg.color
Fields in org.jgrapht.alg.color declared as GraphModifier and TypeFieldDescriptionChordalGraphColoring.graph
ColorRefinementAlgorithm.graph
GreedyColoring.graph
The input graphSaturationDegreeColoring.graph
Methods in org.jgrapht.alg.color with parameters of type GraphModifier and TypeMethodDescriptionprivate boolean
ColorRefinementAlgorithm.isAlphaConsistent
(VertexColoringAlgorithm.Coloring<V> alpha, Graph<V, E> graph) Checks whether alpha is a valid surjective l-coloring for the given graphConstructors in org.jgrapht.alg.color with parameters of type GraphModifierConstructorDescriptionBrownBacktrackColoring
(Graph<V, E> graph) Construct a new Brown backtracking algorithm.ChordalGraphColoring
(Graph<V, E> graph) Creates a new ChordalGraphColoring instance.ChordalGraphColoring
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a new ChordalGraphColoring instance.ColoringRepresentation
(Graph<V, E> graph, VertexColoringAlgorithm.Coloring<V> alpha) ColorRefinementAlgorithm
(Graph<V, E> graph) Construct a new coloring algorithm.ColorRefinementAlgorithm
(Graph<V, E> graph, VertexColoringAlgorithm.Coloring<V> alpha) Construct a new coloring algorithm.GreedyColoring
(Graph<V, E> graph) Construct a new coloring algorithm.LargestDegreeFirstColoring
(Graph<V, E> graph) Construct a new coloring algorithm.RandomGreedyColoring
(Graph<V, E> graph) Construct a new coloring algorithm.RandomGreedyColoring
(Graph<V, E> graph, Random rng) Construct a new coloring algorithmSaturationDegreeColoring
(Graph<V, E> graph) Construct a new coloring algorithm.SmallestDegreeLastColoring
(Graph<V, E> graph) Construct a new coloring algorithm. -
Uses of Graph in org.jgrapht.alg.connectivity
Classes in org.jgrapht.alg.connectivity that implement GraphModifier and TypeClassDescriptionclass
BlockCutpointGraph<V,
E> A Block-Cutpoint graph (also known as a block-cut tree).Fields in org.jgrapht.alg.connectivity declared as GraphModifier and TypeFieldDescriptionAbstractStrongConnectivityInspector.graph
BiconnectivityInspector.graph
BlockCutpointGraph.graph
ConnectivityInspector.graph
Fields in org.jgrapht.alg.connectivity with type parameters of type GraphModifier and TypeFieldDescriptionBiconnectivityInspector.blocks
BlockCutpointGraph.blocks
BiconnectivityInspector.connectedComponents
AbstractStrongConnectivityInspector.stronglyConnectedSubgraphs
BlockCutpointGraph.vertex2block
BiconnectivityInspector.vertex2blocks
BiconnectivityInspector.vertex2components
Methods in org.jgrapht.alg.connectivity that return GraphModifier and TypeMethodDescriptionReturns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected component) containing the vertex.Graph
<Graph<V, E>, DefaultEdge> AbstractStrongConnectivityInspector.getCondensation()
BiconnectivityInspector.getConnectedComponent
(V vertex) Returns the connected component containing the given vertex.AbstractStrongConnectivityInspector.getGraph()
Methods in org.jgrapht.alg.connectivity that return types with arguments of type GraphModifier and TypeMethodDescriptionBiconnectivityInspector.getBlocks()
Returns all blocks (biconnected components) in the graph.Returns a set of blocks (biconnected components) containing the specified vertex.BlockCutpointGraph.getBlocks()
Returns all blocks (biconnected components) in the graphGraph
<Graph<V, E>, DefaultEdge> AbstractStrongConnectivityInspector.getCondensation()
BiconnectivityInspector.getConnectedComponents()
Returns all connected components in the graph.AbstractStrongConnectivityInspector.getStronglyConnectedComponents()
Methods in org.jgrapht.alg.connectivity with parameters of type GraphModifier and TypeMethodDescriptionprivate void
KosarajuStrongConnectivityInspector.dfsVisit
(Graph<V, E> visitedGraph, KosarajuStrongConnectivityInspector.VertexData<V> vertexData, Set<V> vertices) Constructors in org.jgrapht.alg.connectivity with parameters of type GraphModifierConstructorDescriptionprotected
AbstractStrongConnectivityInspector
(Graph<V, E> graph) BiconnectivityInspector
(Graph<V, E> graph) Constructs a new BiconnectivityInspectorBlockCutpointGraph
(Graph<V, E> graph) Constructs a Block-Cutpoint graphConnectivityInspector
(Graph<V, E> g) Creates a connectivity inspector for the specified graph.GabowStrongConnectivityInspector
(Graph<V, E> graph) ConstructorKosarajuStrongConnectivityInspector
(Graph<V, E> graph) Constructor -
Uses of Graph in org.jgrapht.alg.cycle
Fields in org.jgrapht.alg.cycle declared as GraphModifier and TypeFieldDescriptionHierholzerEulerianCycle.g
AbstractFundamentalCycleBasis.graph
AhujaOrlinSharmaCyclicExchangeLocalAugmentation.graph
the input graphChordalGraphMinimalVertexSeparatorFinder.graph
The graph in which minimal vertex separators to searched inChordalityInspector.graph
The inspected graph.CycleDetector.graph
Graph on which cycle detection is being performed.HawickJamesSimpleCycles.graph
HowardMinimumMeanCycle.graph
The underlying graph.JohnsonSimpleCycles.graph
PatonCycleBase.graph
SzwarcfiterLauerSimpleCycles.graph
TarjanSimpleCycles.graph
TiernanSimpleCycles.graph
WeakChordalityInspector.graph
The inspected graphMethods in org.jgrapht.alg.cycle that return GraphModifier and TypeMethodDescriptionHawickJamesSimpleCycles.getGraph()
Get the graphSzwarcfiterLauerSimpleCycles.getGraph()
Get the graphTarjanSimpleCycles.getGraph()
Get the graphTiernanSimpleCycles.getGraph()
Get the graphMethods in org.jgrapht.alg.cycle that return types with arguments of type GraphMethods in org.jgrapht.alg.cycle with parameters of type GraphModifier and TypeMethodDescriptionprivate void
BergeGraphInspector.bfOddHoleCertificate
(Graph<V, E> g) WeakChordalityInspector.computeCoConnectedComponents
(Graph<V, E> graph, List<Pair<Integer, Integer>> separator) Computes the connected components of the complement of the graph induces by the vertices of theseparator
.private boolean
HowardMinimumMeanCycle.computeVertexDistance
(Graph<V, E> component) This method runs the reverted BFS starting fromcurrentCycleVertex
to update data inpolicyGraph
andvertexDistance
.private void
HowardMinimumMeanCycle.constructCycle
(Graph<V, E> component) Finds cycle in thepolicyGraph
and computes computes its mean.private void
HowardMinimumMeanCycle.constructPolicyGraph
(Graph<V, E> component) Computes policy graph forcomponent
and stores result inpolicyGraph
andvertexDistance
.(package private) boolean
BergeGraphInspector.containsCleanShortestOddHole
(Graph<V, E> g) Checks whether a graph contains a clean shortest odd hole.(package private) boolean
BergeGraphInspector.containsJewel
(Graph<V, E> g) Checks whether a graph contains a Jewel.(package private) boolean
BergeGraphInspector.containsPyramid
(Graph<V, E> g) Checks whether a graph contains a pyramid.private boolean
Checks whether the vertex set of a graph without a vertex set X contains a shortest odd hole.Returns all anticomponents of a graph and a vertex set.Finds all Components of a set F contained in V(g)WeakChordalityInspector.findCycle
(Set<V> visited, Graph<V, E> graph, V tarInSep, V tar, V sour, V sourInSep) Starts the iterative depth-first traversal fromsourInSep
vertex.private boolean
JohnsonSimpleCycles.findCyclesInSCG
(int startIndex, int vertexIndex, Graph<V, E> scg) WeakChordalityInspector.findHole
(Graph<V, E> graph, V sourceInSeparator, V source, V target, V targetInSeparator) Finds a hole in the specifiedgraph
.For each anticomponent X, find the maximal connected subset F' containing v5 with the properties that v1,v2 have no neighbours in F' and no vertex of F'\v5 is X-completeWeakChordalityInspector.findSeparators
(Graph<V, E> graph, E edge) Computes and returns all minimal separators in the neighborhood of theedge
in thegraph
.ChinesePostman.getCPPSolution
(Graph<V, E> graph) Solves the Chinese Postman Problem on the given graph.HierholzerEulerianCycle.getEulerianCycle
(Graph<V, E> g) Compute an Eulerian cycle of a graph.Returns a path in g from start to end avoiding the vertices in XPerforms iterative depth-first search starting from thestartVertex
in thegraph
.private boolean
Reports whether v has at least one neighbour in setprivate boolean
Reports whether a vertex has at least one nonneighbour in Xprivate boolean
BergeGraphInspector.hasConfigurationType1
(Graph<V, E> g) Checks whether a graph has a configuration of type T1.(package private) boolean
BergeGraphInspector.hasConfigurationType2
(Graph<V, E> g) Checks whether a graph is of configuration type T2.(package private) boolean
BergeGraphInspector.hasConfigurationType3
(Graph<V, E> g) Checks whether a graph is of configuration type T3.protected void
HierholzerEulerianCycle.initialize
(Graph<V, E> g) Index the graph and create a double-linked list representation suitable for vertex and edge removals in constant time.boolean
Performs the Berge Recognition Algorithm.boolean
Performs the Berge Recognition Algorithm.boolean
HierholzerEulerianCycle.isEulerian
(Graph<V, E> graph) Test whether a graph is Eulerian.private boolean
A triple (a,b,c) of vertices is relevant if a,b are distinct and nonadjacent, and c is not contained in N(a,b) (possibly c is contained in {a,b}).(package private) boolean
A vertex y is X-complete if y contained in V(g)\X is adjacent to every vertex in X.WeakChordalityInspector.minimizeCycle
(Graph<V, E> graph, List<V> cycle, V tar, V tarInSep, V sour, V sourInSep) Minimizes thecycle
so that it contains a hole in thegraph
.N(a,b) is the set of all {a,b}-complete verticesWeakChordalityInspector.neighborhoodSetOf
(Graph<V, E> g, E edge) Returns a set of vertices that are neighbors of the source of the specified edge or of the target of specified edge.BergeGraphInspector.p
(Graph<V, E> g, GraphPath<V, E> pathS, GraphPath<V, E> pathT, V m, V b1, V b2, V b3, V s1, V s2, V s3) Assembles a GraphPath of the Paths S and T.private int
r(a,b,c) is the cardinality of the largest anticomponent of N(a,b) that contains a nonneighbour of c (or 0, if c is N(a,b)-complete)ChinesePostman.replaceShortcutEdges
(Graph<V, E> inputGraph, GraphPath<V, E> pathWithShortcuts, Map<E, GraphPath<V, E>> shortcutEdges) private boolean
Checks whether a clean shortest odd hole is in g or whether X is a cleaner for an amenable shortest odd holeprivate boolean
If true, the graph is not Berge.Returns a set of vertex sets that may be near-cleaners for an amenable hole in g.void
Set the graphvoid
Set the graphvoid
Set the graphvoid
Set the graphstatic <V,
E> GraphPath <V, E> Cycles.simpleCycleToGraphPath
(Graph<V, E> graph, List<E> cycle) Transform a simple cycle from an edge set representation to a graph path.ChinesePostman.solveCPPDirected
(Graph<V, E> graph) Solves the CPP for directed graphsChinesePostman.solveCPPUndirected
(Graph<V, E> graph) Solves the CPP for undirected graphsW(a,b,c) is the anticomponent of N(a,b)+{c} that contains cX(a,b,c)=Y(a,b,c)+Z(a,b,c)Y(a,b,c) is the union of all anticomponents of N(a,b) that have cardinality strictly greater than r(a,b,c)Z(a,b,c) is the set of all (Y(a,b,c)+W(a,b,c))-complete verticesConstructors in org.jgrapht.alg.cycle with parameters of type GraphModifierConstructorDescriptionAbstractFundamentalCycleBasis
(Graph<V, E> graph) ConstructorAhujaOrlinSharmaCyclicExchangeLocalAugmentation
(Graph<V, E> graph, int lengthBound, Map<V, Integer> labelMap, boolean bestImprovement) Constructs an algorithm with given inputsCreates newChordalGraphMinimalVertexSeparatorFinder
instance.ChordalityInspector
(Graph<V, E> graph) Creates a chordality inspector forgraph
, which usesMaximumCardinalityIterator
as a default iterator.ChordalityInspector
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a chordality inspector forgraph
, which uses an iterator defined by the second parameter as an internal iterator.CycleDetector
(Graph<V, E> graph) Creates a cycle detector for the specified graph.HawickJamesSimpleCycles
(Graph<V, E> graph) Create a simple cycle finder for the specified graph.HowardMinimumMeanCycle
(Graph<V, E> graph) Constructs an instance of the algorithm for the givengraph
.HowardMinimumMeanCycle
(Graph<V, E> graph, int maximumIterations) Constructs an instance of the algorithm for the givengraph
andmaximumIterations
.HowardMinimumMeanCycle
(Graph<V, E> graph, int maximumIterations, StrongConnectivityAlgorithm<V, E> strongConnectivityAlgorithm, double toleranceEpsilon) Constructs an instance of the algorithm for the givengraph
,maximumIterations
,strongConnectivityAlgorithm
andtoleranceEpsilon
.JohnsonSimpleCycles
(Graph<V, E> graph) Create a simple cycle finder for the specified graph.PatonCycleBase
(Graph<V, E> graph) Create a cycle base finder for the specified graph.(package private)
QueueBFSFundamentalCycleBasis
(Graph<V, E> graph) ConstructorStackBFSFundamentalCycleBasis
(Graph<V, E> graph) ConstructorSzwarcfiterLauerSimpleCycles
(Graph<V, E> graph) Create a simple cycle finder for the specified graph.TarjanSimpleCycles
(Graph<V, E> graph) Create a simple cycle finder for the specified graph.TiernanSimpleCycles
(Graph<V, E> graph) Create a simple cycle finder for the specified graph.WeakChordalityInspector
(Graph<V, E> graph) Creates a weak chordality inspector for thegraph
-
Uses of Graph in org.jgrapht.alg.decomposition
Fields in org.jgrapht.alg.decomposition declared as GraphModifier and TypeFieldDescriptionDulmageMendelsohnDecomposition.graph
HeavyPathDecomposition.graph
Methods in org.jgrapht.alg.decomposition that return GraphModifier and TypeMethodDescriptionprivate Graph
<E, DefaultEdge> DulmageMendelsohnDecomposition.asDirectedEdgeGraph
(MatchingAlgorithm.Matching<V, E> matching, Set<V> subset) private Graph
<V, DefaultEdge> DulmageMendelsohnDecomposition.asDirectedGraph
(MatchingAlgorithm.Matching<V, E> matching) Constructors in org.jgrapht.alg.decomposition with parameters of type GraphModifierConstructorDescriptionConstruct 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$.Create an instance with a reference to the forest that we will decompose and to the sets of roots of the forest (one root per tree).HeavyPathDecomposition
(Graph<V, E> tree, V root) Create an instance with a reference to the tree that we will decompose and to the root of the tree. -
Uses of Graph in org.jgrapht.alg.densesubgraph
Fields in org.jgrapht.alg.densesubgraph declared as GraphModifier and TypeFieldDescriptionprivate Graph
<V, DefaultWeightedEdge> GoldbergMaximumDensitySubgraphAlgorithmBase.currentNetwork
GoldbergMaximumDensitySubgraphAlgorithmBase.densestSubgraph
GoldbergMaximumDensitySubgraphAlgorithmBase.graph
Methods in org.jgrapht.alg.densesubgraph that return GraphModifier and TypeMethodDescriptionprivate Graph
<V, DefaultWeightedEdge> GoldbergMaximumDensitySubgraphAlgorithmBase.buildNetwork()
Helper method for constructing the internally used networkGoldbergMaximumDensitySubgraphAlgorithmBase.calculateDensest()
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.Methods in org.jgrapht.alg.densesubgraph with parameters of type GraphModifier and TypeMethodDescriptionprotected double
GoldbergMaximumDensitySubgraphAlgorithm.computeDensityDenominator
(Graph<V, E> g) protected abstract double
GoldbergMaximumDensitySubgraphAlgorithmBase.computeDensityDenominator
(Graph<V, E> g) protected double
GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight.computeDensityDenominator
(Graph<V, E> g) protected double
GoldbergMaximumDensitySubgraphAlgorithmNodeWeights.computeDensityDenominator
(Graph<V, E> g) protected double
GoldbergMaximumDensitySubgraphAlgorithm.computeDensityNumerator
(Graph<V, E> g) protected abstract double
GoldbergMaximumDensitySubgraphAlgorithmBase.computeDensityNumerator
(Graph<V, E> g) protected double
GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight.computeDensityNumerator
(Graph<V, E> g) protected double
GoldbergMaximumDensitySubgraphAlgorithmNodeWeights.computeDensityNumerator
(Graph<V, E> g) Constructors in org.jgrapht.alg.densesubgraph with parameters of type GraphModifierConstructorDescriptionConvenience constructor that uses PushRelabel as default MinimumSTCutAlgorithmGoldbergMaximumDensitySubgraphAlgorithm
(Graph<V, E> graph, V s, V t, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorGoldbergMaximumDensitySubgraphAlgorithmBase
(Graph<V, E> graph, V s, V t, boolean checkWeights, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorGoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
(Graph<V, E> graph, V s, V t, double epsilon) Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithmGoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
(Graph<V, E> graph, V s, V t, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorConvenience constructor that uses PushRelabel as default MinimumSTCutAlgorithmGoldbergMaximumDensitySubgraphAlgorithmNodeWeights
(Graph<V, E> graph, V s, V t, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorConstructor parameters in org.jgrapht.alg.densesubgraph with type arguments of type GraphModifierConstructorDescriptionGoldbergMaximumDensitySubgraphAlgorithm
(Graph<V, E> graph, V s, V t, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorGoldbergMaximumDensitySubgraphAlgorithmBase
(Graph<V, E> graph, V s, V t, boolean checkWeights, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorGoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight
(Graph<V, E> graph, V s, V t, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) ConstructorGoldbergMaximumDensitySubgraphAlgorithmNodeWeights
(Graph<V, E> graph, V s, V t, double epsilon, Function<Graph<V, DefaultWeightedEdge>, MinimumSTCutAlgorithm<V, DefaultWeightedEdge>> algFactory) Constructor -
Uses of Graph in org.jgrapht.alg.drawing
Methods in org.jgrapht.alg.drawing with parameters of type GraphModifier and TypeMethodDescriptionFRLayoutAlgorithm2D.calculateAttractiveForces
(Graph<V, E> graph, LayoutModel2D<V> model) Calculate the repulsive forces between vertices connected with edges.FRLayoutAlgorithm2D.calculateRepulsiveForces
(Graph<V, E> graph, LayoutModel2D<V> model) Calculate the repulsive forces between verticesIndexedFRLayoutAlgorithm2D.calculateRepulsiveForces
(Graph<V, E> graph, LayoutModel2D<V> model) TwoLayeredBipartiteLayout2D.computePartitions
(Graph<V, E> graph) Compute the vertex partitions.protected void
TwoLayeredBipartiteLayout2D.drawFirstPartition
(Graph<V, E> graph, List<V> partition, LayoutModel2D<V> model) protected void
BarycenterGreedyTwoLayeredBipartiteLayout2D.drawSecondPartition
(Graph<V, E> graph, List<V> partition, LayoutModel2D<V> model) protected void
MedianGreedyTwoLayeredBipartiteLayout2D.drawSecondPartition
(Graph<V, E> graph, List<V> partition, LayoutModel2D<V> model) protected void
TwoLayeredBipartiteLayout2D.drawSecondPartition
(Graph<V, E> graph, List<V> partition, LayoutModel2D<V> model) protected void
Initialize a model using the initializer.void
void
void
void
Layout a graph.void
void
void
-
Uses of Graph in org.jgrapht.alg.flow
Fields in org.jgrapht.alg.flow declared as GraphModifier and TypeFieldDescriptionGusfieldGomoryHuCutTree.network
MaximumFlowAlgorithmBase.network
PadbergRaoOddMinimumCutset.network
Constructors in org.jgrapht.alg.flow with parameters of type GraphModifierConstructorDescriptionBoykovKolmogorovMFImpl
(Graph<V, E> network) Creates a new algorithm instance with the specifiednetwork
.BoykovKolmogorovMFImpl
(Graph<V, E> network, double epsilon) Construct a new algorithm instance with the specifiesnetwork
andepsilon
.DinicMFImpl
(Graph<V, E> network) Constructor.DinicMFImpl
(Graph<V, E> network, double epsilon) Constructor.EdmondsKarpMFImpl
(Graph<V, E> network) ConstructsMaximumFlow
instance to work with a copy ofnetwork
.EdmondsKarpMFImpl
(Graph<V, E> network, double epsilon) ConstructsMaximumFlow
instance to work with a copy ofnetwork
.GusfieldEquivalentFlowTree
(Graph<V, E> network) Constructs a new GusfieldEquivalentFlowTree instance.GusfieldEquivalentFlowTree
(Graph<V, E> network, double epsilon) Constructs a new GusfieldEquivalentFlowTree instance.GusfieldEquivalentFlowTree
(Graph<V, E> network, MinimumSTCutAlgorithm<V, E> minimumSTCutAlgorithm) Constructs a new GusfieldEquivalentFlowTree instance.GusfieldGomoryHuCutTree
(Graph<V, E> network) Constructs a new GusfieldEquivalentFlowTree instance.GusfieldGomoryHuCutTree
(Graph<V, E> network, double epsilon) Constructs a new GusfieldEquivalentFlowTree instance.GusfieldGomoryHuCutTree
(Graph<V, E> network, MinimumSTCutAlgorithm<V, E> minimumSTCutAlgorithm) Constructs a new GusfieldEquivalentFlowTree instance.MaximumFlowAlgorithmBase
(Graph<V, E> network, double epsilon) Construct a new maximum flowPadbergRaoOddMinimumCutset
(Graph<V, E> network) Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.PadbergRaoOddMinimumCutset
(Graph<V, E> network, double epsilon) Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.PadbergRaoOddMinimumCutset
(Graph<V, E> network, MinimumSTCutAlgorithm<V, E> minimumSTCutAlgorithm) Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.PushRelabelMFImpl
(Graph<V, E> network) Construct a new push-relabel algorithm.PushRelabelMFImpl
(Graph<V, E> network, double epsilon) Construct a new push-relabel algorithm. -
Uses of Graph in org.jgrapht.alg.flow.mincost
Fields in org.jgrapht.alg.flow.mincost declared as GraphMethods in org.jgrapht.alg.flow.mincost that return GraphModifier and TypeMethodDescriptionMinimumCostFlowProblem.getGraph()
Returns the flow networkMinimumCostFlowProblem.MinimumCostFlowProblemImpl.getGraph()
Returns the flow networkConstructors in org.jgrapht.alg.flow.mincost with parameters of type GraphModifierConstructorDescriptionMinimumCostFlowProblemImpl
(Graph<V, E> graph, Function<V, Integer> supplyMap, Function<E, Integer> arcCapacityUpperBounds) Constructs a new minimum cost flow problem without arc capacity lower bounds.MinimumCostFlowProblemImpl
(Graph<V, E> graph, Function<V, Integer> nodeSupplies, Function<E, Integer> arcCapacityUpperBounds, Function<E, Integer> arcCapacityLowerBounds) Constructs a new minimum cost flow problemMinimumCostFlowProblemImpl
(Graph<V, E> graph, Function<V, Integer> nodeSupplies, Function<E, Integer> arcCapacityUpperBounds, Function<E, Integer> arcCapacityLowerBounds, Function<E, Double> arcCosts) Constructs a new minimum cost flow problem -
Uses of Graph in org.jgrapht.alg.independentset
Fields in org.jgrapht.alg.independentset declared as GraphConstructors in org.jgrapht.alg.independentset with parameters of type GraphModifierConstructorDescriptionChordalGraphIndependentSetFinder
(Graph<V, E> graph) Creates a new ChordalGraphIndependentSetFinder instance.ChordalGraphIndependentSetFinder
(Graph<V, E> graph, ChordalityInspector.IterationOrder iterationOrder) Creates a new ChordalGraphIndependentSetFinder instance. -
Uses of Graph in org.jgrapht.alg.interfaces
Fields in org.jgrapht.alg.interfaces declared as GraphModifier and TypeFieldDescriptionCycleBasisAlgorithm.CycleBasisImpl.graph
MatchingAlgorithm.MatchingImpl.graph
PlanarityTestingAlgorithm.EmbeddingImpl.graph
The underlyinggraph
Methods in org.jgrapht.alg.interfaces that return GraphModifier and TypeMethodDescriptionMaximumDensitySubgraphAlgorithm.calculateDensest()
Calculate a maximum density subgraphGraph
<Graph<V, E>, DefaultEdge> StrongConnectivityAlgorithm.getCondensation()
Compute the condensation of the given graph.MatchingAlgorithm.Matching.getGraph()
Returns the graph over which this matching is defined.MatchingAlgorithm.MatchingImpl.getGraph()
MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths.getGraph()
Returns the graph over which this set of paths is defined.PlanarityTestingAlgorithm.Embedding.getGraph()
Returns the underlyinggraph
PlanarityTestingAlgorithm.EmbeddingImpl.getGraph()
Returns the underlyinggraph
ShortestPathAlgorithm.SingleSourcePaths.getGraph()
Returns the graph over which this set of paths is defined.StrongConnectivityAlgorithm.getGraph()
Return the underlying graph.PlanarityTestingAlgorithm.getKuratowskiSubdivision()
Extracts a Kuratowski subdivision from thegraph
.Methods in org.jgrapht.alg.interfaces that return types with arguments of type GraphModifier and TypeMethodDescriptionGraph
<Graph<V, E>, DefaultEdge> StrongConnectivityAlgorithm.getCondensation()
Compute the condensation of the given graph.StrongConnectivityAlgorithm.getStronglyConnectedComponents()
Computes a list of subgraphs of the given graph.Methods in org.jgrapht.alg.interfaces with parameters of type GraphModifier and TypeMethodDescriptionEulerianCycleAlgorithm.getEulerianCycle
(Graph<V, E> graph) Compute an Eulerian cycle of a graph.Computes a tour.boolean
CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree.isCapacitatedSpanningTree
(Graph<V, E> graph, V root, double capacity, Map<V, Double> demands) Tests whethercmst
is a CMST ongraph
with rootroot
, capacitycapacity
and demand functiondemands
.boolean
CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl.isCapacitatedSpanningTree
(Graph<V, E> graph, V root, double capacity, Map<V, Double> demands) default <E> boolean
AStarAdmissibleHeuristic.isConsistent
(Graph<V, E> graph) Returns true if the heuristic is a consistent or monotone heuristic wrt the providedgraph
.Constructors in org.jgrapht.alg.interfaces with parameters of type GraphModifierConstructorDescriptionCycleBasisImpl
(Graph<V, E> graph) Construct a new instance.Construct a new instance.Creates new embedding of thegraph
Construct a new instanceConstruct a new path decomposition. -
Uses of Graph in org.jgrapht.alg.isomorphism
Fields in org.jgrapht.alg.isomorphism declared as GraphModifier and TypeFieldDescriptionAHUForestIsomorphismInspector.forest1
AHUForestIsomorphismInspector.forest2
GraphOrdering.graph
ColorRefinementIsomorphismInspector.graph1
The input graphsIsomorphicGraphMapping.graph1
VF2AbstractIsomorphismInspector.graph1
ColorRefinementIsomorphismInspector.graph2
The input graphsIsomorphicGraphMapping.graph2
VF2AbstractIsomorphismInspector.graph2
AHURootedTreeIsomorphismInspector.tree1
AHUUnrootedTreeIsomorphismInspector.tree1
AHURootedTreeIsomorphismInspector.tree2
AHUUnrootedTreeIsomorphismInspector.tree2
Fields in org.jgrapht.alg.isomorphism with type parameters of type GraphMethods in org.jgrapht.alg.isomorphism that return GraphModifier and TypeMethodDescriptionprivate Graph
<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>, ColorRefinementIsomorphismInspector.DistinctGraphObject<E, V, E>> Calculates and returns a disjoint graph union ofgraph1
andgraph2
private Graph
<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>, ColorRefinementIsomorphismInspector.DistinctGraphObject<E, V, E>> ColorRefinementIsomorphismInspector.getDistinctObjectGraph
(Graph<V, E> graph) ColorRefinementIsomorphismInspector.DistinctGraphObject.getGraph()
GraphOrdering.getGraph()
Methods in org.jgrapht.alg.isomorphism that return types with arguments of type GraphModifier and TypeMethodDescriptionMethods in org.jgrapht.alg.isomorphism with parameters of type GraphModifier and TypeMethodDescriptionprivate void
AHURootedTreeIsomorphismInspector.computeLevels
(Graph<V, E> graph, V root) private Graph
<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>, ColorRefinementIsomorphismInspector.DistinctGraphObject<E, V, E>> Calculates and returns a disjoint graph union ofgraph1
andgraph2
private Graph
<ColorRefinementIsomorphismInspector.DistinctGraphObject<V, V, E>, ColorRefinementIsomorphismInspector.DistinctGraphObject<E, V, E>> ColorRefinementIsomorphismInspector.getDistinctObjectGraph
(Graph<V, E> graph) static <V,
E> IsomorphicGraphMapping <V, E> Computes an identity automorphism (i.e.static <T,
V, E> ColorRefinementIsomorphismInspector.DistinctGraphObject <T, V, E> private void
private void
AHURootedTreeIsomorphismInspector.validateTree
(Graph<V, E> tree, V root) private void
AHUUnrootedTreeIsomorphismInspector.validateTree
(Graph<V, E> tree) Constructors in org.jgrapht.alg.isomorphism with parameters of type GraphModifierConstructorDescriptionConstruct a new AHU rooted forest isomorphism inspector.Construct a new AHU rooted tree isomorphism inspector.Construct a new AHU unrooted tree isomorphism inspector.Constructor for a isomorphism inspector based on color refinement.private
DistinctGraphObject
(T object, Graph<V, E> graph) GraphOrdering
(Graph<V, E> graph) GraphOrdering
(Graph<V, E> graph, boolean orderByDegree, boolean cacheEdges) IsomorphicGraphMapping
(Map<V, V> forwardMapping, Map<V, V> backwardMapping, Graph<V, E> graph1, Graph<V, E> graph2) Construct a new isomorphic graph mapping.Construct a new base implementation of the VF2 isomorphism inspector.Construct a new base implementation of the VF2 isomorphism inspector.VF2AbstractIsomorphismInspector
(Graph<V, E> graph1, Graph<V, E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new base implementation of the VF2 isomorphism inspector.VF2AbstractIsomorphismInspector
(Graph<V, E> graph1, Graph<V, E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new base implementation of the VF2 isomorphism inspector.Construct a new VF2 isomorphism inspector.Construct a new VF2 isomorphism inspector.VF2GraphIsomorphismInspector
(Graph<V, E> graph1, Graph<V, E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new VF2 isomorphism inspector.VF2GraphIsomorphismInspector
(Graph<V, E> graph1, Graph<V, E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new VF2 isomorphism inspector.Construct a new VF2 subgraph isomorphism inspector.Construct a new VF2 subgraph isomorphism inspector.VF2SubgraphIsomorphismInspector
(Graph<V, E> graph1, Graph<V, E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new VF2 subgraph isomorphism inspector.VF2SubgraphIsomorphismInspector
(Graph<V, E> graph1, Graph<V, E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new VF2 subgraph isomorphism inspector. -
Uses of Graph in org.jgrapht.alg.lca
Fields in org.jgrapht.alg.lca declared as GraphModifier and TypeFieldDescriptionBinaryLiftingLCAFinder.graph
EulerTourRMQLCAFinder.graph
HeavyPathLCAFinder.graph
NaiveLCAFinder.graph
TarjanLCAFinder.graph
Methods in org.jgrapht.alg.lca with parameters of type GraphModifier and TypeMethodDescriptionNaiveLCAFinder.getAncestors
(Graph<V, E> graph, V start) Returns a set of nodes reachable from thestart
.Constructors in org.jgrapht.alg.lca with parameters of type GraphModifierConstructorDescriptionConstruct a new instance of the algorithm.BinaryLiftingLCAFinder
(Graph<V, E> graph, V root) Construct a new instance of the algorithm.Construct a new instance of the algorithm.EulerTourRMQLCAFinder
(Graph<V, E> graph, V root) Construct a new instance of the algorithm.Construct a new instance of the algorithm.HeavyPathLCAFinder
(Graph<V, E> graph, V root) Construct a new instance of the algorithm.NaiveLCAFinder
(Graph<V, E> graph) Create a new instance of the naive LCA finder.Construct a new instance of the algorithm.TarjanLCAFinder
(Graph<V, E> graph, V root) Construct a new instance of the algorithm. -
Uses of Graph in org.jgrapht.alg.linkprediction
Fields in org.jgrapht.alg.linkprediction declared as GraphModifier and TypeFieldDescriptionAdamicAdarIndexLinkPrediction.graph
CommonNeighborsLinkPrediction.graph
HubDepressedIndexLinkPrediction.graph
HubPromotedIndexLinkPrediction.graph
JaccardCoefficientLinkPrediction.graph
LeichtHolmeNewmanIndexLinkPrediction.graph
PreferentialAttachmentLinkPrediction.graph
ResourceAllocationIndexLinkPrediction.graph
SaltonIndexLinkPrediction.graph
SørensenIndexLinkPrediction.graph
Constructors in org.jgrapht.alg.linkprediction with parameters of type GraphModifierConstructorDescriptionAdamicAdarIndexLinkPrediction
(Graph<V, E> graph) Create a new predictionCommonNeighborsLinkPrediction
(Graph<V, E> graph) Create a new predictionHubDepressedIndexLinkPrediction
(Graph<V, E> graph) Create a new predictionHubPromotedIndexLinkPrediction
(Graph<V, E> graph) Create a new predictionJaccardCoefficientLinkPrediction
(Graph<V, E> graph) Create a new predictionLeichtHolmeNewmanIndexLinkPrediction
(Graph<V, E> graph) Create a new predictionPreferentialAttachmentLinkPrediction
(Graph<V, E> graph) Create a new predictionResourceAllocationIndexLinkPrediction
(Graph<V, E> graph) Create a new predictionSaltonIndexLinkPrediction
(Graph<V, E> graph) Create a new predictionSørensenIndexLinkPrediction
(Graph<V, E> graph) Create a new prediction -
Uses of Graph in org.jgrapht.alg.matching
Fields in org.jgrapht.alg.matching declared as GraphModifier and TypeFieldDescriptionDenseEdmondsMaximumCardinalityMatching.graph
GreedyMaximumCardinalityMatching.graph
GreedyWeightedMatching.graph
HopcroftKarpMaximumCardinalityBipartiteMatching.graph
KuhnMunkresMinimalWeightBipartitePerfectMatching.graph
MaximumWeightBipartiteMatching.graph
PathGrowingWeightedMatching.graph
SparseEdmondsMaximumCardinalityMatching.Algorithm.graph
SparseEdmondsMaximumCardinalityMatching.graph
Methods in org.jgrapht.alg.matching with parameters of type GraphModifier and TypeMethodDescriptionPathGrowingWeightedMatching.DynamicProgrammingPathSolver.getMaximumWeightMatching
(Graph<V, E> g, LinkedList<E> path) Find the maximum weight matching of a path using dynamic programming.static <V,
E> boolean SparseEdmondsMaximumCardinalityMatching.isOptimalMatching
(Graph<V, E> graph, Set<E> matching, Map<V, Integer> oddSetCover) Check whether a matching is optimal.Constructors in org.jgrapht.alg.matching with parameters of type GraphModifierConstructorDescriptionConstructs a new instance of the algorithm.DenseEdmondsMaximumCardinalityMatching
(Graph<V, E> graph, MatchingAlgorithm<V, E> initializer) Constructs a new instance of the algorithm.GreedyMaximumCardinalityMatching
(Graph<V, E> graph, boolean sort) Creates a new GreedyMaximumCardinalityMatching instance.GreedyWeightedMatching
(Graph<V, E> graph, boolean normalizeEdgeCosts) Create and execute a new instance of the greedy maximum weight matching algorithm.GreedyWeightedMatching
(Graph<V, E> graph, boolean normalizeEdgeCosts, double epsilon) Create and execute a new instance of the greedy maximum weight matching algorithm.HopcroftKarpMaximumCardinalityBipartiteMatching
(Graph<V, E> graph, Set<V> partition1, Set<V> partition2) Constructs a new instance of the Hopcroft Karp bipartite matching algorithm.Construct new instanceKuhnMunkresMinimalWeightBipartitePerfectMatching
(Graph<V, E> graph, Set<? extends V> partition1, Set<? extends V> partition2) Construct a new instance of the algorithm.Constructor.MaximumWeightBipartiteMatching
(Graph<V, E> graph, Set<V> partition1, Set<V> partition2, Function<Comparator<BigDecimal>, org.jheaps.AddressableHeap<BigDecimal, V>> heapSupplier) Constructor.PathGrowingWeightedMatching
(Graph<V, E> graph) Construct a new instance of the path growing algorithm.PathGrowingWeightedMatching
(Graph<V, E> graph, boolean useHeuristics) Construct a new instance of the path growing algorithm.PathGrowingWeightedMatching
(Graph<V, E> graph, boolean useHeuristics, double epsilon) Construct a new instance of the path growing algorithm.Constructs a new instance of the algorithm.SparseEdmondsMaximumCardinalityMatching
(Graph<V, E> graph, MatchingAlgorithm<V, E> initializer) Constructs a new instance of the algorithm. -
Uses of Graph in org.jgrapht.alg.matching.blossom.v5
Fields in org.jgrapht.alg.matching.blossom.v5 declared as GraphModifier and TypeFieldDescriptionBlossomVInitializer.graph
The graph for which to find a matchingBlossomVState.graph
The graph for which to find a matchingKolmogorovWeightedMatching.graph
The graph created during the reductionKolmogorovWeightedPerfectMatching.DualSolution.graph
The graph on which both primal and dual linear programs are formulatedKolmogorovWeightedPerfectMatching.graph
The graph we are matching onKolmogorovWeightedMatching.initialGraph
The graph we are matching onKolmogorovWeightedPerfectMatching.initialGraph
Initial graph specified during the construction timeMethods in org.jgrapht.alg.matching.blossom.v5 that return GraphConstructors in org.jgrapht.alg.matching.blossom.v5 with parameters of type GraphModifierConstructorDescriptionBlossomVInitializer
(Graph<V, E> graph) Creates a new BlossomVInitializer instanceBlossomVState
(Graph<V, E> graph, BlossomVNode[] nodes, BlossomVEdge[] edges, int nodeNum, int edgeNum, int treeNum, List<V> graphVertices, List<E> graphEdges, BlossomVOptions options, double minEdgeWeight) Constructs the algorithm's initial stateConstructs a new solution for the dual linear programKolmogorovWeightedMatching
(Graph<V, E> initialGraph) Constructs a new instance of the algorithm using the default options.KolmogorovWeightedMatching
(Graph<V, E> initialGraph, BlossomVOptions options) Constructs a new instance of the algorithm with the specifiedoptions
.KolmogorovWeightedMatching
(Graph<V, E> initialGraph, BlossomVOptions options, ObjectiveSense objectiveSense) Constructs a new instance of the algorithm with the specifiedoptions
.KolmogorovWeightedMatching
(Graph<V, E> initialGraph, ObjectiveSense objectiveSense) Constructs a new instance of the algorithm using the default options.KolmogorovWeightedPerfectMatching
(Graph<V, E> graph) Constructs a new instance of the algorithm using the default options.KolmogorovWeightedPerfectMatching
(Graph<V, E> graph, BlossomVOptions options) Constructs a new instance of the algorithm with the specifiedoptions
.KolmogorovWeightedPerfectMatching
(Graph<V, E> graph, BlossomVOptions options, ObjectiveSense objectiveSense) Constructs a new instance of the algorithm with the specifiedoptions
.KolmogorovWeightedPerfectMatching
(Graph<V, E> graph, ObjectiveSense objectiveSense) Constructs a new instance of the algorithm using the default options. -
Uses of Graph in org.jgrapht.alg.partition
Fields in org.jgrapht.alg.partition declared as GraphConstructors in org.jgrapht.alg.partition with parameters of type GraphModifierConstructorDescriptionBipartitePartitioning
(Graph<V, E> graph) Constructs a new bipartite partitioning. -
Uses of Graph in org.jgrapht.alg.planar
Fields in org.jgrapht.alg.planar declared as GraphModifier and TypeFieldDescriptionBoyerMyrvoldPlanarityInspector.graph
The graph we're testing planarity ofBoyerMyrvoldPlanarityInspector.kuratowskiSubdivision
The subgraph of thegraph
, which is a Kuratowski subdivision.Methods in org.jgrapht.alg.planar that return GraphModifier and TypeMethodDescriptionFinishes the Kuratowski subdivision extraction by constructing the desired subgraphBoyerMyrvoldPlanarityInspector.getKuratowskiSubdivision()
Extracts a Kuratowski subdivision from thegraph
.BoyerMyrvoldPlanarityInspector.lazyExtractKuratowskiSubdivision()
Lazily extracts a Kuratowski subdivision from thegraph
.Constructors in org.jgrapht.alg.planar with parameters of type GraphModifierConstructorDescriptionBoyerMyrvoldPlanarityInspector
(Graph<V, E> graph) Creates new instance of the planarity testing algorithm for thegraph
. -
Uses of Graph in org.jgrapht.alg.scoring
Fields in org.jgrapht.alg.scoring declared as GraphModifier and TypeFieldDescriptionCoreness.g
EigenvectorCentrality.g
KatzCentrality.g
ApBetweennessCentrality.graph
Underlying graphBetweennessCentrality.graph
Underlying graphClosenessCentrality.graph
Underlying graphClusteringCoefficient.graph
Underlying graphEdgeBetweennessCentrality.graph
PageRank.graph
The input graphConstructors in org.jgrapht.alg.scoring with parameters of type GraphModifierConstructorDescriptionApBetweennessCentrality
(Graph<V, E> graph) Construct a new instance.ApBetweennessCentrality
(Graph<V, E> graph, boolean normalize) Construct a new instance.ApBetweennessCentrality
(Graph<V, E> graph, boolean normalize, long precision) Construct a new instance.BetweennessCentrality
(Graph<V, E> graph) Construct a new instance.BetweennessCentrality
(Graph<V, E> graph, boolean normalize) Construct a new instance.BetweennessCentrality
(Graph<V, E> graph, boolean normalize, BetweennessCentrality.OverflowStrategy overflowStrategy) Construct a new instance.ClosenessCentrality
(Graph<V, E> graph) Construct a new instance.ClosenessCentrality
(Graph<V, E> graph, boolean incoming, boolean normalize) Construct a new instance.ClusteringCoefficient
(Graph<V, E> graph) Construct a new instanceConstructorEdgeBetweennessCentrality
(Graph<V, E> graph) Construct a new instance.EdgeBetweennessCentrality
(Graph<V, E> graph, EdgeBetweennessCentrality.OverflowStrategy overflowStrategy) Construct a new instance.EdgeBetweennessCentrality
(Graph<V, E> graph, EdgeBetweennessCentrality.OverflowStrategy overflowStrategy, Iterable<V> startVertices) Construct a new instance.EigenvectorCentrality
(Graph<V, E> g) Create and execute an instance of EigenvectorCentralityEigenvectorCentrality
(Graph<V, E> g, int maxIterations) Create and execute an instance of EigenvectorCentralityEigenvectorCentrality
(Graph<V, E> g, int maxIterations, double tolerance) Create and execute an instance of EigenvectorCentrality.HarmonicCentrality
(Graph<V, E> graph) Construct a new instance.HarmonicCentrality
(Graph<V, E> graph, boolean incoming, boolean normalize) Construct a new instance.KatzCentrality
(Graph<V, E> g) Create and execute an instance of KatzCentrality.KatzCentrality
(Graph<V, E> g, double dampingFactor) Create and execute an instance of KatzCentrality.KatzCentrality
(Graph<V, E> g, double dampingFactor, int maxIterations) Create and execute an instance of KatzCentrality.KatzCentrality
(Graph<V, E> g, double dampingFactor, int maxIterations, double tolerance) Create and execute an instance of KatzCentrality.KatzCentrality
(Graph<V, E> g, double dampingFactor, ToDoubleFunction<V> exogenousFactorFunction) Create and execute an instance of KatzCentrality.KatzCentrality
(Graph<V, E> g, double dampingFactor, ToDoubleFunction<V> exogenousFactorFunction, int maxIterations) Create and execute an instance of KatzCentrality.KatzCentrality
(Graph<V, E> g, double dampingFactor, ToDoubleFunction<V> exogenousFactorFunction, int maxIterations, double tolerance) Create and execute an instance of KatzCentrality.Create and execute an instance of PageRank.Create and execute an instance of PageRank.Create and execute an instance of PageRank.Create and execute an instance of PageRank. -
Uses of Graph in org.jgrapht.alg.shortestpath
Fields in org.jgrapht.alg.shortestpath declared as GraphModifier and TypeFieldDescriptionprivate final Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.contractionGraph
Contraction hierarchy forgraph
.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> CHManyToManyShortestPaths.contractionGraph
Contracted version ofgraph
.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> ContractionHierarchyBidirectionalDijkstra.contractionGraph
Contracted graph, which is used during the queries.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> ContractionHierarchyPrecomputation.contractionGraph
Graph that stores the computed contraction hierarchy.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> ContractionHierarchyPrecomputation.ContractionHierarchy.contractionGraph
Graph that stores the computed contraction hierarchy.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> TransitNodeRoutingPrecomputation.contractionGraph
Contracted graph.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> TransitNodeRoutingPrecomputation.ContractionHierarchyBFS.contractionGraph
Search graph.TreeSingleSourcePathsImpl.g
The graphAllDirectedPaths.graph
ALTAdmissibleHeuristic.graph
BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier.graph
Frontier`s graph.BaseManyToManyShortestPaths.graph
BaseMultiObjectiveShortestPathAlgorithm.graph
The underlying graph.BaseShortestPathAlgorithm.graph
The underlying graph.CHManyToManyShortestPaths.CHManyToManyShortestPathsImpl.graph
The underlying graph.ContractionHierarchyPrecomputation.ContractionHierarchy.graph
The underlying graph.ContractionHierarchyPrecomputation.graph
The underlying graph.DijkstraClosestFirstIterator.graph
EppsteinKShortestPath.graph
Underlying graph.EppsteinShortestPathIterator.EppsteinGraphPath.graph
The graph.EppsteinShortestPathIterator.graph
Underlying graph.GraphMeasurer.graph
ListMultiObjectiveSingleSourcePathsImpl.graph
The graphListSingleSourcePathsImpl.graph
The graphTreeMeasurer.graph
YenKShortestPath.graph
Underlying graph.YenShortestPathIterator.graph
Underlying graph.private Graph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> ContractionHierarchyPrecomputation.maskedContractionGraph
The immutable view of thecontractionGraph
which masks already contracted vertices.BaseKDisjointShortestPathsAlgorithm.originalGraph
BaseKDisjointShortestPathsAlgorithm.workingGraph
Graph on which shortest paths are searched.Fields in org.jgrapht.alg.shortestpath with type parameters of type GraphModifier and TypeFieldDescriptionDefaultManyToManyShortestPaths.function
Provides implementation ofShortestPathAlgorithm
for a given graph.Methods in org.jgrapht.alg.shortestpath that return GraphModifier and TypeMethodDescriptionGraph
<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> ContractionHierarchyPrecomputation.ContractionHierarchy.getContractionGraph()
Returns contracted graph.ContractionHierarchyPrecomputation.ContractionHierarchy.getGraph()
Returns the underlying graph of this contraction hierarchy.EppsteinShortestPathIterator.EppsteinGraphPath.getGraph()
FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths.getGraph()
IntVertexDijkstraShortestPath.ArrayBasedSingleSourcePathsImpl.getGraph()
JohnsonShortestPaths.JohnsonSingleSourcePaths.getGraph()
ListMultiObjectiveSingleSourcePathsImpl.getGraph()
ListSingleSourcePathsImpl.getGraph()
Returns the graph over which this set of paths is defined.TreeSingleSourcePathsImpl.getGraph()
Returns the graph over which this set of paths is defined.Methods in org.jgrapht.alg.shortestpath with parameters of type GraphModifier and TypeMethodDescriptionprivate void
CHManyToManyShortestPaths.backwardSearch
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> target, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedSources, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, List<CHManyToManyShortestPaths<V, E>.BucketEntry>> bucketsMap, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, boolean reversed) Performs backward single source shortest paths search incontractionGraph
starting fromtarget
tosources
.JohnsonShortestPaths.computeVertexIndices
(Graph<V, E> g) Compute a unique integer for each vertex of the graphJohnsonShortestPaths.computeVertexWeights
(Graph<V, E> g) Compute vertex weights for edge re-weighting using Bellman-Ford.static <V,
E> GraphPath <V, E> BellmanFordShortestPath.findPathBetween
(Graph<V, E> graph, V source, V sink) Find a path between two vertices.static <V,
E> GraphPath <V, E> BFSShortestPath.findPathBetween
(Graph<V, E> graph, V source, V sink) Find a path between two vertices.static <V,
E> GraphPath <V, E> BidirectionalDijkstraShortestPath.findPathBetween
(Graph<V, E> graph, V source, V sink) Find a path between two vertices.static <V,
E> GraphPath <V, E> DijkstraShortestPath.findPathBetween
(Graph<V, E> graph, V source, V sink) Find a path between two vertices.IntVertexDijkstraShortestPath.findPathBetween
(Graph<Integer, E> graph, Integer source, Integer sink) Find a path between two vertices.private void
CHManyToManyShortestPaths.forwardSearch
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> contractedTargets, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, List<CHManyToManyShortestPaths<V, E>.BucketEntry>> bucketsMap, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> middleVerticesMap, boolean reversed) Performs forward search from the givensource
totargets
.private Map
<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>> CHManyToManyShortestPaths.getDistanceAndPredecessorMap
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> targets) Computes distance and predecessor map for a single source shortest paths search starting at source and finishing the search as soon as alltargets
are reached.protected static <V,
E> ShortestPathAlgorithm.SingleSourcePaths <V, E> BaseManyToManyShortestPaths.getShortestPathsTree
(Graph<V, E> graph, V source, Set<V> targets) Computes shortest paths tree starting atsource
and stopping as soon as all of thetargets
are reached.private void
ContractionHierarchyPrecomputation.init
(Graph<V, E> graph, Supplier<Random> randomSupplier, Supplier<org.jheaps.AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> shortcutsSearchHeapSupplier, ThreadPoolExecutor executor) Initialized field of this algorithm.private void
DeltaSteppingShortestPath.init
(Graph<V, E> graph, double delta, ThreadPoolExecutor executor, Comparator<V> vertexComparator) Initializesdelta
,parallelism
,distanceAndPredecessorMap
,completionService
,verticesQueue
,lightRelaxTask
andheavyRelaxTask
fields.<ET> boolean
ALTAdmissibleHeuristic.isConsistent
(Graph<V, ET> graph) Returns true if the heuristic is a consistent or monotone heuristic wrt the providedgraph
.private Map
<ContractionHierarchyPrecomputation.ContractionVertex<V>, org.jheaps.AddressableHeap.Handle<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> ContractionHierarchyPrecomputation.iterateToSuccessors
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, ContractionHierarchyPrecomputation.ContractionVertex<V> source, Set<ContractionHierarchyPrecomputation.ContractionVertex<V>> successors, ContractionHierarchyPrecomputation.ContractionVertex<V> vertexToIgnore, double radius) Performs Dijkstra search in thegraph
starting at vertexsource
ignoring vertexvertexToIgnore
.private void
ContractionHierarchyPrecomputation.relaxNode
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> graph, org.jheaps.AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>> heap, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, org.jheaps.AddressableHeap.Handle<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceMap, ContractionHierarchyPrecomputation.ContractionVertex<V> vertex, double vertexDistance, ContractionHierarchyPrecomputation.ContractionVertex<V> vertexToIgnore) Relaxes outgoing edges ofvertex
ingraph
ignoring successors marked as independent andvertexToIgnore
.private void
JohnsonShortestPaths.runWithNegativeEdgeWeights
(Graph<V, E> g) Graph contains edges with negative weights.private void
JohnsonShortestPaths.runWithPositiveEdgeWeights
(Graph<V, E> g) Graph has no edges with negative weights.Constructors in org.jgrapht.alg.shortestpath with parameters of type GraphModifierConstructorDescriptionAllDirectedPaths
(Graph<V, E> graph) Create a new instance.AllDirectedPaths
(Graph<V, E> graph, PathValidator<V, E> pathValidator) Create a new instance with givenpathValidator
.Constructs a newAStarAdmissibleHeuristic
using a set of landmarks.(package private)
AStarSearchFrontier
(Graph<V, E> graph, V endVertex, AStarAdmissibleHeuristic<V> heuristic) AStarShortestPath
(Graph<V, E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic) Create a new instance of the A* shortest path algorithm.AStarShortestPath
(Graph<V, E> graph, AStarAdmissibleHeuristic<V> admissibleHeuristic, Supplier<org.jheaps.AddressableHeap<Double, V>> heapSupplier) Create a new instance of the A* shortest path algorithm.Constructs a new instance of the algorithm for a given graph.BaseKDisjointShortestPathsAlgorithm
(Graph<V, E> graph) Creates a new instance of the algorithmBaseManyToManyShortestPaths
(Graph<V, E> graph) Constructs a new instance of the algorithm for a given graph.Constructs a new instance of the algorithm for a given graph(package private)
BaseSearchFrontier
(Graph<V, E> graph) Constructs instance for a givengraph
.BaseShortestPathAlgorithm
(Graph<V, E> graph) Constructs a new instance of the algorithm for a given graph.BellmanFordShortestPath
(Graph<V, E> graph) Construct a new instance.BellmanFordShortestPath
(Graph<V, E> graph, double epsilon) Construct a new instance.BellmanFordShortestPath
(Graph<V, E> graph, double epsilon, int maxHops) Construct a new instance.BFSShortestPath
(Graph<V, E> graph) Construct a new instance.BhandariKDisjointShortestPaths
(Graph<V, E> graph) Creates a new instance of the algorithm.BidirectionalAStarShortestPath
(Graph<V, E> graph, AStarAdmissibleHeuristic<V> heuristic) Constructs a new instance of the algorithm for a given graph and heuristic.BidirectionalAStarShortestPath
(Graph<V, E> graph, AStarAdmissibleHeuristic<V> heuristic, Supplier<org.jheaps.AddressableHeap<Double, V>> heapSupplier) Constructs a new instance of the algorithm for a given graph, heuristic and heap supplier.BidirectionalDijkstraShortestPath
(Graph<V, E> graph) Constructs a new instance for a specified graph.BidirectionalDijkstraShortestPath
(Graph<V, E> graph, double radius) Constructs a new instance for a specified graph.BidirectionalDijkstraShortestPath
(Graph<V, E> graph, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance for a specified graph.BidirectionalDijkstraShortestPath
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance for a specified graph.CHManyToManyShortestPaths
(Graph<V, E> graph, ThreadPoolExecutor executor) Constructs an instance of the algorithm for a givengraph
andexecutor
.CHManyToManyShortestPathsImpl
(Graph<V, E> graph, ContractionHierarchyPrecomputation.ContractionHierarchy<V, E> hierarchy, Set<V> sources, Set<V> targets, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> forwardSearchSpaces, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Map<ContractionHierarchyPrecomputation.ContractionVertex<V>, Pair<Double, ContractionHierarchyPrecomputation.ContractionEdge<E>>>> backwardSearchSpaces, Map<Pair<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionVertex<V>>, Pair<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> distanceAndMiddleVertexMap) Constructs a new instance for the givengraph
,contractionGraph
,contractionMapping
,forwardSearchSpaces
,backwardSearchSpaces
anddistanceAndMiddleVertexMap
.(package private)
ContractionHierarchy
(Graph<V, E> graph, Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph, Map<V, ContractionHierarchyPrecomputation.ContractionVertex<V>> contractionMapping) Constructs a new instance for the givengraph
,contractionGraph
andcontractionMapping
.ContractionHierarchyBFS
(Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>, ContractionHierarchyPrecomputation.ContractionEdge<E>> contractionGraph) Constructs a new instance of the algorithm for the givengraph
.ContractionHierarchyBidirectionalDijkstra
(Graph<V, E> graph, ThreadPoolExecutor executor) Constructs a new instance of the algorithm for a givengraph
andexecutor
.ContractionHierarchyPrecomputation
(Graph<V, E> graph, ThreadPoolExecutor executor) Constructs a new instance of the algorithm for a givengraph
andexecutor
.ContractionHierarchyPrecomputation
(Graph<V, E> graph, Supplier<Random> randomSupplier, ThreadPoolExecutor executor) Constructs a new instance of the algorithm for a givengraph
,randomSupplier
andexecutor
.ContractionHierarchyPrecomputation
(Graph<V, E> graph, Supplier<Random> randomSupplier, Supplier<org.jheaps.AddressableHeap<Double, ContractionHierarchyPrecomputation.ContractionVertex<V>>> shortcutsSearchHeapSupplier, ThreadPoolExecutor executor) Constructs a new instance of the algorithm for a givengraph
,parallelism
,randomSupplier
,shortcutsSearchHeapSupplier
andexecutor
.(package private)
ContractionSearchFrontier
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs an instance of a search frontier for the given graph, heap supplier andisDownwardEdge
function.DefaultManyToManyShortestPaths
(Graph<V, E> graph) Constructs a new instance of the algorithm for a givengraph
.DefaultManyToManyShortestPaths
(Graph<V, E> graph, Function<Graph<V, E>, ShortestPathAlgorithm<V, E>> function) Constructs a new instance of the algorithm for a givengraph
andfunction
.DeltaSteppingShortestPath
(Graph<V, E> graph, double delta) Deprecated.DeltaSteppingShortestPath
(Graph<V, E> graph, double delta, int parallelism) Deprecated.DeltaSteppingShortestPath
(Graph<V, E> graph, double delta, ThreadPoolExecutor executor) Constructs a new instance of the algorithm for a given graph, delta andexecutor
.DeltaSteppingShortestPath
(Graph<V, E> graph, double delta, ThreadPoolExecutor executor, Comparator<V> vertexComparator) Constructs a new instance of the algorithm for a given graph, delta,executor
andvertexComparator
.DeltaSteppingShortestPath
(Graph<V, E> graph, int parallelism) Deprecated.replaced withDeltaSteppingShortestPath(Graph, ThreadPoolExecutor)
DeltaSteppingShortestPath
(Graph<V, E> graph, ThreadPoolExecutor executor) Constructs a new instance of the algorithm for a given graph andexecutor
.DeltaSteppingShortestPath
(Graph<V, E> graph, ThreadPoolExecutor executor, Comparator<V> vertexComparator) Constructs a new instance of the algorithm for a givengraph
,executor
andvertexComparator
.DijkstraClosestFirstIterator
(Graph<V, E> graph, V source) Creates a new iterator for the specified graph.DijkstraClosestFirstIterator
(Graph<V, E> graph, V source, double radius) Creates a new radius-bounded iterator for the specified graph.DijkstraClosestFirstIterator
(Graph<V, E> graph, V source, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Creates a new radius-bounded iterator for the specified graph.DijkstraClosestFirstIterator
(Graph<V, E> graph, V source, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Creates a new iterator for the specified graph.DijkstraManyToManyShortestPaths
(Graph<V, E> graph) Constructs an instance of the algorithm for a givengraph
.(package private)
DijkstraSearchFrontier
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) DijkstraShortestPath
(Graph<V, E> graph) Constructs a new instance of the algorithm for a given graph.DijkstraShortestPath
(Graph<V, E> graph, double radius) Constructs a new instance of the algorithm for a given graph.DijkstraShortestPath
(Graph<V, E> graph, double radius, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance of the algorithm for a given graph.DijkstraShortestPath
(Graph<V, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Pair<V, E>>> heapSupplier) Constructs a new instance of the algorithm for a given graph.(package private)
EppsteinGraphPath
(Graph<V, E> graph, List<EppsteinShortestPathIterator<V, E>.PathsGraphVertex> pathsGraphVertices, Map<V, Pair<Double, E>> distanceAndPredecessorMap, double weight) EppsteinKShortestPath
(Graph<V, E> graph) Constructs the algorithm instance for the givengraph
.Constructs an instance of the algorithm for the givengraph
,source
andsink
.FloydWarshallShortestPaths
(Graph<V, E> graph) Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.GraphMeasurer
(Graph<V, E> graph) Constructs a new instance of GraphMeasurer.GraphMeasurer
(Graph<V, E> graph, ShortestPathAlgorithm<V, E> shortestPathAlgorithm) Constructs a new instance of GraphMeasurer.IntVertexDijkstraShortestPath
(Graph<Integer, E> graph) Constructs a new instance of the algorithm for a given graph.IntVertexDijkstraShortestPath
(Graph<Integer, E> graph, Supplier<org.jheaps.AddressableHeap<Double, Integer>> heapSupplier) Constructs a new instance of the algorithm for a given graph.JohnsonShortestPaths
(Graph<V, E> graph) Construct a new instance.JohnsonShortestPaths
(Graph<V, E> graph, double epsilon) Construct a new instance.ListMultiObjectiveSingleSourcePathsImpl
(Graph<V, E> graph, V source, Map<V, List<GraphPath<V, E>>> paths) Construct a new instance.Construct a new instance.Create a new shortest path algorithmSuurballeKDisjointShortestPaths
(Graph<V, E> graph) Creates a new instance of the algorithm.TransitNodeRoutingPrecomputation
(Graph<V, E> graph, ThreadPoolExecutor executor) Constructs an instance of the algorithm for a givengraph
andexecutor
.TransitNodeRoutingShortestPath
(Graph<V, E> graph, ThreadPoolExecutor executor) Constructs a new instance for the givengraph
andexecutor
.TreeMeasurer
(Graph<V, E> graph) Constructs a new instance of TreeMeasurer.Construct a new instance.YenKShortestPath
(Graph<V, E> graph) Constructs an instance of the algorithm for the givengraph
.YenKShortestPath
(Graph<V, E> graph, PathValidator<V, E> pathValidator) Constructs an instance of the algorithm for the givengraph
andpathValidator
.Constructs an instance of the algorithm for givengraph
,source
andsink
.YenShortestPathIterator
(Graph<V, E> graph, V source, V sink, Supplier<org.jheaps.AddressableHeap<Double, Pair<GraphPath<V, E>, Boolean>>> heapSupplier) Constructs an instance of the algorithm for givengraph
,source
,sink
andheapSupplier
.YenShortestPathIterator
(Graph<V, E> graph, V source, V sink, Supplier<org.jheaps.AddressableHeap<Double, Pair<GraphPath<V, E>, Boolean>>> heapSupplier, PathValidator<V, E> pathValidator) Constructs an instance of the algorithm for givengraph
,source
,sink
,heapSupplier
andpathValidator
.YenShortestPathIterator
(Graph<V, E> graph, V source, V sink, PathValidator<V, E> pathValidator) Constructs an instance of the algorithm for givengraph
,source
,sink
andpathValidator
.(package private)
YenShortestPathsTree
(Graph<V, E> maskSubgraph, Set<V> maskedVertices, Set<E> maskedEdges, Map<V, Pair<Double, E>> reversedTree, V treeSource) Constructs an instance of the shortest paths tree for the givenmaskSubgraph
,maskedVertices
,maskedEdges
,reversedTree
,treeSource
.Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type Graph -
Uses of Graph in org.jgrapht.alg.similarity
Fields in org.jgrapht.alg.similarity declared as GraphModifier and TypeFieldDescriptionZhangShashaTreeEditDistance.TreeOrdering.tree
Underlying tree of this ordering.ZhangShashaTreeEditDistance.tree1
First tree for which the distance is computed by this algorithm.ZhangShashaTreeEditDistance.tree2
Second tree for which the distance is computed by this algorithm.Constructors in org.jgrapht.alg.similarity with parameters of type GraphModifierConstructorDescriptionTreeOrdering
(Graph<V, E> tree, V treeRoot) Constructs an instance of the tree ordering for the givengraph
andtreeRoot
.Constructs an instance of the algorithm for the giventree1
,root1
,tree2
androot2
.ZhangShashaTreeEditDistance
(Graph<V, E> tree1, V root1, Graph<V, E> tree2, V root2, ToDoubleFunction<V> insertCost, ToDoubleFunction<V> removeCost, ToDoubleBiFunction<V, V> changeCost) Constructs an instance of the algorithm for the giventree1
,root1
,tree2
,root2
,insertCost
,removeCost
andchangeCost
. -
Uses of Graph in org.jgrapht.alg.spanning
Fields in org.jgrapht.alg.spanning declared as GraphModifier and TypeFieldDescriptionPrimMinimumSpanningTree.g
AbstractCapacitatedMinimumSpanningTree.graph
the input graph.BoruvkaMinimumSpanningTree.graph
GreedyMultiplicativeSpanner.graph
KruskalMinimumSpanningTree.graph
(package private) Graph
<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, DefaultWeightedEdge> AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.improvementGraph
the improvement graph itselfGreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm.spanner
protected Graph
<V, DefaultWeightedEdge> GreedyMultiplicativeSpanner.WeightedSpannerAlgorithm.spanner
Methods in org.jgrapht.alg.spanning that return GraphModifier and TypeMethodDescriptionGraph
<Pair<Integer, AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraphVertexType>, DefaultWeightedEdge> AhujaOrlinSharmaCapacitatedMinimumSpanningTree.ImprovementGraph.createImprovementGraph()
Initializes the improvement graph, i.e.Constructors in org.jgrapht.alg.spanning with parameters of type GraphModifierConstructorDescriptionprotected
AbstractCapacitatedMinimumSpanningTree
(Graph<V, E> graph, V root, double capacity, Map<V, Double> demands) Construct a new abstract capacitated minimum spanning tree algorithm.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
(CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V, E> initialSolution, Graph<V, E> graph, V root, double capacity, Map<V, Double> demands, int lengthBound) Constructs a new instance of this algorithm with the proposed initial solution.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
(CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree<V, E> initialSolution, Graph<V, E> graph, V root, double capacity, Map<V, Double> demands, int lengthBound, boolean bestImprovement, boolean useVertexOperation, boolean useSubtreeOperation, boolean useTabuSearch, int tabuTime, int upperLimitTabuExchanges) Constructs a new instance of this algorithm with the proposed initial solution.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
(Graph<V, E> graph, V root, double capacity, Map<V, Double> demands, int lengthBound, boolean bestImprovement, int numberOfOperationsParameter, boolean useVertexOperation, boolean useSubtreeOperation, boolean useTabuSearch, int tabuTime, int upperLimitTabuExchanges) Constructs a new instance of this algorithm.AhujaOrlinSharmaCapacitatedMinimumSpanningTree
(Graph<V, E> graph, V root, double capacity, Map<V, Double> demands, int lengthBound, int numberOfOperationsParameter) Constructs a new instance of this algorithm.BoruvkaMinimumSpanningTree
(Graph<V, E> graph) Construct a new instance of the algorithm.EsauWilliamsCapacitatedMinimumSpanningTree
(Graph<V, E> graph, V root, double capacity, Map<V, Double> weights, int numberOfOperationsParameter) Constructs an Esau-Williams GRASP algorithm instance.GreedyMultiplicativeSpanner
(Graph<V, E> graph, int k) Constructs instance to compute a $(2k-1)$-spanner of an undirected graph.KruskalMinimumSpanningTree
(Graph<V, E> graph) Construct a new instance of the algorithm.PrimMinimumSpanningTree
(Graph<V, E> graph) Construct a new instance of the algorithm. -
Uses of Graph in org.jgrapht.alg.tour
Fields in org.jgrapht.alg.tour declared as GraphMethods in org.jgrapht.alg.tour with parameters of type GraphModifier and TypeMethodDescriptionNearestInsertionHeuristicTSP.augment
(List<V> subtour, Map<V, NearestInsertionHeuristicTSP.Closest<V>> closestVertices, Set<V> unvisited, Graph<V, E> graph) Augment an existing tour to give a complete tourAugment an existing tour to give a complete tourprotected void
HamiltonianCycleAlgorithmBase.checkGraph
(Graph<V, E> graph) Checks that graph is undirected, complete, and non-emptyTransform from a closed List representation (first and last vertex element are the same) to a graph path.private double[][]
Transform from a Set representation to a graph path.private Map
<V, NearestInsertionHeuristicTSP.Closest<V>> Initialise the Map storing closest unvisited vertex for each tour vertexprivate NearestInsertionHeuristicTSP.Closest
<V> Determines closest unvisited vertex to a vertex in the current tourprivate static <V,
E> int NearestNeighborHeuristicTSP.getNearestNeighbor
(V current, V[] vertices, int start, Graph<V, E> g) Find the vertex in the range staring atfrom
that is closest to the element at index from-1.HamiltonianCycleAlgorithmBase.getSingletonTour
(Graph<V, E> graph) Creates a tour for a graph with 1 vertexComputes a $3/2$-approximate tour.Computes a tour using the greedy heuristic.Computes a minimum-cost Hamiltonian tour.Computes a tour using the nearest insertion heuristic.Computes a tour using the nearest neighbour heuristic.Computes a Hamiltonian tour.Computes a tour using the greedy heuristic.Computes a 2-approximate tour.Computes a 2-approximate tour.private void
Initialize graph and mapping to integer vertices.protected void
HamiltonianCycleAlgorithmBase.requireNotEmpty
(Graph<V, E> graph) Checks that graph is not emptyprivate static <V,
E> boolean PalmerHamiltonianCycle.searchAndCloseGap
(V[] tour, int n, Graph<V, E> graph) Get or create a sub-tour to start augmentingprivate void
NearestInsertionHeuristicTSP.updateClosest
(Map<V, NearestInsertionHeuristicTSP.Closest<V>> currentClosest, NearestInsertionHeuristicTSP.Closest<V> chosen, Set<V> unvisited, Graph<V, E> graph) Update the Map storing closest unvisited vertex for each tour vertexTransform from a List representation to a graph path. -
Uses of Graph in org.jgrapht.alg.transform
Fields in org.jgrapht.alg.transform declared as GraphMethods in org.jgrapht.alg.transform with parameters of type GraphModifier and TypeMethodDescriptionvoid
LineGraphConverter.convertToLineGraph
(Graph<E, EE> target) Constructs a line graph $L(G)$ of the input graph $G(V,E)$.void
LineGraphConverter.convertToLineGraph
(Graph<E, EE> target, BiFunction<E, E, Double> weightFunction) Constructs a line graph of the input graph.Constructors in org.jgrapht.alg.transform with parameters of type Graph -
Uses of Graph in org.jgrapht.alg.util
Fields in org.jgrapht.alg.util declared as GraphModifier and TypeFieldDescriptionNeighborCache.graph
VertexDegreeComparator.graph
The graph that contains the vertices to be compared.Methods in org.jgrapht.alg.util with parameters of type GraphModifier and TypeMethodDescriptionstatic <V> Comparator
<V> Returns aComparator
that compares vertices by their degrees in the specified graph.Constructors in org.jgrapht.alg.util with parameters of type GraphModifierConstructorDescriptionNeighborCache
(Graph<V, E> graph) ConstructorDeprecated, for removal: This API element is subject to removal in a future version.VertexDegreeComparator
(Graph<V, E> g, VertexDegreeComparator.Order order) Deprecated, for removal: This API element is subject to removal in a future version.useVertexDegreeComparator.of(Graph)
for ascending order orreverse the comparator
for descending order. -
Uses of Graph in org.jgrapht.alg.vertexcover
Fields in org.jgrapht.alg.vertexcover declared as GraphModifier and TypeFieldDescriptionBarYehudaEvenTwoApproxVCImpl.graph
ClarksonTwoApproxVCImpl.graph
EdgeBasedTwoApproxVCImpl.graph
GreedyVCImpl.graph
RecursiveExactVCImpl.graph
Input graphConstructors in org.jgrapht.alg.vertexcover with parameters of type GraphModifierConstructorDescriptionBarYehudaEvenTwoApproxVCImpl
(Graph<V, E> graph) Constructs a new BarYehudaEvenTwoApproxVCImpl instance where all vertices have uniform weights.Constructs a new BarYehudaEvenTwoApproxVCImpl instanceClarksonTwoApproxVCImpl
(Graph<V, E> graph) Constructs a new ClarksonTwoApproxVCImpl instance where all vertices have uniform weights.Constructs a new ClarksonTwoApproxVCImpl instanceEdgeBasedTwoApproxVCImpl
(Graph<V, E> graph) Constructs a new EdgeBasedTwoApproxVCImpl instanceGreedyVCImpl
(Graph<V, E> graph) Constructs a new GreedyVCImpl instance where all vertices have uniform weights.Constructs a new GreedyVCImpl instanceRecursiveExactVCImpl
(Graph<V, E> graph) Constructs a new GreedyVCImpl instanceConstructs a new GreedyVCImpl instance -
Uses of Graph in org.jgrapht.generate
Fields in org.jgrapht.generate declared as GraphMethods in org.jgrapht.generate that return GraphModifier and TypeMethodDescriptionstatic Graph
<Integer, DefaultEdge> NamedGraphGenerator.bidiakisCubeGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.blanusaFirstSnarkGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.blanusaSecondSnarkGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.brinkmannGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.buckyBallGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.bullGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.butterflyGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.chvatalGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.clawGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.clebschGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.coxeterGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.desarguesGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.diamondGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.dodecahedronGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.doubleStarSnarkGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.doyleGraph()
Generate the Doyle Graphstatic Graph
<Integer, DefaultEdge> NamedGraphGenerator.dürerGraph()
Generates a Dürer Graph.static Graph
<Integer, DefaultEdge> NamedGraphGenerator.ellinghamHorton54Graph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.ellinghamHorton78Graph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.erreraGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.folkmanGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.franklinGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.fruchtGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.generalizedPetersenGraph
(int n, int k) static Graph
<Integer, DefaultEdge> NamedGraphGenerator.goldnerHararyGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.gossetGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.grötzschGraph()
Generates a Grötzsch Graph.static Graph
<Integer, DefaultEdge> NamedGraphGenerator.heawoodGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.herschelGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.hoffmanGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.kittellGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.klein3RegularGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.klein7RegularGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.krackhardtKiteGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.möbiusKantorGraph()
Generates a Möbius-Kantor Graph.static Graph
<Integer, DefaultEdge> NamedGraphGenerator.moserSpindleGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.nauruGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.pappusGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.petersenGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.poussinGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.schläfliGraph()
Generates the Schläfli Graph.static Graph
<Integer, DefaultEdge> NamedGraphGenerator.thomsenGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.tietzeGraph()
static Graph
<Integer, DefaultEdge> NamedGraphGenerator.tutteGraph()
Methods in org.jgrapht.generate with parameters of type GraphModifier and TypeMethodDescriptionprivate void
private void
private V
void
NamedGraphGenerator.generateBidiakisCubeGraph
(Graph<V, E> targetGraph) Generates a Bidiakis cube Graph.void
NamedGraphGenerator.generateBlanusaFirstSnarkGraph
(Graph<V, E> targetGraph) Generates the First Blanusa Snark Graph.void
NamedGraphGenerator.generateBlanusaSecondSnarkGraph
(Graph<V, E> targetGraph) Generates the Second Blanusa Snark Graph.void
NamedGraphGenerator.generateBrinkmannGraph
(Graph<V, E> targetGraph) Generates the Brinkmann Graph.void
NamedGraphGenerator.generateBuckyBallGraph
(Graph<V, E> targetGraph) Generates a Bucky ball Graph.void
NamedGraphGenerator.generateBullGraph
(Graph<V, E> targetGraph) Generates a Bull Graph.void
NamedGraphGenerator.generateButterflyGraph
(Graph<V, E> targetGraph) Generates a Butterfly Graph.void
NamedGraphGenerator.generateChvatalGraph
(Graph<V, E> targetGraph) Generates the Chvatal Graph.void
NamedGraphGenerator.generateClawGraph
(Graph<V, E> targetGraph) Generates a Claw Graph.void
NamedGraphGenerator.generateClebschGraph
(Graph<V, E> targetGraph) Generates a Clebsch Graph.void
NamedGraphGenerator.generateCoxeterGraph
(Graph<V, E> targetGraph) Generates the Coxeter Graph.void
NamedGraphGenerator.generateDesarguesGraph
(Graph<V, E> targetGraph) Generates a Desargues Graph.void
NamedGraphGenerator.generateDiamondGraph
(Graph<V, E> targetGraph) Generates the Diamond Graph.void
NamedGraphGenerator.generateDodecahedronGraph
(Graph<V, E> targetGraph) Generates a Dodecahedron Graph.void
NamedGraphGenerator.generateDoubleStarSnarkGraph
(Graph<V, E> targetGraph) Generates the Double Star Snark Graph.void
NamedGraphGenerator.generateDoyleGraph
(Graph<V, E> targetGraph) Generates a Doyle Graph.void
NamedGraphGenerator.generateDürerGraph
(Graph<V, E> targetGraph) Generates a Dürer Graph.void
NamedGraphGenerator.generateEllinghamHorton54Graph
(Graph<V, E> targetGraph) Generates the Ellingham-Horton 54 Graph.void
NamedGraphGenerator.generateEllinghamHorton78Graph
(Graph<V, E> targetGraph) Generates the Ellingham-Horton 78 Graph.void
NamedGraphGenerator.generateErreraGraph
(Graph<V, E> targetGraph) Generates the Errera Graph.void
NamedGraphGenerator.generateFolkmanGraph
(Graph<V, E> targetGraph) Generates the Folkman Graph.void
NamedGraphGenerator.generateFranklinGraph
(Graph<V, E> targetGraph) Generates the Franklin Graph.void
NamedGraphGenerator.generateFruchtGraph
(Graph<V, E> targetGraph) Generates the Frucht Graph.private void
NamedGraphGenerator.generateGeneralizedPetersenGraph
(Graph<V, E> targetGraph, int n, int k) void
NamedGraphGenerator.generateGoldnerHararyGraph
(Graph<V, E> targetGraph) Generates the Goldner-Harary Graph.void
NamedGraphGenerator.generateGossetGraph
(Graph<V, E> targetGraph) Generates the Gosset Graph.void
Generates an instance.void
Generates an instance.void
void
Construct a complete bipartite graphvoid
Generate a graph structure.void
Generates an instance of theGraph
.void
Generate a graph structure.void
Generates the Generalized Petersen Graphvoid
Generates a random bipartite graph.void
Generates a random graph based on the $G(n, M)$ modelvoid
Generates a random bipartite graph.void
Generates a random graph based on the $G(n, p)$ model.default void
GraphGenerator.generateGraph
(Graph<V, E> target) Generate a graph structure.void
Generate a graph structure.void
Generate a graph structure.void
void
Generates a small-world graph.void
Generate a graph structure.void
Generates an instance.void
Generate an $l$-planted partition graph.void
Generates a tree.void
Generate a random regular graph.void
Generate a graph structure.void
Generates scale-free network withsize
passed to the constructor.void
SimpleWeightedBipartiteGraphMatrixGenerator.generateGraph
(Graph<V, E> target, Map<String, V> resultMap) Generate a graph structure.void
void
Generates a star graph with the designated order from the constructorvoid
Generates a small-world graph based on the Watts-Strogatz model.void
Generate a graph structure.void
void
NamedGraphGenerator.generateGrötzschGraph
(Graph<V, E> targetGraph) Generates a Grötzsch Graph.void
NamedGraphGenerator.generateHeawoodGraph
(Graph<V, E> targetGraph) Generates the Heawood Graph.void
NamedGraphGenerator.generateHerschelGraph
(Graph<V, E> targetGraph) Generates the Herschel Graph.void
NamedGraphGenerator.generateHoffmanGraph
(Graph<V, E> targetGraph) Generates the Hoffman Graph.void
NamedGraphGenerator.generateKittellGraph
(Graph<V, E> targetGraph) Generates the Kittell Graph.void
NamedGraphGenerator.generateKlein3RegularGraph
(Graph<V, E> targetGraph) Generates the Klein 3-regular Graph.void
NamedGraphGenerator.generateKlein7RegularGraph
(Graph<V, E> targetGraph) Generates the Klein 7-regular Graph.void
NamedGraphGenerator.generateKrackhardtKiteGraph
(Graph<V, E> targetGraph) Generates the Krackhardt kite Graph.void
NamedGraphGenerator.generateMöbiusKantorGraph
(Graph<V, E> targetGraph) Generates a Möbius-Kantor Graph.void
NamedGraphGenerator.generateMoserSpindleGraph
(Graph<V, E> targetGraph) Generates the Moser spindle Graph.void
NamedGraphGenerator.generateNauruGraph
(Graph<V, E> targetGraph) Generates a Nauru Graph.private void
RandomRegularGraphGenerator.generateNonSimpleRegularGraph
(Graph<V, E> target) void
NamedGraphGenerator.generatePappusGraph
(Graph<V, E> targetGraph) Generates the Pappus Graph.void
NamedGraphGenerator.generatePetersenGraph
(Graph<V, E> targetGraph) Generates a Petersen Graph.void
NamedGraphGenerator.generatePoussinGraph
(Graph<V, E> targetGraph) Generates the Poussin Graph.void
NamedGraphGenerator.generateSchläfliGraph
(Graph<V, E> targetGraph) Generates the Schläfli Graph.private void
RandomRegularGraphGenerator.generateSimpleRegularGraph
(Graph<V, E> target) void
NamedGraphGenerator.generateThomsenGraph
(Graph<V, E> targetGraph) Generates the Thomsen Graph.void
NamedGraphGenerator.generateTietzeGraph
(Graph<V, E> targetGraph) Generates the Tietze Graph.void
NamedGraphGenerator.generateTutteGraph
(Graph<V, E> targetGraph) Generates the Tutte Graph.void
NamedGraphGenerator.generateZacharyKarateClubGraph
(Graph<V, E> targetGraph) Generates the Zachary's karate club Graph.private V
DirectedScaleFreeGraphGenerator.pickAVertex
(Graph<V, E> target, Set<V> allNewNodes, Set<E> allNewEdgesSet, DirectedScaleFreeGraphGenerator.Direction direction, float bias) Select a vertex from the currently available vertices, using the passed bias.Constructors in org.jgrapht.generate with parameters of type GraphModifierConstructorDescriptionComplementGraphGenerator
(Graph<V, E> graph) Complement Graph GeneratorComplementGraphGenerator
(Graph<V, E> graph, boolean generateSelfLoops) Complement Graph Generator. -
Uses of Graph in org.jgrapht.generate.netgen
Fields in org.jgrapht.generate.netgen declared as GraphModifier and TypeFieldDescriptionBipartiteMatchingProblem.BipartiteMatchingProblemImpl.graph
MaximumFlowProblem.MaximumFlowProblemImpl.graph
NetworkGenerator.graph
A network that is being generated.Methods in org.jgrapht.generate.netgen that return GraphModifier and TypeMethodDescriptionBipartiteMatchingProblem.BipartiteMatchingProblemImpl.getGraph()
Returns the graph, which defines the problemBipartiteMatchingProblem.getGraph()
Returns the graph, which defines the problemMaximumFlowProblem.getGraph()
Returns the network the problem is defined on.MaximumFlowProblem.MaximumFlowProblemImpl.getGraph()
Returns the network the problem is defined on.Methods in org.jgrapht.generate.netgen with parameters of type GraphModifier and TypeMethodDescriptionprivate void
Runs all the steps of the generator algorithm.NetworkGenerator.generateBipartiteMatchingProblem
(Graph<V, E> graph) Generates a bipartite matching problem satisfying the parameters specified in the config provided to this generator.NetworkGenerator.generateMaxFlowProblem
(Graph<V, E> graph) Generates a maximum flow problem satisfying the parameters specified in the config provided to this generator.NetworkGenerator.generateMinimumCostFlowProblem
(Graph<V, E> graph) Generates a minimum cost flow problem satisfying the parameters specified in the config provided to this generator.private void
Initializes internal datastructures.Constructors in org.jgrapht.generate.netgen with parameters of type GraphModifierConstructorDescriptionBipartiteMatchingProblemImpl
(Graph<V, E> graph, Set<V> partition1, Set<V> partition2, Function<E, Double> costs, boolean weighted) Constructs a new bipartite matching problemMaximumFlowProblemImpl
(Graph<V, E> graph, Set<V> sources, Set<V> sinks, Function<E, Double> capacities) Constructs a new maximum flow problem. -
Uses of Graph in org.jgrapht.graph
Classes in org.jgrapht.graph that implement GraphModifier and TypeClassDescriptionclass
AbstractBaseGraph<V,
E> The most general implementation of theGraph
interface.class
AbstractGraph<V,
E> A skeletal implementation of theGraph
interface, to minimize the effort required to implement graph interfaces.class
AsGraphUnion<V,
E> Read-only union of two graphs.class
AsSubgraph<V,
E> A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph.class
AsUndirectedGraph<V,
E> An undirected view of the backing directed graph specified in the constructor.class
AsUnmodifiableGraph<V,
E> An unmodifiable view of the backing graph specified in the constructor.class
AsUnweightedGraph<V,
E> Provides an unweighted view on a graph.class
AsWeightedGraph<V,
E> Provides a weighted view of a graph.class
DefaultDirectedGraph<V,
E> The default implementation of a directed graph.class
The default implementation of a directed weighted graph.class
A graph backed by the the graph specified at the constructor, which can be listened byGraphListener
s and byVertexSetListener
s.class
The default implementation of an undirected graph.class
The default implementation of an undirected weighted graph.class
DirectedAcyclicGraph<V,
E> A directed acyclic graph (DAG).class
DirectedMultigraph<V,
E> A directed multigraph.class
DirectedPseudograph<V,
E> A directed pseudograph.class
A directed weighted multigraph.class
A directed weighted pseudograph.class
EdgeReversedGraph<V,
E> Provides an edge-reversed view $g'$ of a directed graph $g$.class
GraphDelegator<V,
E> A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph.class
MaskSubgraph<V,
E> An unmodifiable subgraph induced by a vertex/edge masking function.class
Multigraph<V,
E> A multigraph.class
ParanoidGraph<V,
E> ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract.class
Pseudograph<V,
E> A pseudograph.class
SimpleDirectedGraph<V,
E> A simple directed graph.class
A simple directed weighted graph.class
SimpleGraph<V,
E> Implementation of a Simple Graph.class
SimpleWeightedGraph<V,
E> A simple weighted graph.class
WeightedMultigraph<V,
E> A weighted multigraph.class
WeightedPseudograph<V,
E> A weighted pseudograph.Fields in org.jgrapht.graph declared as GraphModifier and TypeFieldDescriptionAsSubgraph.base
MaskSubgraph.base
GraphDelegator.delegate
AsGraphUnion.g1
AsGraphUnion.g2
DefaultGraphIterables.graph
The underlying graphGraphWalk.graph
MaskEdgeSet.graph
DefaultGraphMapping.graph1
DefaultGraphMapping.graph2
Methods in org.jgrapht.graph that return GraphModifier and TypeMethodDescriptionGraphDelegator.getDelegate()
Return the backing graph (the delegate).DefaultGraphIterables.getGraph()
GraphWalk.getGraph()
Methods in org.jgrapht.graph that return types with arguments of type GraphModifier and TypeMethodDescriptionDefaultGraphSpecificsStrategy.getSpecificsFactory()
FastLookupGraphSpecificsStrategy.getSpecificsFactory()
GraphSpecificsStrategy.getSpecificsFactory()
Get a function which creates the specifics.Methods in org.jgrapht.graph with parameters of type GraphModifier and TypeMethodDescriptionstatic <V,
E> GraphWalk <V, E> Convenience method which creates an empty walk.static <V,
E> GraphWalk <V, E> GraphWalk.singletonWalk
(Graph<V, E> graph, V v) Convenience method which creates a walk consisting of a single vertex with weight 0.0.static <V,
E> GraphWalk <V, E> GraphWalk.singletonWalk
(Graph<V, E> graph, V v, double weight) Convenience method which creates a walk consisting of a single vertex.Constructors in org.jgrapht.graph with parameters of type GraphModifierConstructorDescriptionConstruct a new graph union.AsGraphUnion
(Graph<V, E> g1, Graph<V, E> g2, WeightCombiner operator) Construct a new graph union.AsSubgraph
(Graph<V, E> base) Creates a new induced Subgraph with all vertices included.Creates a new induced subgraph.Creates a new subgraph.AsUndirectedGraph
(Graph<V, E> g) Constructor for AsUndirectedGraph.AsUnmodifiableGraph
(Graph<V, E> g) Creates a new unmodifiable graph based on the specified backing graph.AsUnweightedGraph
(Graph<V, E> g) Constructor for AsUnweightedGraph.AsWeightedGraph
(Graph<V, E> graph, Function<E, Double> weightFunction, boolean cacheWeights, boolean writeWeightsThrough) Constructor for AsWeightedGraph which uses a weight function to compute edge weights.Constructor for AsWeightedGraph where the weights are provided through a map.Constructor for AsWeightedGraph which allows weight write propagation to be requested explicitly.DefaultGraphIterables
(Graph<V, E> graph) Create new graph iterablesThe maps themselves are used.Creates a new listenable graph.DefaultListenableGraph
(Graph<V, E> g, boolean reuseEvents) Creates a new listenable graph.EdgeReversedGraph
(Graph<V, E> g) Creates a new EdgeReversedGraph.GraphDelegator
(Graph<V, E> graph) ConstructorCreates a walk defined by a sequence of vertices.Creates a walk defined by a sequence of edges.GraphWalk
(Graph<V, E> graph, V startVertex, V endVertex, List<V> vertexList, List<E> edgeList, double weight) Creates a walk defined by both a sequence of edges and a sequence of vertices.Creates a new induced subgraph.ParanoidGraph
(Graph<V, E> g) Create a new paranoid graph. -
Uses of Graph in org.jgrapht.graph.builder
Classes in org.jgrapht.graph.builder with type parameters of type GraphModifier and TypeClassDescriptionclass
AbstractGraphBuilder<V,
E, G extends Graph<V, E>, B extends AbstractGraphBuilder<V, E, G, B>> Base class for builders ofGraph
class
GraphBuilder<V,
E, G extends Graph<V, E>> A builder class forGraph
.Fields in org.jgrapht.graph.builder declared as GraphMethods in org.jgrapht.graph.builder that return GraphModifier and TypeMethodDescriptionAbstractGraphBuilder.buildAsUnmodifiable()
Build an unmodifiable version graph.GraphTypeBuilder.buildGraph()
Build the actual graph.Methods in org.jgrapht.graph.builder that return types with arguments of type GraphModifier and TypeMethodDescriptionGraphTypeBuilder.buildGraphBuilder()
Build the graph and acquire aGraphBuilder
in order to add vertices and edges.Methods in org.jgrapht.graph.builder with parameters of type GraphModifier and TypeMethodDescriptionAdds all the vertices and all the edges of thesourceGraph
to the graph being built.static <V,
E> GraphTypeBuilder <V, E> Create a graph type builder which will create the same graph type as the parameter graph. -
Uses of Graph in org.jgrapht.graph.concurrent
Classes in org.jgrapht.graph.concurrent that implement GraphModifier and TypeClassDescriptionclass
AsSynchronizedGraph<V,
E> Create a synchronized (thread-safe) Graph backed by the specified Graph.Methods in org.jgrapht.graph.concurrent with parameters of type GraphModifier and TypeMethodDescriptionBuild the AsSynchronizedGraph.Constructors in org.jgrapht.graph.concurrent with parameters of type GraphModifierConstructorDescriptionAsSynchronizedGraph
(Graph<V, E> g) Constructor for AsSynchronizedGraph with default settings (cache disabled, non-fair mode, and copyless mode disabled).private
AsSynchronizedGraph
(Graph<V, E> g, boolean cacheEnable, boolean fair, boolean copyless) Constructor for AsSynchronizedGraph with specified properties. -
Uses of Graph in org.jgrapht.graph.guava
Classes in org.jgrapht.graph.guava that implement GraphModifier and TypeClassDescriptionclass
BaseGraphAdapter<V,
G extends com.google.common.graph.Graph<V>> A base abstract implementation for the graph adapter class using Guava'sGraph
.class
BaseNetworkAdapter<V,
E, N extends com.google.common.graph.Network<V, E>> A base abstract implementation for the graph adapter class using Guava'sNetwork
.class
BaseValueGraphAdapter<V,
W, VG extends com.google.common.graph.ValueGraph<V, W>> A base abstract implementation for the graph adapter class using Guava'sValueGraph
.class
A graph adapter class using Guava'sImmutableValueGraph
specialized with double values.class
A graph adapter class using Guava'sImmutableGraph
.class
A graph adapter class using Guava'sImmutableNetwork
.class
A graph adapter class using Guava'sImmutableValueGraph
.class
A graph adapter class using Guava'sMutableValueGraph
specialized with double values.class
A graph adapter class using Guava'sMutableGraph
.class
A graph adapter class using Guava'sMutableNetwork
.class
A graph adapter class using Guava'sMutableValueGraph
. -
Uses of Graph in org.jgrapht.graph.specifics
Fields in org.jgrapht.graph.specifics declared as GraphConstructors in org.jgrapht.graph.specifics with parameters of type GraphModifierConstructorDescriptionDirectedSpecifics
(Graph<V, E> graph, Map<V, DirectedEdgeContainer<V, E>> vertexMap, EdgeSetFactory<V, E> edgeSetFactory) Construct a new directed specifics.FastLookupDirectedSpecifics
(Graph<V, E> graph, Map<V, DirectedEdgeContainer<V, E>> vertexMap, Map<Pair<V, V>, Set<E>> touchingVerticesToEdgeMap, EdgeSetFactory<V, E> edgeSetFactory) Construct a new fast lookup directed specifics.FastLookupUndirectedSpecifics
(Graph<V, E> graph, Map<V, UndirectedEdgeContainer<V, E>> vertexMap, Map<Pair<V, V>, Set<E>> touchingVerticesToEdgeMap, EdgeSetFactory<V, E> edgeSetFactory) Construct a new fast lookup undirected specifics.UndirectedSpecifics
(Graph<V, E> graph, Map<V, UndirectedEdgeContainer<V, E>> vertexMap, EdgeSetFactory<V, E> edgeSetFactory) Construct a new undirected specifics. -
Uses of Graph in org.jgrapht.nio
Methods in org.jgrapht.nio with parameters of type GraphModifier and TypeMethodDescriptiondefault void
GraphExporter.exportGraph
(Graph<V, E> g, File file) Export a graph to the givenFile
.default void
GraphExporter.exportGraph
(Graph<V, E> g, OutputStream out) Export a graph to the givenOutputStream
.void
GraphExporter.exportGraph
(Graph<V, E> g, Writer writer) Export a graph using the givenWriter
.default void
GraphImporter.importGraph
(Graph<V, E> g, File file) Import a graph from the givenFile
.default void
GraphImporter.importGraph
(Graph<V, E> g, InputStream in) Import a graph from the givenInputStream
.void
GraphImporter.importGraph
(Graph<V, E> g, Reader in) Import a graph using the givenReader
. -
Uses of Graph in org.jgrapht.nio.csv
Fields in org.jgrapht.nio.csv declared as GraphMethods in org.jgrapht.nio.csv with parameters of type GraphModifier and TypeMethodDescriptionprivate void
CSVExporter.exportAsAdjacencyList
(Graph<V, E> g, PrintWriter out) private void
CSVExporter.exportAsEdgeList
(Graph<V, E> g, PrintWriter out) private void
CSVExporter.exportAsMatrix
(Graph<V, E> g, PrintWriter out) private void
VisioExporter.exportEdge
(PrintWriter out, E edge, Graph<V, E> g) void
CSVExporter.exportGraph
(Graph<V, E> g, Writer writer) Exports a graphvoid
VisioExporter.exportGraph
(Graph<V, E> g, Writer writer) Exports the specified graph into a Visio CSV file format.void
CSVImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.Constructors in org.jgrapht.nio.csv with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.dimacs
Fields in org.jgrapht.nio.dimacs declared as GraphMethods in org.jgrapht.nio.dimacs with parameters of type GraphModifier and TypeMethodDescriptionvoid
DIMACSExporter.exportGraph
(Graph<V, E> g, Writer writer) void
DIMACSImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.Constructors in org.jgrapht.nio.dimacs with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.dot
Fields in org.jgrapht.nio.dot declared as GraphMethods in org.jgrapht.nio.dot with parameters of type GraphModifier and TypeMethodDescriptionprivate String
DOTExporter.computeConnector
(Graph<V, E> graph) Compute the connectorprivate String
DOTExporter.computeFooter
(Graph<V, E> graph) Compute the footerprivate String
DOTExporter.computeGraphId
(Graph<V, E> graph) Get the id of the graph.private String
DOTExporter.computeHeader
(Graph<V, E> graph) Compute the headervoid
DOTExporter.exportGraph
(Graph<V, E> g, Writer writer) Exports a graph into a plain text file in DOT format.void
DOTImporter.importGraph
(Graph<V, E> graph, Reader input) Constructors in org.jgrapht.nio.dot with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.gexf
Fields in org.jgrapht.nio.gexf declared as GraphMethods in org.jgrapht.nio.gexf with parameters of type GraphModifier and TypeMethodDescriptionvoid
GEXFExporter.exportGraph
(Graph<V, E> g, Writer writer) Exports a graph in GraphML format.void
SimpleGEXFImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.private void
GEXFExporter.writeEdges
(TransformerHandler handler, Graph<V, E> g) private void
GEXFExporter.writeGraphStart
(TransformerHandler handler, Graph<V, E> g) private void
GEXFExporter.writeVertices
(TransformerHandler handler, Graph<V, E> g) Constructors in org.jgrapht.nio.gexf with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.gml
Fields in org.jgrapht.nio.gml declared as GraphMethods in org.jgrapht.nio.gml with parameters of type GraphModifier and TypeMethodDescriptionprivate void
GmlExporter.exportEdges
(PrintWriter out, Graph<V, E> g) void
GmlExporter.exportGraph
(Graph<V, E> g, Writer writer) Exports an graph into a plain text GML format.private void
GmlExporter.exportVertices
(PrintWriter out, Graph<V, E> g) void
GmlImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.Constructors in org.jgrapht.nio.gml with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.graph6
Fields in org.jgrapht.nio.graph6 declared as GraphMethods in org.jgrapht.nio.graph6 with parameters of type GraphModifier and TypeMethodDescriptionvoid
Graph6Sparse6Exporter.exportGraph
(Graph<V, E> g, Writer writer) void
Graph6Sparse6Importer.importGraph
(Graph<V, E> graph, Reader input) Import a graph.private void
private void
Constructors in org.jgrapht.nio.graph6 with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.graphml
Fields in org.jgrapht.nio.graphml declared as GraphModifier and TypeFieldDescriptionGraphMLImporter.Consumers.graph
SimpleGraphMLImporter.Consumers.graph
Methods in org.jgrapht.nio.graphml with parameters of type GraphModifier and TypeMethodDescriptionvoid
GraphMLExporter.exportGraph
(Graph<V, E> g, Writer writer) Exports a graph in GraphML format.void
GraphMLImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.void
SimpleGraphMLImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.private void
GraphMLExporter.writeEdges
(TransformerHandler handler, Graph<V, E> g) private void
GraphMLExporter.writeGraphStart
(TransformerHandler handler, Graph<V, E> g) private void
GraphMLExporter.writeNodes
(TransformerHandler handler, Graph<V, E> g) Constructors in org.jgrapht.nio.graphml with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.json
Fields in org.jgrapht.nio.json declared as GraphMethods in org.jgrapht.nio.json with parameters of type GraphModifier and TypeMethodDescriptionprivate void
JSONExporter.exportEdge
(PrintWriter out, Graph<V, E> g, E e) private void
JSONExporter.exportEdgeAttributes
(PrintWriter out, Graph<V, E> g, E e) void
JSONExporter.exportGraph
(Graph<V, E> g, Writer writer) private void
JSONExporter.exportVertex
(PrintWriter out, Graph<V, E> g, V v) private void
JSONExporter.exportVertexAttributes
(PrintWriter out, Graph<V, E> g, V v) void
JSONImporter.importGraph
(Graph<V, E> graph, Reader input) Import a graph.Constructors in org.jgrapht.nio.json with parameters of type Graph -
Uses of Graph in org.jgrapht.nio.lemon
Methods in org.jgrapht.nio.lemon with parameters of type GraphModifier and TypeMethodDescriptionprivate void
LemonExporter.exportEdges
(PrintWriter out, Graph<V, E> g) void
LemonExporter.exportGraph
(Graph<V, E> g, Writer writer) private void
LemonExporter.exportVertices
(PrintWriter out, Graph<V, E> g) -
Uses of Graph in org.jgrapht.nio.matrix
Methods in org.jgrapht.nio.matrix with parameters of type GraphModifier and TypeMethodDescriptionprivate void
MatrixExporter.exportAdjacencyMatrix
(Graph<V, E> g, Writer writer) void
MatrixExporter.exportGraph
(Graph<V, E> g, Writer writer) private void
MatrixExporter.exportLaplacianMatrix
(Graph<V, E> g, Writer writer) private void
MatrixExporter.exportNormalizedLaplacianMatrix
(Graph<V, E> g, Writer writer) -
Uses of Graph in org.jgrapht.nio.tsplib
Fields in org.jgrapht.nio.tsplib declared as GraphMethods in org.jgrapht.nio.tsplib with parameters of type GraphModifier and TypeMethodDescriptionvoid
TSPLIBImporter.importGraph
(Graph<V, E> graph, Reader in) Import a graph using the givenReader
.private TSPLIBImporter.Metadata
<V, E> -
Uses of Graph in org.jgrapht.opt.graph.fastutil
Classes in org.jgrapht.opt.graph.fastutil that implement GraphModifier and TypeClassDescriptionclass
FastutilMapGraph<V,
E> A graph implementation using fastutil's map implementations for storage.class
A graph implementation using fastutil's map implementations for storage specialized for integer vertices.Methods in org.jgrapht.opt.graph.fastutil that return types with arguments of type GraphModifier and TypeMethodDescriptionFastutilFastLookupGSS.getSpecificsFactory()
FastutilFastLookupIntVertexGSS.getSpecificsFactory()
FastutilGSS.getSpecificsFactory()
FastutilIntVertexGSS.getSpecificsFactory()
-
Uses of Graph in org.jgrapht.opt.graph.sparse
Classes in org.jgrapht.opt.graph.sparse that implement GraphModifier and TypeClassDescriptionclass
A sparse directed graph.class
Sparse directed weighted graph.class
Sparse undirected graph.class
Sparse undirected weighted graph. -
Uses of Graph in org.jgrapht.opt.graph.sparse.specifics
Classes in org.jgrapht.opt.graph.sparse.specifics that implement GraphModifier and TypeClassDescriptionclass
AbstractSparseSpecificsGraph<S extends SparseGraphSpecifics>
Helper class to ease the implementation of different sparse graphs with different backends. -
Uses of Graph in org.jgrapht.sux4j
Classes in org.jgrapht.sux4j that implement GraphModifier and TypeClassDescriptionclass
An abstract base class for all succinct directed implementations.class
An abstract base class for all succinct implementations.class
An abstract base class for all succinct undirected implementations.class
An immutable directed graph withIntIntPair
edges represented using quasi-succinct data structures.class
An immutable directed graph withInteger
edges represented using quasi-succinct data structures.class
An immutable undirected graph withInteger
edges represented using quasi-succinct data structures.class
An immutable undirected graph withIntIntSortedPair
edges represented using quasi-succinct data structures.Fields in org.jgrapht.sux4j declared as GraphModifier and TypeFieldDescriptionAbstractSuccinctDirectedGraph.CumulativeSuccessors.graph
AbstractSuccinctUndirectedGraph.CumulativeDegrees.graph
AbstractSuccinctUndirectedGraph.CumulativeSuccessors.graph
Methods in org.jgrapht.sux4j that return GraphModifier and TypeMethodDescriptionSuccinctDirectedGraph.SuccinctGraphIterables.getGraph()
SuccinctIntDirectedGraph.SuccinctGraphIterables.getGraph()
SuccinctIntUndirectedGraph.SuccinctGraphIterables.getGraph()
SuccinctUndirectedGraph.SuccinctGraphIterables.getGraph()
Constructors in org.jgrapht.sux4j with parameters of type GraphModifierConstructorDescriptionprotected
protected
protected
SuccinctDirectedGraph
(Graph<Integer, E> graph) Creates a new immutable succinct directed graph from a given directed graph, supporting both outgoing and incoming edges.SuccinctDirectedGraph
(Graph<Integer, E> graph, boolean incomingEdgesSupport) Creates a new immutable succinct directed graph from a given directed graph, choosing whether to support incoming edges.SuccinctIntDirectedGraph
(Graph<Integer, E> graph) Creates a new immutable succinct directed graph from a given directed graph, supporting both outgoing and incoming edges.SuccinctIntDirectedGraph
(Graph<Integer, E> graph, boolean incomingEdgesSupport) Creates a new immutable succinct directed graph from a given directed graph, choosing whether to support incoming edges.SuccinctIntUndirectedGraph
(Graph<Integer, E> graph) Creates a new immutable succinct undirected graph from a given undirected graph.SuccinctUndirectedGraph
(Graph<Integer, E> graph) Creates a new immutable succinct undirected graph from a given undirected graph. -
Uses of Graph in org.jgrapht.traverse
Fields in org.jgrapht.traverse declared as GraphMethods in org.jgrapht.traverse that return GraphModifier and TypeMethodDescriptionAbstractGraphIterator.getGraph()
Get the graph being traversed.Constructors in org.jgrapht.traverse with parameters of type GraphModifierConstructorDescriptionAbstractGraphIterator
(Graph<V, E> graph) Create a new iteratorBreadthFirstIterator
(Graph<V, E> g) Creates a new breadth-first iterator for the specified graph.Creates a new breadth-first iterator for the specified graph.BreadthFirstIterator
(Graph<V, E> g, V startVertex) Creates a new breadth-first iterator for the specified graph.Creates a new closest-first iterator for the specified graph.Creates a new radius-bounded closest-first iterator for the specified graph.ClosestFirstIterator
(Graph<V, E> g, Iterable<V> startVertices, double radius, Supplier<org.jheaps.AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V, E>>> heapSupplier) Creates a new radius-bounded closest-first iterator for the specified graph.ClosestFirstIterator
(Graph<V, E> g, V startVertex) Creates a new closest-first iterator for the specified graph.ClosestFirstIterator
(Graph<V, E> g, V startVertex, double radius) Creates a new radius-bounded closest-first iterator for the specified graph.ClosestFirstIterator
(Graph<V, E> g, V startVertex, double radius, Supplier<org.jheaps.AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V, E>>> heapSupplier) Creates a new radius-bounded closest-first iterator for the specified graph.Creates a new iterator for the specified graph.Creates a new iterator for the specified graph.CrossComponentIterator
(Graph<V, E> g, V startVertex) Creates a new iterator for the specified graph.DegeneracyOrderingIterator
(Graph<V, E> graph) ConstructorDepthFirstIterator
(Graph<V, E> g) Creates a new depth-first iterator for the specified graph.Creates a new depth-first iterator for the specified graph.DepthFirstIterator
(Graph<V, E> g, V startVertex) Creates a new depth-first iterator for the specified graph.LexBreadthFirstIterator
(Graph<V, E> graph) Creates new lexicographical breadth-first iterator forgraph
.MaximumCardinalityIterator
(Graph<V, E> graph) Creates a maximum cardinality iterator for thegraph
.RandomWalkVertexIterator
(Graph<V, E> graph, V vertex) Create a new iteratorRandomWalkVertexIterator
(Graph<V, E> graph, V vertex, long maxHops) Create a new iteratorCreate a new iteratorTopologicalOrderIterator
(Graph<V, E> graph) Construct a topological order iterator.TopologicalOrderIterator
(Graph<V, E> graph, Comparator<V> comparator) Construct a topological order iterator. -
Uses of Graph in org.jgrapht.webgraph
Classes in org.jgrapht.webgraph that implement GraphModifier and TypeClassDescriptionclass
AbstractImmutableBigGraphAdapter<E extends it.unimi.dsi.fastutil.longs.LongLongPair>
An abstract base class for adapters using WebGraph (big)'sImmutableGraph
.class
AbstractImmutableGraphAdapter<E extends it.unimi.dsi.fastutil.ints.IntIntPair>
An abstract base class for adapters using WebGraph'sImmutableGraph
.class
An adapter class for directed graphs using WebGraph (big)'sImmutableGraph
.class
An adapter class for directed graphs using WebGraph'sImmutableGraph
.class
An adapter class for undirected graphs using WebGraph (big)'sImmutableGraph
.class
An adapter class for undirected graphs using WebGraph'sImmutableGraph
.
DeltaSteppingShortestPath(Graph, double, ThreadPoolExecutor)