Uses of Interface
org.jgrapht.Graph

Packages that use Graph

Package	Description
org.jgrapht	The front-end API's interfaces and classes, including Graph, DirectedGraph and UndirectedGraph.
org.jgrapht.alg	Algorithms provided with JGraphT.
org.jgrapht.alg.cycle	Algorithms for enumeration of simple cycles in graphs.
org.jgrapht.alg.flow	Flow related algorithms.
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.isomorphism	Algorithms for (sub)graph isomorphism.
org.jgrapht.alg.matching	Algorithms for the computation of matchings.
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.experimental	Experimental work or work-in-progress.
org.jgrapht.experimental.alg	Experimental package with algorithms.
org.jgrapht.experimental.alg.color	Experimental package with graph coloring algorithms.
org.jgrapht.experimental.dag	Experimental package with directed acyclic graphs.
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.traverse	Graph traversal means.

Uses of Graph in org.jgrapht

Subinterfaces of Graph in org.jgrapht

Modifier and Type	Interface	Description
interface	DirectedGraph<V,E>	A graph whose all edges are directed.
interface	ListenableGraph<V,E>	A graph that supports listeners on structural change events.
interface	UndirectedGraph<V,E>	A graph whose all edges are undirected.
interface	WeightedGraph<V,E>	An interface for a graph whose edges have non-uniform weights.

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.

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> V	Graphs.getOppositeVertex(Graph<V,E> g, E e, V v)	Gets the vertex opposite another vertex across an edge.
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.isComplete(Graph<V,E> graph)	Test whether a graph is complete.
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.isSimple(Graph<V,E> graph)	Check if a graph is simple.
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> boolean	Graphs.testIncidence(Graph<V,E> g, E e, V v)	Tests whether an edge is incident to a vertex.
static <V,E> UndirectedGraph<V,E>	Graphs.undirectedGraph(Graph<V,E> g)	Returns an undirected view of the specified graph.

Uses of Graph in org.jgrapht.alg

Classes in org.jgrapht.alg that implement Graph

Modifier and Type	Class	Description
class	BlockCutpointGraph<V,E>	Definition of a block of a graph in MathWorld. Definition and lemma taken from the article Structure-Based Resilience Metrics for Service-Oriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph.

Fields in org.jgrapht.alg declared as Graph

Modifier and Type	Field	Description
private Graph<V,E>	TarjanLowestCommonAncestor.g
protected Graph<V,E>	AbstractPathElementList.graph	Deprecated.
private Graph<V,E>	AStarShortestPath.graph	Deprecated.
protected Graph<V,E>	BellmanFordIterator.graph	Deprecated. Graph on which shortest paths are searched.
protected Graph<V,E>	BellmanFordShortestPath.graph	Deprecated. Graph on which shortest paths are searched.
(package private) Graph<V,E>	BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier.graph
private Graph<V,E>	BidirectionalDijkstraShortestPath.AlgorithmDetails.UndirectedSpecifics.graph
private Graph<V,E>	BronKerboschCliqueFinder.graph
private Graph<V,E>	ConnectivityInspector.graph
private Graph<V,E>	FloydWarshallShortestPaths.graph	Deprecated.
private Graph<V,E>	KShortestPaths.graph	Deprecated. Graph on which shortest paths are searched.
private Graph<V,E>	KShortestPathsIterator.graph	Deprecated. Graph on which shortest paths are searched.
private Graph<V,E>	NeighborIndex.graph

Methods in org.jgrapht.alg that return Graph

Modifier and Type	Method	Description
Graph<V,E>	FloydWarshallShortestPaths.getGraph()	Deprecated.
Graph<V,E>	KShortestPaths.PathWrapper.getGraph()

Methods in org.jgrapht.alg with parameters of type Graph

