Uses of Interface org.jgrapht.Graph (JGraphT : a free Java graph library)

Packages that use Graph
Package	Description
org.jgrapht	The front-end API's interfaces and classes, including `Graph`.
org.jgrapht.alg	Algorithms provided with JGraphT.
org.jgrapht.alg.clique	Clique related algorithms.
org.jgrapht.alg.clustering	Graph clustering algorithms.
org.jgrapht.alg.color	Graph coloring algorithms.
org.jgrapht.alg.connectivity	Algorithms dealing with various connectivity aspects of a graph.
org.jgrapht.alg.cycle	Algorithms related to graph cycles.
org.jgrapht.alg.decomposition	Algorithms for computing decompositions.
org.jgrapht.alg.densesubgraph	Algorithms for computing maximum density subgraphs.
org.jgrapht.alg.drawing	Graph Drawing.
org.jgrapht.alg.flow	Flow related algorithms.
org.jgrapht.alg.flow.mincost	Algorithms for minimum cost flow
org.jgrapht.alg.independentset	Algorithms for Independent Set in a graph.
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.isomorphism	Algorithms for (sub)graph isomorphism.
org.jgrapht.alg.lca	Algorithms for computing lowest common ancestors in graphs.
org.jgrapht.alg.matching	Algorithms for the computation of matchings.
org.jgrapht.alg.matching.blossom.v5	Package for Kolmogorov's Blossom V algorithm
org.jgrapht.alg.partition	Algorithm for computing partitions.
org.jgrapht.alg.planar	Algorithms for testing planarity of the graphs
org.jgrapht.alg.scoring	Vertex and/or edge scoring algorithms.
org.jgrapht.alg.shortestpath	Shortest-path related algorithms.
org.jgrapht.alg.spanning	Spanning tree and spanner algorithms.
org.jgrapht.alg.tour	Graph tours related algorithms.
org.jgrapht.alg.transform	Package for graph transformers
org.jgrapht.alg.util	Utilities used by JGraphT algorithms.
org.jgrapht.alg.vertexcover	Vertex cover algorithms.
org.jgrapht.generate	Generators for graphs of various topologies.
org.jgrapht.graph	Implementations of various graphs.
org.jgrapht.graph.builder	Various builder for graphs.
org.jgrapht.graph.concurrent	Implementations of various concurrent graph structures.
org.jgrapht.graph.specifics	Implementations of specifics for various graph types.
org.jgrapht.traverse	Graph traversal means.

Uses of Graph in org.jgrapht

Subinterfaces of Graph in org.jgrapht
Modifier and Type	Interface	Description
`interface`	`ListenableGraph<V,E>`	A graph that supports listeners on structural change events.

Methods in org.jgrapht that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	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 an `IllegalArgumentException` if it is not.
`static <V,E> Graph<V,E>`	GraphTests.`requireDirected(Graph<V,E> graph, java.lang.String message)`	Checks that the specified graph is directed and throws a customized `IllegalArgumentException` 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 an `IllegalArgumentException` if it is not.
`static <V,E> Graph<V,E>`	GraphTests.`requireDirectedOrUndirected(Graph<V,E> graph, java.lang.String message)`	Checks that the specified graph is directed or undirected and throws a customized `IllegalArgumentException` 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 an `IllegalArgumentException` if it is not.
`static <V,E> Graph<V,E>`	GraphTests.`requireUndirected(Graph<V,E> graph, java.lang.String message)`	Checks that the specified graph is undirected and throws a customized `IllegalArgumentException` 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 customized `IllegalArgumentException` 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 Graph
Modifier and Type	Method	Description
`static <V,E> boolean`	Graphs.`addAllEdges(Graph<? super V,? super E> destination, Graph<V,E> source, java.util.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, java.util.Collection<? extends V> vertices)`	Adds all of the specified vertices to the destination graph.
`static <V,E> E`	Graphs.`addEdge(Graph<V,E> g, V sourceVertex, V targetVertex, double weight)`	Creates a new edge and adds it to the specified graph similarly to the `addEdge(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 the `addEdge(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 the `addEdge(Object, Object)` method.
`static <V,E> boolean`	Graphs.`addGraph(Graph<? super V,? super E> destination, Graph<V,E> source)`	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, java.lang.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, java.lang.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`	GraphMetrics.`getGirth(Graph<V,E> graph)`	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`	GraphMetrics.`getRadius(Graph<V,E> graph)`	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, java.util.Set<? extends V> firstPartition, java.util.Set<? extends V> secondPartition)`	Test whether a partition of the vertices into two sets is a bipartite partition.
`static <V,E> boolean`	GraphTests.`isChordal(Graph<V,E> graph)`	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`	GraphTests.`isCubic(Graph<V,E> graph)`	Tests whether a graph is cubic.
`static <V,E> boolean`	GraphTests.`isEmpty(Graph<V,E> graph)`	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`	GraphTests.`isForest(Graph<V,E> graph)`	Test whether an undirected graph is a forest.
`static <V,E> boolean`	GraphTests.`isK33Subdivision(Graph<V,E> graph)`	Checks whether the `graph` is a $K_{3,3}$ subdivision.
`static <V,E> boolean`	GraphTests.`isK5Subdivision(Graph<V,E> graph)`	Checks whether the `graph` is a $K_5$ subdivision.
`static <V,E> boolean`	GraphTests.`isKuratowskiSubdivision(Graph<V,E> graph)`	Checks whether the `graph` is a Kuratowski subdivision.
`static <V,E> boolean`	GraphTests.`isOverfull(Graph<V,E> graph)`	Test whether a graph is overfull.
`static <V,E> boolean`	GraphTests.`isPerfect(Graph<V,E> graph)`	Checks that the specified graph is perfect.
`static <V,E> boolean`	GraphTests.`isPlanar(Graph<V,E> graph)`	Checks that the specified graph is planar.
`static <V,E> boolean`	GraphTests.`isSimple(Graph<V,E> graph)`	Check if a graph is simple.
`static <V,E> boolean`	GraphTests.`isSplit(Graph<V,E> graph)`	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`	GraphTests.`isTree(Graph<V,E> graph)`	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.
`static <V,E> java.util.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> java.util.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> java.util.List<V>`	Graphs.`predecessorListOf(Graph<V,E> g, V vertex)`	Returns a list of vertices that are the direct predecessors of a specified vertex.
`static <V,E> boolean`	Graphs.`removeVertexAndPreserveConnectivity(Graph<V,E> graph, java.lang.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, java.util.function.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 an `IllegalArgumentException` if it is not.
`static <V,E> Graph<V,E>`	GraphTests.`requireDirected(Graph<V,E> graph, java.lang.String message)`	Checks that the specified graph is directed and throws a customized `IllegalArgumentException` 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 an `IllegalArgumentException` if it is not.
`static <V,E> Graph<V,E>`	GraphTests.`requireDirectedOrUndirected(Graph<V,E> graph, java.lang.String message)`	Checks that the specified graph is directed or undirected and throws a customized `IllegalArgumentException` 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 an `IllegalArgumentException` if it is not.
`static <V,E> Graph<V,E>`	GraphTests.`requireUndirected(Graph<V,E> graph, java.lang.String message)`	Checks that the specified graph is undirected and throws a customized `IllegalArgumentException` 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 customized `IllegalArgumentException` if it is not.
`static <V,E> java.util.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

Methods in org.jgrapht.alg with parameters of type Graph
Modifier and Type	Method	Description
`<V,E> void`	TransitiveReduction.`reduce(Graph<V,E> directedGraph)`	This method will remove all transitive edges from the graph passed as input parameter.