Modifier and Type	Method	Description
private void	BellmanFordIterator.assertBellmanFordIterator(Graph<V,E> graph, V startVertex)	Deprecated.
private void	KShortestPaths.assertKShortestPathsFinder(Graph<V,E> graph, V startVertex, int nPaths, int nMaxHops)	Deprecated.
private void	KShortestPathsIterator.assertKShortestPathsIterator(Graph<V,E> graph, V startVertex)	Deprecated.
private void	DijkstraShortestPath.createEdgeList(Graph<V,E> graph, ClosestFirstIterator<V,E> iter, V startVertex, V endVertex)	Deprecated.
static <V,E> java.util.List<E>	BellmanFordShortestPath.findPathBetween(Graph<V,E> graph, V startVertex, V endVertex)	Deprecated. Convenience method to find the shortest path via a single static method call.
static <V,E> java.util.List<E>	BidirectionalDijkstraShortestPath.findPathBetween(Graph<V,E> graph, V startVertex, V endVertex)	Deprecated. Convenience method to find the shortest path via a single static method call.
static <V,E> java.util.List<E>	DijkstraShortestPath.findPathBetween(Graph<V,E> graph, V startVertex, V endVertex)	Deprecated. Convenience method to find the shortest path via a single static method call.

Constructors in org.jgrapht.alg with parameters of type Graph

Constructor	Description
AbstractPathElement(Graph<V,E> graph, AbstractPathElement<V,E> pathElement, E edge)	Deprecated. Creates a path element by concatenation of an edge to a path element.
AbstractPathElementList(Graph<V,E> graph, int maxSize, AbstractPathElementList<V,E,T> elementList, E edge)	Deprecated. Creates paths obtained by concatenating the specified edge to the specified paths.
AbstractPathElementList(Graph<V,E> graph, int maxSize, T pathElement)	Deprecated. Creates a list with an empty path.
AbstractPathElementList(Graph<V,E> graph, int maxSize, V vertex)	Deprecated. Creates an empty list.
AlgorithmDetails(Graph<V,E> graph, V source, V target, double radius)
AStarShortestPath(Graph<V,E> graph)	Deprecated. Create a new instance of the A* shortest path algorithm.
BellmanFordIterator(Graph<V,E> graph, V startVertex, double epsilon)	Deprecated.
BellmanFordPathElement(Graph<V,E> graph, BellmanFordPathElement<V,E> pathElement, E edge, double cost, double epsilon)	Deprecated. Creates a path element by concatenation of an edge to a path element.
BellmanFordShortestPath(Graph<V,E> graph, V startVertex)	Deprecated. Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V,E> graph, V startVertex, int nMaxHops)	Deprecated. Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V,E> graph, V startVertex, int nMaxHops, double epsilon)	Deprecated. Creates an object to calculate shortest paths between the start vertex and others vertices using the Bellman-Ford algorithm.
BidirectionalDijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex)	Deprecated. Creates the instance and executes the bidirectional Dijkstra shortest path algorithm.
BidirectionalDijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex, double radius)	Deprecated. Creates the instance and executes the bidirectional Dijkstra shortest path algorithm.
BronKerboschCliqueFinder(Graph<V,E> graph)	Creates a new clique finder.
DijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex)	Deprecated. Creates and executes a new DijkstraShortestPath algorithm instance.
DijkstraShortestPath(Graph<V,E> graph, V startVertex, V endVertex, double radius)	Deprecated. Creates and executes a new DijkstraShortestPath algorithm instance.
FloydWarshallShortestPaths(Graph<V,E> graph)	Deprecated. Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.
KruskalMinimumSpanningTree(Graph<V,E> graph)	Deprecated. Creates and executes a new KruskalMinimumSpanningTree algorithm instance.
KShortestPaths(Graph<V,E> graph, V startVertex, int k)	Deprecated. Creates an object to compute ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V,E> graph, V startVertex, int nPaths, int nMaxHops)	Deprecated. Creates an object to calculate ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V,E> graph, V startVertex, int nPaths, int nMaxHops, PathValidator<V,E> pathValidator)	Deprecated. Creates an object to calculate ranking shortest paths between the start vertex and others vertices.
KShortestPaths(Graph<V,E> graph, V startVertex, int k, PathValidator<V,E> pathValidator)	Deprecated. Creates an object to compute ranking shortest paths between the start vertex and others vertices.
KShortestPathsIterator(Graph<V,E> graph, V startVertex, V endVertex, int maxSize)	Deprecated.
KShortestPathsIterator(Graph<V,E> graph, V startVertex, V endVertex, int maxSize, PathValidator<V,E> pathValidator)	Deprecated.
NeighborIndex(Graph<V,E> g)	Creates a neighbor index for the specified undirected graph.
PrimMinimumSpanningTree(Graph<V,E> g)	Deprecated. Create and execute a new instance of Prim's algorithm.
RankingPathElement(Graph<V,E> graph, RankingPathElement<V,E> pathElement, E edge, double weight)	Deprecated. Creates a path element by concatenation of an edge to a path element.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElement<V,E> pathElement)	Deprecated. Creates a list with an empty path.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElement<V,E> pathElement, PathValidator<V,E> pathValidator)	Deprecated. Creates a list with an empty path.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElementList<V,E> elementList, E edge)	Deprecated. Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElementList<V,E> elementList, E edge, V guardVertexToNotDisconnect)	Deprecated. Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElementList<V,E> elementList, E edge, V guardVertexToNotDisconnect, PathValidator<V,E> pathValidator)	Deprecated. Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V,E> graph, int maxSize, V vertex)	Deprecated. Creates an empty list.
RankingPathElementList(Graph<V,E> graph, int maxSize, V vertex, PathValidator<V,E> pathValidator)	Deprecated. Creates an empty list.
SearchFrontier(Graph<V,E> graph)
TarjanLowestCommonAncestor(Graph<V,E> g)	Create an instance with a reference to the graph that we will find LCAs for
UndirectedSpecifics(Graph<V,E> g)