Constructors in org.jgrapht.alg with parameters of type Graph
Constructor	Description
`StoerWagnerMinimumCut(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 Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	BaseBronKerboschCliqueFinder.`graph`	The underlying graph
`protected Graph<V,E>`	BaseBronKerboschCliqueFinder.`graph`	The underlying graph
`protected Graph<V,E>`	BaseBronKerboschCliqueFinder.`graph`	The underlying graph

Methods in org.jgrapht.alg.clique that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	CliqueMinimalSeparatorDecomposition.`getGraph()`	Get the original graph.
`Graph<V,E>`	CliqueMinimalSeparatorDecomposition.`getMinimalTriangulation()`	Get the minimal triangulation of the graph.

Constructors in org.jgrapht.alg.clique with parameters of type Graph
Constructor	Description
`BronKerboschCliqueFinder(Graph<V,E> graph)`	Constructs a new clique finder.
`BronKerboschCliqueFinder(Graph<V,E> graph, long timeout, java.util.concurrent.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.
`CliqueMinimalSeparatorDecomposition(Graph<V,E> g)`	Setup a clique minimal separator decomposition on undirected graph `g`.
`DegeneracyBronKerboschCliqueFinder(Graph<V,E> graph)`	Constructs a new clique finder.
`DegeneracyBronKerboschCliqueFinder(Graph<V,E> graph, long timeout, java.util.concurrent.TimeUnit unit)`	Constructs a new clique finder.
`PivotBronKerboschCliqueFinder(Graph<V,E> graph)`	Constructs a new clique finder.
`PivotBronKerboschCliqueFinder(Graph<V,E> graph, long timeout, java.util.concurrent.TimeUnit unit)`	Constructs a new clique finder.

Uses of Graph in org.jgrapht.alg.clustering

Constructors in org.jgrapht.alg.clustering with parameters of type Graph
Constructor	Description
`KSpanningTreeClustering(Graph<V,E> graph, int k)`	Create a new clustering algorithm.

Uses of Graph in org.jgrapht.alg.color

Fields in org.jgrapht.alg.color declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	GreedyColoring.`graph`	The input graph

Constructors in org.jgrapht.alg.color with parameters of type Graph
Constructor	Description
`BrownBacktrackColoring(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.
`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, java.util.Random rng)`	Construct a new coloring algorithm
`SaturationDegreeColoring(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 Graph
Modifier and Type	Class	Description
`class`	`BlockCutpointGraph<V,E>`	A Block-Cutpoint graph (also known as a block-cut tree).

Fields in org.jgrapht.alg.connectivity declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	AbstractStrongConnectivityInspector.`graph`
`protected Graph<V,E>`	AbstractStrongConnectivityInspector.`graph`

Fields in org.jgrapht.alg.connectivity with type parameters of type Graph
Modifier and Type	Field	Description
`protected java.util.List<Graph<V,E>>`	AbstractStrongConnectivityInspector.`stronglyConnectedSubgraphs`
`protected java.util.List<Graph<V,E>>`	AbstractStrongConnectivityInspector.`stronglyConnectedSubgraphs`

Methods in org.jgrapht.alg.connectivity that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	BlockCutpointGraph.`getBlock(V vertex)`	Returns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected component) containing the vertex.
`Graph<V,E>`	BiconnectivityInspector.`getConnectedComponent(V vertex)`	Returns the connected component containing the given vertex.

Methods in org.jgrapht.alg.connectivity that return types with arguments of type Graph
Modifier and Type	Method	Description
`java.util.Set<Graph<V,E>>`	BiconnectivityInspector.`getBlocks()`	Returns all blocks (biconnected components) in the graph.
`java.util.Set<Graph<V,E>>`	BiconnectivityInspector.`getBlocks(V vertex)`	Returns a set of blocks (biconnected components) containing the specified vertex.
`java.util.Set<Graph<V,E>>`	BlockCutpointGraph.`getBlocks()`	Returns all blocks (biconnected components) in the graph
`java.util.Set<Graph<V,E>>`	BiconnectivityInspector.`getConnectedComponents()`	Returns all connected components in the graph.

Constructors in org.jgrapht.alg.connectivity with parameters of type Graph
Constructor	Description
`BiconnectivityInspector(Graph<V,E> graph)`	Constructs a new BiconnectivityInspector
`BlockCutpointGraph(Graph<V,E> graph)`	Constructs a Block-Cutpoint graph
`ConnectivityInspector(Graph<V,E> g)`	Creates a connectivity inspector for the specified graph.
`GabowStrongConnectivityInspector(Graph<V,E> graph)`	Constructor
`KosarajuStrongConnectivityInspector(Graph<V,E> graph)`	Constructor

Uses of Graph in org.jgrapht.alg.cycle

Fields in org.jgrapht.alg.cycle declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	HierholzerEulerianCycle.`g`
`protected Graph<V,E>`	AbstractFundamentalCycleBasis.`graph`

Methods in org.jgrapht.alg.cycle that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	HawickJamesSimpleCycles.`getGraph()`	Get the graph
`Graph<V,E>`	SzwarcfiterLauerSimpleCycles.`getGraph()`	Get the graph
`Graph<V,E>`	TarjanSimpleCycles.`getGraph()`	Get the graph
`Graph<V,E>`	TiernanSimpleCycles.`getGraph()`	Get the graph

Methods in org.jgrapht.alg.cycle with parameters of type Graph
Modifier and Type	Method	Description
`GraphPath<V,E>`	ChinesePostman.`getCPPSolution(Graph<V,E> graph)`	Solves the Chinese Postman Problem on the given graph.
`GraphPath<V,E>`	HierholzerEulerianCycle.`getEulerianCycle(Graph<V,E> g)`	Compute an Eulerian cycle of a graph.
`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`	BergeGraphInspector.`isBerge(Graph<V,E> g)`	Performs the Berge Recognition Algorithm.
`boolean`	BergeGraphInspector.`isBerge(Graph<V,E> g, boolean computeCertificate)`	Performs the Berge Recognition Algorithm.
`boolean`	HierholzerEulerianCycle.`isEulerian(Graph<V,E> graph)`	Test whether a graph is Eulerian.
`void`	HawickJamesSimpleCycles.`setGraph(Graph<V,E> graph)`	Set the graph
`void`	SzwarcfiterLauerSimpleCycles.`setGraph(Graph<V,E> graph)`	Set the graph
`void`	TarjanSimpleCycles.`setGraph(Graph<V,E> graph)`	Set the graph
`void`	TiernanSimpleCycles.`setGraph(Graph<V,E> graph)`	Set the graph
`static <V,E> GraphPath<V,E>`	Cycles.`simpleCycleToGraphPath(Graph<V,E> graph, java.util.List<E> cycle)`	Transform a simple cycle from an edge set representation to a graph path.

Constructors in org.jgrapht.alg.cycle with parameters of type Graph
Constructor	Description
`AbstractFundamentalCycleBasis(Graph<V,E> graph)`	Constructor
`AhujaOrlinSharmaCyclicExchangeLocalAugmentation(Graph<V,E> graph, int lengthBound, java.util.Map<V,java.lang.Integer> labelMap, boolean bestImprovement)`	Constructs an algorithm with given inputs
`ChordalGraphMinimalVertexSeparatorFinder(Graph<V,E> graph)`	Creates new `ChordalGraphMinimalVertexSeparatorFinder` instance.
`ChordalityInspector(Graph<V,E> graph)`	Creates a chordality inspector for `graph`, which uses `MaximumCardinalityIterator` as a default iterator.
`ChordalityInspector(Graph<V,E> graph, ChordalityInspector.IterationOrder iterationOrder)`	Creates a chordality inspector for `graph`, 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.
`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.
`QueueBFSFundamentalCycleBasis(Graph<V,E> graph)`	Constructor
`StackBFSFundamentalCycleBasis(Graph<V,E> graph)`	Constructor
`SzwarcfiterLauerSimpleCycles(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 the `graph`

Uses of Graph in org.jgrapht.alg.decomposition

Constructors in org.jgrapht.alg.decomposition with parameters of type Graph
Constructor	Description
`DulmageMendelsohnDecomposition(Graph<V,E> graph, java.util.Set<V> partition1, java.util.Set<V> partition2)`	Construct the algorithm for a given bipartite graph $G=(V_1,V_2,E)$ and it's partitions $V_1$ and $V_2$, where $V_1\cap V_2=\emptyset$.
`HeavyPathDecomposition(Graph<V,E> forest, java.util.Set<V> roots)`	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 Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	GoldbergMaximumDensitySubgraphAlgorithmBase.`graph`

Methods in org.jgrapht.alg.densesubgraph that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	GoldbergMaximumDensitySubgraphAlgorithmBase.`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 Graph
Modifier and Type	Method	Description
`protected 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 Graph
Constructor	Description
`GoldbergMaximumDensitySubgraphAlgorithm(Graph<V,E> graph, V s, V t, double epsilon)`	Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithm
`GoldbergMaximumDensitySubgraphAlgorithm(Graph<V,E> graph, V s, V t, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor
`GoldbergMaximumDensitySubgraphAlgorithmBase(Graph<V,E> graph, V s, V t, boolean checkWeights, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor
`GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight(Graph<V,E> graph, V s, V t, double epsilon)`	Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithm
`GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight(Graph<V,E> graph, V s, V t, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor
`GoldbergMaximumDensitySubgraphAlgorithmNodeWeights(Graph<V,E> graph, V s, V t, double epsilon)`	Convenience constructor that uses PushRelabel as default MinimumSTCutAlgorithm
`GoldbergMaximumDensitySubgraphAlgorithmNodeWeights(Graph<V,E> graph, V s, V t, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor

Constructor parameters in org.jgrapht.alg.densesubgraph with type arguments of type Graph
Constructor	Description
`GoldbergMaximumDensitySubgraphAlgorithm(Graph<V,E> graph, V s, V t, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor
`GoldbergMaximumDensitySubgraphAlgorithmBase(Graph<V,E> graph, V s, V t, boolean checkWeights, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor
`GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight(Graph<V,E> graph, V s, V t, double epsilon, java.util.function.Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)`	Constructor
`GoldbergMaximumDensitySubgraphAlgorithmNodeWeights(Graph<V,E> graph, V s, V t, double epsilon, java.util.function.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 Graph
Modifier and Type	Method	Description
`protected java.util.Map<V,Point2D>`	FRLayoutAlgorithm2D.`calculateAttractiveForces(Graph<V,E> graph, LayoutModel2D<V> model)`	Calculate the repulsive forces between vertices connected with edges.
`protected java.util.Map<V,Point2D>`	FRLayoutAlgorithm2D.`calculateRepulsiveForces(Graph<V,E> graph, LayoutModel2D<V> model)`	Calculate the repulsive forces between vertices
`protected java.util.Map<V,Point2D>`	IndexedFRLayoutAlgorithm2D.`calculateRepulsiveForces(Graph<V,E> graph, LayoutModel2D<V> model)`
`void`	CircularLayoutAlgorithm2D.`layout(Graph<V,E> graph, LayoutModel2D<V> model)`
`void`	FRLayoutAlgorithm2D.`layout(Graph<V,E> graph, LayoutModel2D<V> model)`
`void`	IndexedFRLayoutAlgorithm2D.`layout(Graph<V,E> graph, LayoutModel2D<V> model)`
`void`	LayoutAlgorithm2D.`layout(Graph<V,E> graph, LayoutModel2D<V> model)`	Layout a graph.
`void`	RandomLayoutAlgorithm2D.`layout(Graph<V,E> graph, LayoutModel2D<V> model)`

Uses of Graph in org.jgrapht.alg.flow

Fields in org.jgrapht.alg.flow declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	MaximumFlowAlgorithmBase.`network`

Constructors in org.jgrapht.alg.flow with parameters of type Graph
Constructor	Description
`DinicMFImpl(Graph<V,E> network)`	Constructor.
`DinicMFImpl(Graph<V,E> network, double epsilon)`	Constructor.
`EdmondsKarpMFImpl(Graph<V,E> network)`	Constructs `MaximumFlow` instance to work with a copy of `network`.
`EdmondsKarpMFImpl(Graph<V,E> network, double epsilon)`	Constructs `MaximumFlow` instance to work with a copy of `network`.
`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 flow
`PadbergRaoOddMinimumCutset(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

Methods in org.jgrapht.alg.flow.mincost that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	MinimumCostFlowProblem.`getGraph()`	Returns the flow network
`Graph<V,E>`	MinimumCostFlowProblem.MinimumCostFlowProblemImpl.`getGraph()`	Returns the flow network

Constructors in org.jgrapht.alg.flow.mincost with parameters of type Graph
Constructor	Description
`MinimumCostFlowProblemImpl(Graph<V,E> graph, java.util.function.Function<V,java.lang.Integer> supplyMap, java.util.function.Function<E,java.lang.Integer> arcCapacityUpperBounds)`	Constructs a new minimum cost flow problem without arc capacity lower bounds.
`MinimumCostFlowProblemImpl(Graph<V,E> graph, java.util.function.Function<V,java.lang.Integer> nodeSupplies, java.util.function.Function<E,java.lang.Integer> arcCapacityUpperBounds, java.util.function.Function<E,java.lang.Integer> arcCapacityLowerBounds)`	Constructs a new minimum cost flow problem

Uses of Graph in org.jgrapht.alg.independentset

Constructors in org.jgrapht.alg.independentset with parameters of type Graph
Constructor	Description
`ChordalGraphIndependentSetFinder(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

Methods in org.jgrapht.alg.interfaces that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	MaximumDensitySubgraphAlgorithm.`calculateDensest()`	Calculate a maximum density subgraph
`Graph<Graph<V,E>,DefaultEdge>`	StrongConnectivityAlgorithm.`getCondensation()`	Compute the condensation of the given graph.
`Graph<V,E>`	MatchingAlgorithm.Matching.`getGraph()`	Returns the graph over which this matching is defined.
`Graph<V,E>`	MatchingAlgorithm.MatchingImpl.`getGraph()`
`Graph<V,E>`	MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths.`getGraph()`	Returns the graph over which this set of paths is defined.
`Graph<V,E>`	PlanarityTestingAlgorithm.Embedding.`getGraph()`	Returns the underlying `graph`
`Graph<V,E>`	PlanarityTestingAlgorithm.EmbeddingImpl.`getGraph()`	Returns the underlying `graph`
`Graph<V,E>`	ShortestPathAlgorithm.SingleSourcePaths.`getGraph()`	Returns the graph over which this set of paths is defined.
`Graph<V,E>`	StrongConnectivityAlgorithm.`getGraph()`	Return the underlying graph.
`Graph<V,E>`	PlanarityTestingAlgorithm.`getKuratowskiSubdivision()`	Extracts a Kuratowski subdivision from the `graph`.

Methods in org.jgrapht.alg.interfaces that return types with arguments of type Graph
Modifier and Type	Method	Description
`Graph<Graph<V,E>,DefaultEdge>`	StrongConnectivityAlgorithm.`getCondensation()`	Compute the condensation of the given graph.
`java.util.List<Graph<V,E>>`	StrongConnectivityAlgorithm.`getStronglyConnectedComponents()`	Computes a list of subgraphs of the given graph.

Methods in org.jgrapht.alg.interfaces with parameters of type Graph
Modifier and Type	Method	Description
`GraphPath<V,E>`	EulerianCycleAlgorithm.`getEulerianCycle(Graph<V,E> graph)`	Compute an Eulerian cycle of a graph.
`GraphPath<V,E>`	HamiltonianCycleAlgorithm.`getTour(Graph<V,E> graph)`	Computes a tour.
`boolean`	CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTree.`isCapacitatedSpanningTree(Graph<V,E> graph, V root, double capacity, java.util.Map<V,java.lang.Double> demands)`	Tests whether `cmst` is a CMST on `graph` with root `root`, capacity `capacity` and demand function `demands`.
`boolean`	CapacitatedSpanningTreeAlgorithm.CapacitatedSpanningTreeImpl.`isCapacitatedSpanningTree(Graph<V,E> graph, V root, double capacity, java.util.Map<V,java.lang.Double> demands)`
`default <E> boolean`	AStarAdmissibleHeuristic.`isConsistent(Graph<V,E> graph)`	Returns true if the heuristic is a consistent or monotone heuristic wrt the provided `graph`.

Constructors in org.jgrapht.alg.interfaces with parameters of type Graph
Constructor	Description
`CycleBasisImpl(Graph<V,E> graph)`	Construct a new instance.
`CycleBasisImpl(Graph<V,E> graph, java.util.Set<java.util.List<E>> cycles, int length, double weight)`	Construct a new instance.
`EmbeddingImpl(Graph<V,E> graph, java.util.Map<V,java.util.List<E>> embeddingMap)`	Creates new embedding of the `graph`
`MatchingImpl(Graph<V,E> graph, java.util.Set<E> edges, double weight)`	Construct a new instance
`PathDecompositionImpl(Graph<V,E> graph, java.util.Set<E> edges, java.util.List<java.util.List<V>> paths)`	Construct a new path decomposition.

Uses of Graph in org.jgrapht.alg.isomorphism

Fields in org.jgrapht.alg.isomorphism declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	VF2AbstractIsomorphismInspector.`graph1`
`protected Graph<V,E>`	VF2AbstractIsomorphismInspector.`graph2`

Methods in org.jgrapht.alg.isomorphism with parameters of type Graph
Modifier and Type	Method	Description
`static <V,E> IsomorphicGraphMapping<V,E>`	IsomorphicGraphMapping.`identity(Graph<V,E> graph)`	Computes an identity automorphism (i.e.

Constructors in org.jgrapht.alg.isomorphism with parameters of type Graph
Constructor	Description
`AHUForestIsomorphismInspector(Graph<V,E> forest1, java.util.Set<V> roots1, Graph<V,E> forest2, java.util.Set<V> roots2)`	Construct a new AHU rooted forest isomorphism inspector.
`AHURootedTreeIsomorphismInspector(Graph<V,E> tree1, V root1, Graph<V,E> tree2, V root2)`	Construct a new AHU rooted tree isomorphism inspector.
`AHUUnrootedTreeIsomorphismInspector(Graph<V,E> tree1, Graph<V,E> tree2)`	Construct a new AHU unrooted tree isomorphism inspector.
`ColorRefinementIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2)`	Constructor for a isomorphism inspector based on color refinement.
`IsomorphicGraphMapping(java.util.Map<V,V> forwardMapping, java.util.Map<V,V> backwardMapping, Graph<V,E> graph1, Graph<V,E> graph2)`	Construct a new isomorphic graph mapping.
`VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2)`	Construct a new base implementation of the VF2 isomorphism inspector.
`VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, boolean cacheEdges)`	Construct a new base implementation of the VF2 isomorphism inspector.
`VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, java.util.Comparator<V> vertexComparator, java.util.Comparator<E> edgeComparator)`	Construct a new base implementation of the VF2 isomorphism inspector.
`VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, java.util.Comparator<V> vertexComparator, java.util.Comparator<E> edgeComparator, boolean cacheEdges)`	Construct a new base implementation of the VF2 isomorphism inspector.
`VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2)`	Construct a new VF2 isomorphism inspector.
`VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, boolean cacheEdges)`	Construct a new VF2 isomorphism inspector.
`VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, java.util.Comparator<V> vertexComparator, java.util.Comparator<E> edgeComparator)`	Construct a new VF2 isomorphism inspector.
`VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, java.util.Comparator<V> vertexComparator, java.util.Comparator<E> edgeComparator, boolean cacheEdges)`	Construct a new VF2 isomorphism inspector.
`VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2)`	Construct a new VF2 subgraph isomorphism inspector.
`VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, boolean cacheEdges)`	Construct a new VF2 subgraph isomorphism inspector.
`VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, java.util.Comparator<V> vertexComparator, java.util.Comparator<E> edgeComparator)`	Construct a new VF2 subgraph isomorphism inspector.
`VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, java.util.Comparator<V> vertexComparator, java.util.Comparator<E> edgeComparator, boolean cacheEdges)`	Construct a new VF2 subgraph isomorphism inspector.

Uses of Graph in org.jgrapht.alg.lca

Constructors in org.jgrapht.alg.lca with parameters of type Graph
Constructor	Description
`BinaryLiftingLCAFinder(Graph<V,E> graph, java.util.Set<V> roots)`	Construct a new instance of the algorithm.
`BinaryLiftingLCAFinder(Graph<V,E> graph, V root)`	Construct a new instance of the algorithm.
`EulerTourRMQLCAFinder(Graph<V,E> graph, java.util.Set<V> roots)`	Construct a new instance of the algorithm.
`EulerTourRMQLCAFinder(Graph<V,E> graph, V root)`	Construct a new instance of the algorithm.
`HeavyPathLCAFinder(Graph<V,E> graph, java.util.Set<V> roots)`	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.
`TarjanLCAFinder(Graph<V,E> graph, java.util.Set<V> roots)`	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.matching

Methods in org.jgrapht.alg.matching with parameters of type Graph
Modifier and Type	Method	Description
`static <V,E> boolean`	SparseEdmondsMaximumCardinalityMatching.`isOptimalMatching(Graph<V,E> graph, java.util.Set<E> matching, java.util.Map<V,java.lang.Integer> oddSetCover)`	Check whether a matching is optimal.

Constructors in org.jgrapht.alg.matching with parameters of type Graph
Constructor	Description
`DenseEdmondsMaximumCardinalityMatching(Graph<V,E> graph)`	Constructs 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, java.util.Set<V> partition1, java.util.Set<V> partition2)`	Constructs a new instance of the Hopcroft Karp bipartite matching algorithm.
`KuhnMunkresMinimalWeightBipartitePerfectMatching(Graph<V,E> graph, java.util.Set<? extends V> partition1, java.util.Set<? extends V> partition2)`	Construct a new instance of the algorithm.
`MaximumWeightBipartiteMatching(Graph<V,E> graph, java.util.Set<V> partition1, java.util.Set<V> partition2)`	Constructor.
`MaximumWeightBipartiteMatching(Graph<V,E> graph, java.util.Set<V> partition1, java.util.Set<V> partition2, java.util.function.Function<java.util.Comparator<java.math.BigDecimal>,org.jheaps.AddressableHeap<java.math.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.
`SparseEdmondsMaximumCardinalityMatching(Graph<V,E> graph)`	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

Methods in org.jgrapht.alg.matching.blossom.v5 that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	KolmogorovWeightedPerfectMatching.DualSolution.`getGraph()`

Constructors in org.jgrapht.alg.matching.blossom.v5 with parameters of type Graph
Constructor	Description
`DualSolution(Graph<V,E> graph, java.util.Map<java.util.Set<V>,java.lang.Double> dualVariables)`	Constructs a new solution for the dual linear program
`KolmogorovWeightedMatching(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 specified `options`.
`KolmogorovWeightedMatching(Graph<V,E> initialGraph, BlossomVOptions options, ObjectiveSense objectiveSense)`	Constructs a new instance of the algorithm with the specified `options`.
`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 specified `options`.
`KolmogorovWeightedPerfectMatching(Graph<V,E> graph, BlossomVOptions options, ObjectiveSense objectiveSense)`	Constructs a new instance of the algorithm with the specified `options`.
`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

Constructors in org.jgrapht.alg.partition with parameters of type Graph
Constructor	Description
`BipartitePartitioning(Graph<V,E> graph)`	Constructs a new bipartite partitioning.

Uses of Graph in org.jgrapht.alg.planar

Methods in org.jgrapht.alg.planar that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	BoyerMyrvoldPlanarityInspector.`getKuratowskiSubdivision()`	Extracts a Kuratowski subdivision from the `graph`.

Constructors in org.jgrapht.alg.planar with parameters of type Graph
Constructor	Description
`BoyerMyrvoldPlanarityInspector(Graph<V,E> graph)`	Creates new instance of the planarity testing algorithm for the `graph`.

Uses of Graph in org.jgrapht.alg.scoring

Fields in org.jgrapht.alg.scoring declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	ClosenessCentrality.`graph`	Underlying graph

Constructors in org.jgrapht.alg.scoring with parameters of type Graph
Constructor	Description
`AlphaCentrality(Graph<V,E> g)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor, double exogenousFactor)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor, double exogenousFactor, int maxIterations)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor, double exogenousFactor, int maxIterations, double tolerance)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor, java.util.function.ToDoubleFunction<V> exogenousFactorFunction)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor, java.util.function.ToDoubleFunction<V> exogenousFactorFunction, int maxIterations)`	Create and execute an instance of AlphaCentrality.
`AlphaCentrality(Graph<V,E> g, double dampingFactor, java.util.function.ToDoubleFunction<V> exogenousFactorFunction, int maxIterations, double tolerance)`	Create and execute an instance of AlphaCentrality.
`BetweennessCentrality(Graph<V,E> graph)`	Construct a new instance.
`BetweennessCentrality(Graph<V,E> graph, boolean normalize)`	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 instance
`Coreness(Graph<V,E> g)`	Constructor
`HarmonicCentrality(Graph<V,E> graph)`	Construct a new instance.
`HarmonicCentrality(Graph<V,E> graph, boolean incoming, boolean normalize)`	Construct a new instance.
`PageRank(Graph<V,E> graph)`	Create and execute an instance of PageRank.
`PageRank(Graph<V,E> graph, double dampingFactor)`	Create and execute an instance of PageRank.
`PageRank(Graph<V,E> graph, double dampingFactor, int maxIterations)`	Create and execute an instance of PageRank.
`PageRank(Graph<V,E> graph, double dampingFactor, int maxIterations, double tolerance)`	Create and execute an instance of PageRank.

Uses of Graph in org.jgrapht.alg.shortestpath

Fields in org.jgrapht.alg.shortestpath declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	TreeSingleSourcePathsImpl.`g`	The graph
`protected Graph<V,E>`	BaseManyToManyShortestPaths.`graph`
`protected Graph<V,E>`	BaseManyToManyShortestPaths.`graph`
`protected Graph<V,E>`	BaseManyToManyShortestPaths.`graph`
`protected Graph<V,E>`	BaseMultiObjectiveShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	BaseShortestPathAlgorithm.`graph`	The underlying graph.
`protected Graph<V,E>`	ListMultiObjectiveSingleSourcePathsImpl.`graph`	The graph
`protected Graph<V,E>`	ListSingleSourcePathsImpl.`graph`	The graph
`protected Graph<V,E>`	BaseKDisjointShortestPathsAlgorithm.`originalGraph`
`protected Graph<V,E>`	BaseKDisjointShortestPathsAlgorithm.`originalGraph`
`protected Graph<V,E>`	BaseKDisjointShortestPathsAlgorithm.`workingGraph`	Graph on which shortest paths are searched.
`protected Graph<V,E>`	BaseKDisjointShortestPathsAlgorithm.`workingGraph`	Graph on which shortest paths are searched.

Methods in org.jgrapht.alg.shortestpath that return Graph
Modifier and Type	Method	Description
`Graph<ContractionHierarchyPrecomputation.ContractionVertex<V>,ContractionHierarchyPrecomputation.ContractionEdge<E>>`	ContractionHierarchyPrecomputation.ContractionHierarchy.`getContractionGraph()`	Returns contracted graph.
`Graph<V,E>`	ContractionHierarchyPrecomputation.ContractionHierarchy.`getGraph()`	Returns the underlying graph of this contraction hierarchy.
`Graph<V,E>`	ListMultiObjectiveSingleSourcePathsImpl.`getGraph()`
`Graph<V,E>`	ListSingleSourcePathsImpl.`getGraph()`	Returns the graph over which this set of paths is defined.
`Graph<V,E>`	TreeSingleSourcePathsImpl.`getGraph()`	Returns the graph over which this set of paths is defined.

Methods in org.jgrapht.alg.shortestpath with parameters of type Graph
Modifier and Type	Method	Description
`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.
`static <E> GraphPath<java.lang.Integer,E>`	IntVertexDijkstraShortestPath.`findPathBetween(Graph<java.lang.Integer,E> graph, java.lang.Integer source, java.lang.Integer sink)`	Find a path between two vertices.
`<ET> boolean`	ALTAdmissibleHeuristic.`isConsistent(Graph<V,ET> graph)`	Returns true if the heuristic is a consistent or monotone heuristic wrt the provided `graph`.

Constructors in org.jgrapht.alg.shortestpath with parameters of type Graph
Constructor	Description
`AllDirectedPaths(Graph<V,E> graph)`	Create a new instance.
`ALTAdmissibleHeuristic(Graph<V,E> graph, java.util.Set<V> landmarks)`	Constructs a new `AStarAdmissibleHeuristic` using a set of landmarks.
`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, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,V>> heapSupplier)`	Create a new instance of the A* shortest path algorithm.
`BaseBidirectionalShortestPathAlgorithm(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, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.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, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)`	Constructs a new instance for a specified graph.
`BidirectionalDijkstraShortestPath(Graph<V,E> graph, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)`	Constructs a new instance for a specified graph.
`CHManyToManyShortestPaths(Graph<V,E> graph)`	Constructs an instance of the algorithm for a given `graph`.
`ContractionHierarchyBidirectionalDijkstra(Graph<V,E> graph)`	Constructs a new instance of the algorithm for a given `graph`.
`ContractionHierarchyPrecomputation(Graph<V,E> graph)`	Constructs a new instance of the algorithm for a given `graph`.
`ContractionHierarchyPrecomputation(Graph<V,E> graph, int parallelism)`	Constructs a new instance of the algorithm for a given `graph` and `parallelism`.
`ContractionHierarchyPrecomputation(Graph<V,E> graph, int parallelism, java.util.function.Supplier<java.util.Random> randomSupplier)`	Constructs a new instance of the algorithm for a given `graph`, `parallelism` and `randomSupplier`.
`ContractionHierarchyPrecomputation(Graph<V,E> graph, int parallelism, java.util.function.Supplier<java.util.Random> randomSupplier, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,ContractionHierarchyPrecomputation.ContractionVertex<V>>> shortcutsSearchHeapSupplier)`	Constructs a new instance of the algorithm for a given `graph`, `parallelism`, `randomSupplier` and `shortcutsSearchHeapSupplier`.
`ContractionHierarchyPrecomputation(Graph<V,E> graph, java.util.function.Supplier<java.util.Random> randomSupplier)`	Constructs a new instance of the algorithm for a given `graph` and `randomSupplier`.
`DefaultManyToManyShortestPaths(Graph<V,E> graph)`	Constructs a new instance of the algorithm for a given `graph`.
`DefaultManyToManyShortestPaths(Graph<V,E> graph, java.util.function.Function<Graph<V,E>,ShortestPathAlgorithm<V,E>> function)`	Constructs a new instance of the algorithm for a given `graph` and `function`.
`DeltaSteppingShortestPath(Graph<V,E> graph)`	Constructs a new instance of the algorithm for a given graph.
`DeltaSteppingShortestPath(Graph<V,E> graph, double delta)`	Constructs a new instance of the algorithm for a given graph and delta.
`DeltaSteppingShortestPath(Graph<V,E> graph, double delta, int parallelism)`	Constructs a new instance of the algorithm for a given graph, delta, parallelism.
`DeltaSteppingShortestPath(Graph<V,E> graph, int parallelism)`	Constructs a new instance of the algorithm for a given graph and parallelism.
`DijkstraManyToManyShortestPaths(Graph<V,E> graph)`	Constructs an instance of the algorithm for a given `graph`.
`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, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)`	Constructs a new instance of the algorithm for a given graph.
`DijkstraShortestPath(Graph<V,E> graph, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,Pair<V,E>>> heapSupplier)`	Constructs a new instance of the algorithm for a given graph.
`EppsteinKShortestPath(Graph<V,E> graph)`	Constructs the algorithm instance for the given `graph`.
`EppsteinShortestPathIterator(Graph<V,E> graph, V source, V sink)`	Constructs an instance of the algorithm for the given `graph`, `source` and `sink`.
`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<java.lang.Integer,E> graph)`	Constructs a new instance of the algorithm for a given graph.
`IntVertexDijkstraShortestPath(Graph<java.lang.Integer,E> graph, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,java.lang.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.
`KShortestSimplePaths(Graph<V,E> graph)`	Constructs an object to compute ranking shortest paths in a graph.
`KShortestSimplePaths(Graph<V,E> graph, int nMaxHops)`	Constructs an object to calculate ranking shortest paths in a graph.
`KShortestSimplePaths(Graph<V,E> graph, int nMaxHops, PathValidator<V,E> pathValidator)`	Constructs an object to calculate ranking shortest paths in a graph.
`KShortestSimplePaths(Graph<V,E> graph, PathValidator<V,E> pathValidator)`	Constructs an object to compute ranking shortest paths in a graph.
`ListMultiObjectiveSingleSourcePathsImpl(Graph<V,E> graph, V source, java.util.Map<V,java.util.List<GraphPath<V,E>>> paths)`	Construct a new instance.
`ListSingleSourcePathsImpl(Graph<V,E> graph, V source, java.util.Map<V,GraphPath<V,E>> paths)`	Construct a new instance.
`MartinShortestPath(Graph<V,E> graph, java.util.function.Function<E,double[]> edgeWeightFunction)`	Create a new shortest path algorithm
`SuurballeKDisjointShortestPaths(Graph<V,E> graph)`	Creates a new instance of the algorithm.
`TreeMeasurer(Graph<V,E> graph)`	Constructs a new instance of TreeMeasurer.
`TreeSingleSourcePathsImpl(Graph<V,E> g, V source, java.util.Map<V,Pair<java.lang.Double,E>> distanceAndPredecessorMap)`	Construct a new instance.
`YenKShortestPath(Graph<V,E> graph)`	Constructs an instance of the algorithm for the given `graph`.
`YenShortestPathIterator(Graph<V,E> graph, V source, V sink)`	Constructs an instance of the algorithm for given `graph`, `source` and `sink`.
`YenShortestPathIterator(Graph<V,E> graph, V source, V sink, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,GraphPath<V,E>>> heapSupplier)`	Constructs an instance of the algorithm for given `graph`, `source`, `sink` and `heapSupplier`.

Constructor parameters in org.jgrapht.alg.shortestpath with type arguments of type Graph
Constructor	Description
`DefaultManyToManyShortestPaths(Graph<V,E> graph, java.util.function.Function<Graph<V,E>,ShortestPathAlgorithm<V,E>> function)`	Constructs a new instance of the algorithm for a given `graph` and `function`.

Uses of Graph in org.jgrapht.alg.spanning

Fields in org.jgrapht.alg.spanning declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	AbstractCapacitatedMinimumSpanningTree.`graph`	the input graph.

Constructors in org.jgrapht.alg.spanning with parameters of type Graph
Constructor	Description
`AbstractCapacitatedMinimumSpanningTree(Graph<V,E> graph, V root, double capacity, java.util.Map<V,java.lang.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, java.util.Map<V,java.lang.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, java.util.Map<V,java.lang.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, java.util.Map<V,java.lang.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, java.util.Map<V,java.lang.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, java.util.Map<V,java.lang.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

Methods in org.jgrapht.alg.tour with parameters of type Graph
Modifier and Type	Method	Description
`protected void`	HamiltonianCycleAlgorithmBase.`checkGraph(Graph<V,E> graph)`	Checks that graph is undirected, complete, and non-empty
`protected GraphPath<V,E>`	HamiltonianCycleAlgorithmBase.`edgeSetToTour(java.util.Set<E> tour, Graph<V,E> graph)`	Transform from a Set representation to a graph path.
`protected GraphPath<V,E>`	HamiltonianCycleAlgorithmBase.`getSingletonTour(Graph<V,E> graph)`	Creates a tour for a graph with 1 vertex
`GraphPath<V,E>`	ChristofidesThreeHalvesApproxMetricTSP.`getTour(Graph<V,E> graph)`	Computes a $3/2$-approximate tour.
`GraphPath<V,E>`	GreedyHeuristicTSP.`getTour(Graph<V,E> graph)`	Computes a tour using the greedy heuristic.
`GraphPath<V,E>`	HeldKarpTSP.`getTour(Graph<V,E> graph)`	Computes a minimum-cost Hamiltonian tour.
`GraphPath<V,E>`	NearestInsertionHeuristicTSP.`getTour(Graph<V,E> graph)`	Computes a tour using the nearest insertion heuristic.
`GraphPath<V,E>`	NearestNeighborHeuristicTSP.`getTour(Graph<V,E> graph)`	Computes a tour using the nearest neighbour heuristic.
`GraphPath<V,E>`	PalmerHamiltonianCycle.`getTour(Graph<V,E> graph)`	Computes a Hamiltonian tour.
`GraphPath<V,E>`	RandomTourTSP.`getTour(Graph<V,E> graph)`	Computes a tour using the greedy heuristic.
`GraphPath<V,E>`	TwoApproxMetricTSP.`getTour(Graph<V,E> graph)`	Computes a 2-approximate tour.
`GraphPath<V,E>`	TwoOptHeuristicTSP.`getTour(Graph<V,E> graph)`	Computes a 2-approximate tour.
`protected GraphPath<V,E>`	HamiltonianCycleAlgorithmBase.`vertexListToTour(java.util.List<V> tour, Graph<V,E> graph)`	Transform from a List representation to a graph path.

Uses of Graph in org.jgrapht.alg.transform

Methods in org.jgrapht.alg.transform with parameters of type Graph
Modifier and Type	Method	Description
`void`	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, java.util.function.BiFunction<E,E,java.lang.Double> weightFunction)`	Constructs a line graph of the input graph.

Constructors in org.jgrapht.alg.transform with parameters of type Graph
Constructor	Description
`LineGraphConverter(Graph<V,E> graph)`	Line Graph Converter

Uses of Graph in org.jgrapht.alg.util

Constructors in org.jgrapht.alg.util with parameters of type Graph
Constructor	Description
`NeighborCache(Graph<V,E> graph)`	Constructor
`VertexDegreeComparator(Graph<V,E> g)`	Creates a comparator for comparing the degrees of vertices in the specified graph.
`VertexDegreeComparator(Graph<V,E> g, VertexDegreeComparator.Order order)`	Creates a comparator for comparing the degrees of vertices in the specified graph.

Uses of Graph in org.jgrapht.alg.vertexcover

Constructors in org.jgrapht.alg.vertexcover with parameters of type Graph
Constructor	Description
`BarYehudaEvenTwoApproxVCImpl(Graph<V,E> graph)`	Constructs a new BarYehudaEvenTwoApproxVCImpl instance where all vertices have uniform weights.
`BarYehudaEvenTwoApproxVCImpl(Graph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)`	Constructs a new BarYehudaEvenTwoApproxVCImpl instance
`ClarksonTwoApproxVCImpl(Graph<V,E> graph)`	Constructs a new ClarksonTwoApproxVCImpl instance where all vertices have uniform weights.
`ClarksonTwoApproxVCImpl(Graph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)`	Constructs a new ClarksonTwoApproxVCImpl instance
`EdgeBasedTwoApproxVCImpl(Graph<V,E> graph)`	Constructs a new EdgeBasedTwoApproxVCImpl instance
`GreedyVCImpl(Graph<V,E> graph)`	Constructs a new GreedyVCImpl instance where all vertices have uniform weights.
`GreedyVCImpl(Graph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)`	Constructs a new GreedyVCImpl instance
`RecursiveExactVCImpl(Graph<V,E> graph)`	Constructs a new GreedyVCImpl instance
`RecursiveExactVCImpl(Graph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)`	Constructs a new GreedyVCImpl instance

Uses of Graph in org.jgrapht.generate

Methods in org.jgrapht.generate that return Graph
Modifier and Type	Method	Description
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`bidiakisCubeGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`blanusaFirstSnarkGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`blanusaSecondSnarkGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`brinkmannGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`buckyBallGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`bullGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`butterflyGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`chvatalGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`clawGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`clebschGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`coxeterGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`desarguesGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`diamondGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`dodecahedronGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`doubleStarSnarkGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`doyleGraph()`	Generate the Doyle Graph
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`dürerGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`ellinghamHorton54Graph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`ellinghamHorton78Graph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`erreraGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`folkmanGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`franklinGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`fruchtGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`generalizedPetersenGraph(int n, int k)`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`goldnerHararyGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`gossetGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`grötzschGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`heawoodGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`herschelGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`hoffmanGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`kittellGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`klein3RegularGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`klein7RegularGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`krackhardtKiteGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`möbiusKantorGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`moserSpindleGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`nauruGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`pappusGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`petersenGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`poussinGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`schläfliGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`thomsenGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`tietzeGraph()`
`static Graph<java.lang.Integer,DefaultEdge>`	NamedGraphGenerator.`tutteGraph()`

Methods in org.jgrapht.generate with parameters of type Graph
Modifier and Type	Method	Description
`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.
`void`	NamedGraphGenerator.`generateGoldnerHararyGraph(Graph<V,E> targetGraph)`	Generates the Goldner-Harary Graph.
`void`	NamedGraphGenerator.`generateGossetGraph(Graph<V,E> targetGraph)`	Generates the Gosset Graph.
`void`	BarabasiAlbertForestGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates an instance.
`void`	BarabasiAlbertGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates an instance.
`void`	ComplementGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`
`void`	CompleteBipartiteGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Construct a complete bipartite graph
`void`	CompleteGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	DirectedScaleFreeGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates an instance of the `Graph`.
`void`	EmptyGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	GeneralizedPetersenGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,java.util.List<V>> resultMap)`	Generates the Generalized Petersen Graph
`void`	GnmRandomBipartiteGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a random bipartite graph.
`void`	GnmRandomGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a random graph based on the $G(n, M)$ model
`void`	GnpRandomBipartiteGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a random bipartite graph.
`void`	GnpRandomGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a random graph based on the $G(n, p)$ model.
`default void`	GraphGenerator.`generateGraph(Graph<V,E> target)`	Generate a graph structure.
`void`	GraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,T> resultMap)`	Generate a graph structure.
`void`	GridGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	HyperCubeGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`
`void`	KleinbergSmallWorldGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a small-world graph.
`void`	LinearGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	LinearizedChordDiagramGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates an instance.
`void`	PlantedPartitionGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate an $l$-planted partition graph.
`void`	PruferTreeGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a tree.
`void`	RandomRegularGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a random regular graph.
`void`	RingGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	ScaleFreeGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates scale-free network with `size` passed to the constructor.
`void`	SimpleWeightedBipartiteGraphMatrixGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	SimpleWeightedGraphMatrixGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`
`void`	StarGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a star graph with the designated order from the constructor
`void`	WattsStrogatzGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generates a small-world graph based on the Watts-Strogatz model.
`void`	WheelGraphGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`	Generate a graph structure.
`void`	WindmillGraphsGenerator.`generateGraph(Graph<V,E> target, java.util.Map<java.lang.String,V> resultMap)`
`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.
`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.
`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.

Constructors in org.jgrapht.generate with parameters of type Graph
Constructor	Description
`ComplementGraphGenerator(Graph<V,E> graph)`	Complement Graph Generator
`ComplementGraphGenerator(Graph<V,E> graph, boolean generateSelfLoops)`	Complement Graph Generator.

Uses of Graph in org.jgrapht.graph

Classes in org.jgrapht.graph that implement Graph
Modifier and Type	Class	Description
`class`	`AbstractBaseGraph<V,E>`	The most general implementation of the `Graph` interface.
`class`	`AbstractGraph<V,E>`	A skeletal implementation of the `Graph` 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`	`DefaultDirectedWeightedGraph<V,E>`	The default implementation of a directed weighted graph.
`class`	`DefaultListenableGraph<V,E>`	A graph backed by the the graph specified at the constructor, which can be listened by `GraphListener` s and by `VertexSetListener` s.
`class`	`DefaultUndirectedGraph<V,E>`	The default implementation of an undirected graph.
`class`	`DefaultUndirectedWeightedGraph<V,E>`	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`	`DirectedWeightedMultigraph<V,E>`	A directed weighted multigraph.
`class`	`DirectedWeightedPseudograph<V,E>`	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`	`SimpleDirectedWeightedGraph<V,E>`	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 Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	AsSubgraph.`base`
`protected Graph<V,E>`	MaskSubgraph.`base`
`protected Graph<V,E>`	GraphWalk.`graph`