Uses of Graph in org.jgrapht.alg.cycle

Fields in org.jgrapht.alg.cycle declared as Graph

Modifier and Type	Field	Description
private Graph<V,E>	HierholzerEulerianCycle.g

Methods in org.jgrapht.alg.cycle with parameters of type Graph

Modifier and Type	Method	Description
GraphPath<V,E>	HierholzerEulerianCycle.getEulerianCycle(Graph<V,E> g)	Compute an Eulerian cycle of a graph.
private 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	HierholzerEulerianCycle.isEulerian(Graph<V,E> graph)	Test whether a graph is Eulerian.

Uses of Graph in org.jgrapht.alg.flow

Fields in org.jgrapht.alg.flow declared as Graph

Modifier and Type	Field	Description
private Graph<V,E>	GusfieldGomoryHuCutTree.network
protected Graph<V,E>	MaximumFlowAlgorithmBase.network
private Graph<V,E>	PadbergRaoOddMinimumCutset.network

Constructors in org.jgrapht.alg.flow with parameters of type Graph

Constructor	Description
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.interfaces

Methods in org.jgrapht.alg.interfaces that return Graph

Modifier and Type	Method	Description
Graph<V,E>	ShortestPathAlgorithm.SingleSourcePaths.getGraph()	Returns the graph over which this set of paths is defined.

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.

Uses of Graph in org.jgrapht.alg.isomorphism

Fields in org.jgrapht.alg.isomorphism declared as Graph

Modifier and Type	Field	Description
private Graph<V2,?>	GraphOrdering.GeneralVertexDegreeComparator.graph
private Graph<V,E>	GraphOrdering.graph
protected Graph<V,E>	VF2AbstractIsomorphismInspector.graph1
protected Graph<V,E>	VF2AbstractIsomorphismInspector.graph2

Methods in org.jgrapht.alg.isomorphism that return Graph

Modifier and Type	Method	Description
Graph<V,E>	GraphOrdering.getGraph()

Constructors in org.jgrapht.alg.isomorphism with parameters of type Graph

Constructor	Description
GeneralVertexDegreeComparator(Graph<V2,?> graph)
GraphOrdering(Graph<V,E> graph)
GraphOrdering(Graph<V,E> graph, boolean orderByDegree, boolean cacheEdges)
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 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, boolean cacheEdges)	Construct a new VF2 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 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 isomorphism inspector.

Uses of Graph in org.jgrapht.alg.matching

Fields in org.jgrapht.alg.matching declared as Graph

Modifier and Type	Field	Description
private Graph<V,E>	GreedyWeightedMatching.graph
private Graph<V,E>	KuhnMunkresMinimalWeightBipartitePerfectMatching.graph
private Graph<V,E>	PathGrowingWeightedMatching.graph

Methods in org.jgrapht.alg.matching with parameters of type Graph

Modifier and Type	Method	Description
Pair<java.lang.Double,java.util.Set<E>>	PathGrowingWeightedMatching.DynamicProgrammingPathSolver.getMaximumWeightMatching(Graph<V,E> g, java.util.LinkedList<E> path)	Find the maximum weight matching of a path using dynamic programming.

Constructors in org.jgrapht.alg.matching with parameters of type Graph

Constructor	Description
EdmondsBlossomShrinking(Graph<V,E> graph)	Construct an instance of the Edmonds blossom shrinking algorithm.
GreedyWeightedMatching(Graph<V,E> graph)	Create and execute a new instance of the greedy maximum weight matching algorithm.
GreedyWeightedMatching(Graph<V,E> graph, double epsilon)	Create and execute a new instance of the greedy maximum weight matching algorithm.
HopcroftKarpBipartiteMatching(Graph<V,E> graph, java.util.Set<V> partition1, java.util.Set<V> partition2)	Construct a new instance of the Hopcroft-Karp algorithm for the computation of maximum matchings in bipartite graphs.
KuhnMunkresMatrixImplementation(Graph<V,E> G, java.util.List<? extends V> S, java.util.List<? extends V> T)	Construct new instance
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)	Construct a new instance of the algorithm.
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.

Uses of Graph in org.jgrapht.alg.scoring

Fields in org.jgrapht.alg.scoring declared as Graph

Modifier and Type	Field	Description
private Graph<V,E>	PageRank.g
private Graph<V,E>	PageRank.UndirectedSpecifics.graph

Constructors in org.jgrapht.alg.scoring with parameters of type Graph

Constructor	Description
PageRank(Graph<V,E> g)	Create and execute an instance of PageRank.
PageRank(Graph<V,E> g, double dampingFactor)	Create and execute an instance of PageRank.
PageRank(Graph<V,E> g, double dampingFactor, int maxIterations)	Create and execute an instance of PageRank.
PageRank(Graph<V,E> g, double dampingFactor, int maxIterations, double tolerance)	Create and execute an instance of PageRank.
UndirectedSpecifics(Graph<V,E> g)

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>	AbstractPathElementList.graph
private Graph<V,E>	ALTAdmissibleHeuristic.graph
protected Graph<V,E>	BaseShortestPathAlgorithm.graph
protected Graph<V,E>	BellmanFordIterator.graph	Graph on which shortest paths are searched.
(package private) Graph<V,E>	BidirectionalDijkstraShortestPath.SearchFrontier.graph
private Graph<V,E>	BidirectionalDijkstraShortestPath.UndirectedSpecifics.graph
private Graph<V,E>	DijkstraClosestFirstIterator.graph
private Graph<V,E>	DijkstraClosestFirstIterator.UndirectedSpecifics.graph
private Graph<V,E>	KShortestPaths.graph	Graph on which shortest paths are searched.
private Graph<V,E>	KShortestPathsIterator.graph	Graph on which shortest paths are searched.
protected Graph<V,E>	ListSingleSourcePathsImpl.graph	The graph

Methods in org.jgrapht.alg.shortestpath that return Graph

Modifier and Type	Method	Description
Graph<V,E>	BellmanFordShortestPath.PathElementSingleSourcePaths.getGraph()
Graph<V,E>	FloydWarshallShortestPaths.FloydWarshallSingleSourcePaths.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
private void	BellmanFordIterator.assertBellmanFordIterator(Graph<V,E> graph, V startVertex)
private void	KShortestPathsIterator.assertKShortestPathsIterator(Graph<V,E> graph, V startVertex)
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>	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.

Constructors in org.jgrapht.alg.shortestpath with parameters of type Graph