Methods in org.jgrapht.graph that return Graph
Modifier and Type	Method	Description
`protected Graph<V,E>`	GraphDelegator.`getDelegate()`	Return the backing graph (the delegate).
`Graph<V,E>`	GraphWalk.`getGraph()`

Methods in org.jgrapht.graph that return types with arguments of type Graph
Modifier and Type	Method	Description
`java.util.function.BiFunction<Graph<V,E>,GraphType,Specifics<V,E>>`	DefaultGraphSpecificsStrategy.`getSpecificsFactory()`
`java.util.function.BiFunction<Graph<V,E>,GraphType,Specifics<V,E>>`	FastLookupGraphSpecificsStrategy.`getSpecificsFactory()`
`java.util.function.BiFunction<Graph<V,E>,GraphType,Specifics<V,E>>`	GraphSpecificsStrategy.`getSpecificsFactory()`	Get a function which creates the specifics.

Methods in org.jgrapht.graph with parameters of type Graph
Modifier and Type	Method	Description
`static <V,E> GraphWalk<V,E>`	GraphWalk.`emptyWalk(Graph<V,E> graph)`	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 Graph
Constructor	Description
`AsGraphUnion(Graph<V,E> g1, Graph<V,E> g2)`	Construct 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.
`AsSubgraph(Graph<V,E> base, java.util.Set<? extends V> vertexSubset)`	Creates a new induced subgraph.
`AsSubgraph(Graph<V,E> base, java.util.Set<? extends V> vertexSubset, java.util.Set<? extends E> edgeSubset)`	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, java.util.function.Function<E,java.lang.Double> weightFunction, boolean cacheWeights, boolean writeWeightsThrough)`	Constructor for AsWeightedGraph which uses a weight function to compute edge weights.
`AsWeightedGraph(Graph<V,E> graph, java.util.Map<E,java.lang.Double> weights)`	Constructor for AsWeightedGraph where the weights are provided through a map.
`AsWeightedGraph(Graph<V,E> graph, java.util.Map<E,java.lang.Double> weights, boolean writeWeightsThrough)`	Constructor for AsWeightedGraph which allows weight write propagation to be requested explicitly.
`DefaultGraphMapping(java.util.Map<V,V> g1ToG2, java.util.Map<V,V> g2ToG1, Graph<V,E> g1, Graph<V,E> g2)`	The maps themselves are used.
`DefaultListenableGraph(Graph<V,E> g)`	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)`	Constructor
`GraphDelegator(Graph<V,E> graph, java.util.function.Supplier<V> vertexSupplier, java.util.function.Supplier<E> edgeSupplier)`
`GraphWalk(Graph<V,E> graph, java.util.List<V> vertexList, double weight)`	Creates a walk defined by a sequence of vertices.
`GraphWalk(Graph<V,E> graph, V startVertex, V endVertex, java.util.List<E> edgeList, double weight)`	Creates a walk defined by a sequence of edges.
`GraphWalk(Graph<V,E> graph, V startVertex, V endVertex, java.util.List<V> vertexList, java.util.List<E> edgeList, double weight)`	Creates a walk defined by both a sequence of edges and a sequence of vertices.
`MaskSubgraph(Graph<V,E> base, java.util.function.Predicate<V> vertexMask, java.util.function.Predicate<E> edgeMask)`	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 Graph
Modifier and Type	Class	Description
`class`	`AbstractGraphBuilder<V,E,G extends Graph<V,E>,B extends AbstractGraphBuilder<V,E,G,B>>`	Base class for builders of `Graph`
`class`	`GraphBuilder<V,E,G extends Graph<V,E>>`	A builder class for `Graph`.

Fields in org.jgrapht.graph.builder declared as Graph
Modifier and Type	Field	Description
`protected G`	AbstractGraphBuilder.`graph`

Methods in org.jgrapht.graph.builder that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	AbstractGraphBuilder.`buildAsUnmodifiable()`	Build an unmodifiable version graph.
`Graph<V,E>`	GraphTypeBuilder.`buildGraph()`	Build the actual graph.

Methods in org.jgrapht.graph.builder that return types with arguments of type Graph
Modifier and Type	Method	Description
`GraphBuilder<V,E,Graph<V,E>>`	GraphTypeBuilder.`buildGraphBuilder()`	Build the graph and acquire a `GraphBuilder` in order to add vertices and edges.

Methods in org.jgrapht.graph.builder with parameters of type Graph
Modifier and Type	Method	Description
`B`	AbstractGraphBuilder.`addGraph(Graph<? extends V,? extends E> sourceGraph)`	Adds all the vertices and all the edges of the `sourceGraph` to the graph being built.
`static <V,E> GraphTypeBuilder<V,E>`	GraphTypeBuilder.`forGraph(Graph<V,E> graph)`	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 Graph
Modifier and Type	Class	Description
`class`	`AsSynchronizedGraph<V,E>`	Create a synchronized (thread-safe) Graph backed by the specified Graph.