Constructor	Description
AbstractPathElement(Graph<V,E> graph, AbstractPathElement<V,E> pathElement, E edge)	Creates a path element by concatenation of an edge to a path element.
AbstractPathElementList(Graph<V,E> graph, int maxSize, AbstractPathElementList<V,E,T> elementList, E edge)	Creates paths obtained by concatenating the specified edge to the specified paths.
AbstractPathElementList(Graph<V,E> graph, int maxSize, T pathElement)	Creates a list with an empty path.
AbstractPathElementList(Graph<V,E> graph, int maxSize, V vertex)	Creates an empty list.
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.
BaseShortestPathAlgorithm(Graph<V,E> graph)	Constructs a new instance of the algorithm for a given graph.
BellmanFordIterator(Graph<V,E> graph, V startVertex, double epsilon)
BellmanFordPathElement(Graph<V,E> graph, BellmanFordPathElement<V,E> pathElement, E edge, double cost, double epsilon)	Creates a path element by concatenation of an edge to a path element.
BellmanFordShortestPath(Graph<V,E> graph)	Construct a new instance of the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V,E> graph, int nMaxHops)	Construct a new instance of the Bellman-Ford algorithm.
BellmanFordShortestPath(Graph<V,E> graph, int nMaxHops, double epsilon)	Construct a new instance of the Bellman-Ford algorithm.
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.
DijkstraClosestFirstIterator(Graph<V,E> graph, V source)	Creates a new iterator for the specified graph.
DijkstraClosestFirstIterator(Graph<V,E> graph, V source, double radius)	Creates a new radius-bounded iterator for the specified graph.
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.
FloydWarshallShortestPaths(Graph<V,E> graph)	Create a new instance of the Floyd-Warshall all-pairs shortest path algorithm.
KShortestPaths(Graph<V,E> graph, int k)	Constructs an object to compute ranking shortest paths in a graph.
KShortestPaths(Graph<V,E> graph, int k, int nMaxHops)	Constructs an object to calculate ranking shortest paths in a graph.
KShortestPaths(Graph<V,E> graph, int k, int nMaxHops, PathValidator<V,E> pathValidator)	Constructs an object to calculate ranking shortest paths in a graph.
KShortestPaths(Graph<V,E> graph, int k, PathValidator<V,E> pathValidator)	Constructs an object to compute ranking shortest paths in a graph.
KShortestPathsIterator(Graph<V,E> graph, V startVertex, V endVertex, int maxSize)
KShortestPathsIterator(Graph<V,E> graph, V startVertex, V endVertex, int maxSize, PathValidator<V,E> pathValidator)
ListSingleSourcePathsImpl(Graph<V,E> graph, V source, java.util.Map<V,GraphPath<V,E>> paths)	Construct a new instance.
RankingPathElement(Graph<V,E> graph, RankingPathElement<V,E> pathElement, E edge, double weight)	Creates a path element by concatenation of an edge to a path element.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElement<V,E> pathElement)	Creates a list with an empty path.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElement<V,E> pathElement, PathValidator<V,E> pathValidator)	Creates a list with an empty path.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElementList<V,E> elementList, E edge)	Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElementList<V,E> elementList, E edge, V guardVertexToNotDisconnect)	Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V,E> graph, int maxSize, RankingPathElementList<V,E> elementList, E edge, V guardVertexToNotDisconnect, PathValidator<V,E> pathValidator)	Creates paths obtained by concatenating the specified edge to the specified paths.
RankingPathElementList(Graph<V,E> graph, int maxSize, V vertex)	Creates an empty list.
RankingPathElementList(Graph<V,E> graph, int maxSize, V vertex, PathValidator<V,E> pathValidator)	Creates an empty list.
SearchFrontier(Graph<V,E> graph)
TreeSingleSourcePathsImpl(Graph<V,E> g, V source, java.util.Map<V,Pair<java.lang.Double,E>> distanceAndPredecessorMap)	Construct a new instance.
UndirectedSpecifics(Graph<V,E> g)
UndirectedSpecifics(Graph<V,E> g)

Uses of Graph in org.jgrapht.alg.spanning

Fields in org.jgrapht.alg.spanning declared as Graph

Modifier and Type	Field	Description
private Graph<V,E>	PrimMinimumSpanningTree.g
private Graph<V,E>	BoruvkaMinimumSpanningTree.graph
private Graph<V,E>	KruskalMinimumSpanningTree.graph

Constructors in org.jgrapht.alg.spanning with parameters of type Graph

Constructor	Description
BoruvkaMinimumSpanningTree(Graph<V,E> graph)	Construct a new instance of the algorithm.
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.experimental

Classes in org.jgrapht.experimental that implement Graph

Modifier and Type	Class	Description
class	GraphSquare<V,E>	A unmodifiable graph which is the squared graph of another.

Methods in org.jgrapht.experimental with parameters of type Graph

Modifier and Type	Method	Description
private void	GraphSquare.addEdgesStartingAt(Graph<V,E> g, V v, V u, boolean createLoops)
private void	GraphSquare.addSquareEdges(Graph<V,E> g, boolean createLoops)