Methods in org.jgrapht.graph.concurrent with parameters of type Graph
Modifier and Type	Method	Description
`AsSynchronizedGraph<V,E>`	AsSynchronizedGraph.Builder.`build(Graph<V,E> graph)`	Build the AsSynchronizedGraph.

Constructors in org.jgrapht.graph.concurrent with parameters of type Graph
Constructor	Description
`AsSynchronizedGraph(Graph<V,E> g)`	Constructor for AsSynchronizedGraph with default settings (cache disabled, non-fair mode, and copyless mode disabled).

Uses of Graph in org.jgrapht.graph.specifics

Fields in org.jgrapht.graph.specifics declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	DirectedSpecifics.`graph`
`protected Graph<V,E>`	UndirectedSpecifics.`graph`

Constructors in org.jgrapht.graph.specifics with parameters of type Graph
Constructor	Description
`DirectedSpecifics(Graph<V,E> graph, java.util.Map<V,DirectedEdgeContainer<V,E>> vertexMap, EdgeSetFactory<V,E> edgeSetFactory)`	Construct a new directed specifics.
`FastLookupDirectedSpecifics(Graph<V,E> graph, java.util.Map<V,DirectedEdgeContainer<V,E>> vertexMap, java.util.Map<Pair<V,V>,java.util.Set<E>> touchingVerticesToEdgeMap, EdgeSetFactory<V,E> edgeSetFactory)`	Construct a new fast lookup directed specifics.
`FastLookupUndirectedSpecifics(Graph<V,E> graph, java.util.Map<V,UndirectedEdgeContainer<V,E>> vertexMap, java.util.Map<Pair<V,V>,java.util.Set<E>> touchingVerticesToEdgeMap, EdgeSetFactory<V,E> edgeSetFactory)`	Construct a new fast lookup undirected specifics.
`UndirectedSpecifics(Graph<V,E> graph, java.util.Map<V,UndirectedEdgeContainer<V,E>> vertexMap, EdgeSetFactory<V,E> edgeSetFactory)`	Construct a new undirected specifics.