Constructors in org.jgrapht.experimental with parameters of type Graph

Constructor	Description
GraphSquare(Graph<V,E> g, boolean createLoops)	Constructor for GraphSquare.

Uses of Graph in org.jgrapht.experimental.alg

Constructors in org.jgrapht.experimental.alg with parameters of type Graph

Constructor	Description
IntArrayGraphAlgorithm(Graph<V,E> g)	Create a new instance.

Uses of Graph in org.jgrapht.experimental.alg.color

Constructors in org.jgrapht.experimental.alg.color with parameters of type Graph

Constructor	Description
BrownBacktrackColoring(Graph<V,E> g)	Construct a new Brown backtracking algorithm.
GreedyColoring(Graph<V,E> g)	Create a new greedy coloring algorithm
GreedyColoring(Graph<V,E> g, int method)	Create a new greedy coloring algorithm

Uses of Graph in org.jgrapht.experimental.dag

Classes in org.jgrapht.experimental.dag that implement Graph

Modifier and Type	Class	Description
class	DirectedAcyclicGraph<V,E>	DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast topological order iteration.

Uses of Graph in org.jgrapht.generate

Methods in org.jgrapht.generate with parameters of type Graph

Modifier and Type	Method	Description
void	CompleteBipartiteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Construct a complete bipartite graph
void	CompleteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generate a graph structure.
void	EmptyGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generate a graph structure.
void	GnmRandomBipartiteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generates a random bipartite graph.
void	GnmRandomGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, 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, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generates a random bipartite graph.
void	GnpRandomGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generates a random graph based on the G(n, p) model.
void	GraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,T> resultMap)	Generate a graph structure.
void	GridGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generate a graph structure.
void	HyperCubeGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	This will generate the hypercube graph
void	LinearGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generate a graph structure.
void	RingGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generate a graph structure.
void	ScaleFreeGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generates scale-free network with size passed to the constructor.
void	StarGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generates a star graph with the designated order from the constructor
void	WeightedGraphGeneratorAdapter.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,T> resultMap)	Generate a graph structure.
void	WheelGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, java.util.Map<java.lang.String,V> resultMap)	Generate a graph structure.

Uses of Graph in org.jgrapht.graph

Classes in org.jgrapht.graph with type parameters of type Graph

Modifier and Type	Class	Description
class	GraphUnion<V,E,G extends Graph<V,E>>	Read-only union of two graphs: G1 and G2.
class	Subgraph<V,E,G extends Graph<V,E>>	A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base 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	AsUndirectedGraph<V,E>	An undirected view of the backing directed graph specified in the constructor.
class	AsUnweightedDirectedGraph<V,E>	An unweighted view of the backing weighted graph specified in the constructor.
class	AsUnweightedGraph<V,E>	An unweighted view of the backing weighted graph specified in the constructor.
class	AsWeightedDirectedGraph<V,E>	A weighted view of the backing graph specified in the constructor.
class	AsWeightedGraph<V,E>	A weighted view of the backing graph specified in the constructor.
class	DefaultDirectedGraph<V,E>	A directed graph.
class	DefaultDirectedWeightedGraph<V,E>	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	DirectedGraphUnion<V,E>	A union of directed graphs.
class	DirectedMaskSubgraph<V,E>	A directed graph that is a MaskSubgraph of another graph.
class	DirectedMultigraph<V,E>	A directed multigraph.
class	DirectedPseudograph<V,E>	A directed pseudograph.
class	DirectedSubgraph<V,E>	A directed graph that is a subgraph of another graph.
class	DirectedWeightedMultigraph<V,E>	A directed weighted multigraph.
class	DirectedWeightedPseudograph<V,E>	A directed weighted pseudograph.
class	DirectedWeightedSubgraph<V,E>	A directed weighted graph that is a subgraph of another graph.
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	GraphUnion<V,E,G extends Graph<V,E>>	Read-only union of two graphs: G1 and G2.
class	ListenableDirectedGraph<V,E>	A directed graph which is also ListenableGraph.
class	ListenableDirectedWeightedGraph<V,E>	A directed weighted graph which is also ListenableGraph.
class	ListenableUndirectedGraph<V,E>	An undirected graph which is also ListenableGraph.
class	ListenableUndirectedWeightedGraph<V,E>	An undirected weighted graph which is also ListenableGraph.
class	MaskSubgraph<V,E>	An unmodifiable subgraph induced by a vertex/edge masking function.
class	MixedGraphUnion<V,E>	Read-only union of an undirected and a directed graph.
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>	A simple graph.
class	SimpleWeightedGraph<V,E>	A simple weighted graph.
class	Subgraph<V,E,G extends Graph<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	UndirectedGraphUnion<V,E>	An undirected version of the read-only union of two graphs.
class	UndirectedMaskSubgraph<V,E>	An undirected graph that is a MaskSubgraph of another graph.
class	UndirectedSubgraph<V,E>	An undirected graph that is a subgraph of another graph.
class	UndirectedWeightedSubgraph<V,E>	An undirected weighted graph that is a subgraph on other graph.
class	UnmodifiableDirectedGraph<V,E>	A directed graph that cannot be modified.
class	UnmodifiableGraph<V,E>	An unmodifiable view of the backing graph specified in the constructor.
class	UnmodifiableUndirectedGraph<V,E>	An undirected graph that cannot be modified.
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>	MaskSubgraph.base
protected G	Subgraph.base
private Graph<V,E>	GraphDelegator.delegate	The graph to which operations are delegated.
private G	GraphUnion.g1
private G	GraphUnion.g2
protected Graph<V,E>	GraphWalk.graph
private Graph<V,E>	MaskEdgeSet.graph
private Graph<V,E>	DefaultGraphMapping.graph1
private Graph<V,E>	DefaultGraphMapping.graph2