Uses of Graph in org.jgrapht.traverse

Fields in org.jgrapht.traverse declared as Graph
Modifier and Type	Field	Description
`protected Graph<V,E>`	AbstractGraphIterator.`graph`

Methods in org.jgrapht.traverse that return Graph
Modifier and Type	Method	Description
`Graph<V,E>`	AbstractGraphIterator.`getGraph()`	Get the graph being traversed.

Constructors in org.jgrapht.traverse with parameters of type Graph
Constructor	Description
`AbstractGraphIterator(Graph<V,E> graph)`	Create a new iterator
`BreadthFirstIterator(Graph<V,E> g)`	Creates a new breadth-first iterator for the specified graph.
`BreadthFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices)`	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.
`ClosestFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices)`	Creates a new closest-first iterator for the specified graph.
`ClosestFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices, double radius)`	Creates a new radius-bounded closest-first iterator for the specified graph.
`ClosestFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices, double radius, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,org.jgrapht.traverse.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, java.util.function.Supplier<org.jheaps.AddressableHeap<java.lang.Double,org.jgrapht.traverse.ClosestFirstIterator.QueueEntry<V,E>>> heapSupplier)`	Creates a new radius-bounded closest-first iterator for the specified graph.
`CrossComponentIterator(Graph<V,E> g)`	Creates a new iterator for the specified graph.
`CrossComponentIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices)`	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)`	Constructor
`DepthFirstIterator(Graph<V,E> g)`	Creates a new depth-first iterator for the specified graph.
`DepthFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices)`	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 for `graph`.
`MaximumCardinalityIterator(Graph<V,E> graph)`	Creates a maximum cardinality iterator for the `graph`.
`RandomWalkIterator(Graph<V,E> graph)`	Creates a new iterator for the specified graph.
`RandomWalkIterator(Graph<V,E> graph, V startVertex)`	Creates a new iterator for the specified graph.
`RandomWalkIterator(Graph<V,E> graph, V startVertex, boolean isWeighted)`	Creates a new iterator for the specified graph.
`RandomWalkIterator(Graph<V,E> graph, V startVertex, boolean isWeighted, long maxSteps)`	Creates a new iterator for the specified graph.
`RandomWalkIterator(Graph<V,E> graph, V startVertex, boolean isWeighted, long maxSteps, java.util.Random rng)`	Creates a new iterator for the specified graph.
`TopologicalOrderIterator(Graph<V,E> graph)`	Construct a topological order iterator.
`TopologicalOrderIterator(Graph<V,E> graph, java.util.Comparator<V> comparator)`	Construct a topological order iterator.

Uses of Interfaceorg.jgrapht.Graph

Uses of Graph in org.jgrapht

Uses of Graph in org.jgrapht.alg

Uses of Graph in org.jgrapht.alg.clique

Uses of Graph in org.jgrapht.alg.clustering

Uses of Graph in org.jgrapht.alg.color

Uses of Graph in org.jgrapht.alg.connectivity

Uses of Graph in org.jgrapht.alg.cycle

Uses of Graph in org.jgrapht.alg.decomposition

Uses of Graph in org.jgrapht.alg.densesubgraph

Uses of Graph in org.jgrapht.alg.drawing

Uses of Graph in org.jgrapht.alg.flow

Uses of Graph in org.jgrapht.alg.flow.mincost

Uses of Graph in org.jgrapht.alg.independentset

Uses of Graph in org.jgrapht.alg.interfaces

Uses of Graph in org.jgrapht.alg.isomorphism

Uses of Graph in org.jgrapht.alg.lca

Uses of Graph in org.jgrapht.alg.matching

Uses of Graph in org.jgrapht.alg.matching.blossom.v5

Uses of Graph in org.jgrapht.alg.partition

Uses of Graph in org.jgrapht.alg.planar

Uses of Graph in org.jgrapht.alg.scoring

Uses of Graph in org.jgrapht.alg.shortestpath

Uses of Graph in org.jgrapht.alg.spanning

Uses of Graph in org.jgrapht.alg.tour

Uses of Graph in org.jgrapht.alg.transform

Uses of Graph in org.jgrapht.alg.util

Uses of Graph in org.jgrapht.alg.vertexcover

Uses of Graph in org.jgrapht.generate

Uses of Graph in org.jgrapht.graph

Uses of Graph in org.jgrapht.graph.builder

Uses of Graph in org.jgrapht.graph.concurrent

Uses of Graph in org.jgrapht.graph.specifics

Uses of Graph in org.jgrapht.traverse

Uses of Interface
org.jgrapht.Graph