Methods in org.jgrapht.graph that return Graph

Modifier and Type	Method	Description
Graph<V,E>	GraphWalk.getGraph()

Constructors in org.jgrapht.graph with parameters of type Graph

Constructor	Description
AsUnweightedGraph(Graph<V,E> g)	Constructor for AsUnweightedGraph.
AsWeightedGraph(Graph<V,E> g, java.util.Map<E,java.lang.Double> weightMap)	Constructor for AsWeightedGraph.
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.
GraphDelegator(Graph<V,E> g)	Constructor for GraphDelegator.
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.
MaskEdgeSet(Graph<V,E> graph, java.util.Set<E> edgeSet, java.util.function.Predicate<V> vertexMask, java.util.function.Predicate<E> edgeMask)
MaskSubgraph(Graph<V,E> base, java.util.function.Predicate<V> vertexMask, java.util.function.Predicate<E> edgeMask)	Creates a new induced subgraph.
MaskSubgraph(Graph<V,E> base, MaskFunctor<V,E> mask)	Deprecated. in favor of using the constructor with lambdas
ParanoidGraph(Graph<V,E> g)	Create a new paranoid graph.
UnmodifiableGraph(Graph<V,E> g)	Creates a new unmodifiable graph based on the specified backing 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

Fields in org.jgrapht.graph.builder declared as Graph

Modifier and Type	Field	Description
protected G	AbstractGraphBuilder.graph

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.

Uses of Graph in org.jgrapht.traverse

Fields in org.jgrapht.traverse declared as Graph

Modifier and Type	Field	Description
private Graph<VV,EE>	AbstractGraphIterator.UndirectedSpecifics.graph
private Graph<V,E>	CrossComponentIterator.graph
private Graph<V,E>	RandomWalkIterator.graph

Methods in org.jgrapht.traverse that return Graph

Modifier and Type	Method	Description
Graph<V,E>	CrossComponentIterator.getGraph()

Methods in org.jgrapht.traverse with parameters of type Graph

Modifier and Type	Method	Description
(package private) static <V,E> AbstractGraphIterator.Specifics<V,E>	AbstractGraphIterator.createGraphSpecifics(Graph<V,E> g)	Creates directed/undirected graph specifics according to the provided graph - directed/undirected, respectively.

Constructors in org.jgrapht.traverse with parameters of type Graph

Constructor	Description
BreadthFirstIterator(Graph<V,E> g)	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)	Creates a new 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.
CrossComponentIterator(Graph<V,E> g, V startVertex)	Creates a new iterator for the specified graph.
DepthFirstIterator(Graph<V,E> g)	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.
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.
UndirectedSpecifics(Graph<VV,EE> g)	Creates a new UndirectedSpecifics object.