Uses of Interface
org.jgrapht.Graph

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.color	Graph coloring algorithms.
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.alg.tour	Graph tours related algorithms.
org.jgrapht.alg.util	Utilities used by JGraphT algorithms.
org.jgrapht.alg.vertexcover	Vertex cover algorithms.
org.jgrapht.experimental	Experimental work or work-in-progress.
org.jgrapht.ext	Extensions and integration means to other products.
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.io	Importers/Exporters for various graph formats.
org.jgrapht.traverse	Graph traversal means.

Uses of Graph in org.jgrapht

Subinterfaces of Graph in org.jgrapht

Modifier and Type	Interface and Description
interface	DirectedGraph<V,E> Deprecated. In favor of Graph.
interface	ListenableGraph<V,E> A graph that supports listeners on structural change events.
interface	UndirectedGraph<V,E> Deprecated. In favor of Graph.
interface	WeightedGraph<V,E> Deprecated. In favor of Graph.

Methods in org.jgrapht that return Graph

Modifier and Type	Method and 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, 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, 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, String message) Checks that the specified graph is undirected 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 and Description
static <V,E> boolean	Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E> source, Collection<? extends E> edges) Adds a subset of the edges of the specified source graph to the specified destination graph.
static <V,E> boolean	Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E> source, Collection<? extends E> edges) Adds a subset of the edges of the specified source graph to the specified destination graph.
static <V,E> boolean	Graphs.addAllVertices(Graph<? super V,? super E> destination, Collection<? extends V> vertices) Adds all of the specified vertices to the destination graph.
static <V,E> E	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> 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> 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.addGraphReversed(Graph<? super V,? super E> destination, Graph<V,E> source) Adds all the vertices and all the edges of the specified source digraph to the specified destination digraph, reversing all of the edges.
static <V,E> void	Graphs.addIncomingEdges(Graph<V,E> graph, V target, Iterable<V> sources) Add edges from multiple source vertices to one target vertex.
static <V,E> void	Graphs.addOutgoingEdges(Graph<V,E> graph, V source, Iterable<V> targets) Add edges from one source vertex to multiple target vertices.
static <V,E> double	GraphMetrics.getDiameter(Graph<V,E> graph) Compute the diameter of the graph.
static <V,E> int	GraphMetrics.getGirth(Graph<V,E> graph) Compute the girth of the 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> boolean	GraphTests.isBipartite(Graph<V,E> graph) Test whether a graph is bipartite.
static <V,E> boolean	GraphTests.isBipartitePartition(Graph<V,E> graph, Set<? extends V> firstPartition, Set<? extends V> secondPartition) Test whether a partition of the vertices into two sets is a bipartite partition.
static <V,E> boolean	GraphTests.isComplete(Graph<V,E> graph) Test whether a graph is complete.
static <V,E> boolean	GraphTests.isConnected(Graph<V,E> graph) Test whether an undirected 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.isOverfull(Graph<V,E> graph) Test whether a graph is overfull.
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 directed 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.isWeaklyConnected(Graph<V,E> graph) Test whether a directed graph is weakly connected.
static <V,E> List<V>	Graphs.neighborListOf(Graph<V,E> g, V vertex) Returns a list of vertices that are the neighbors of a specified vertex.
static <V,E> 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, 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, 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, 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, String message) Checks that the specified graph is undirected and throws a customized IllegalArgumentException if it is not.
static <V,E> List<V>	Graphs.successorListOf(Graph<V,E> g, V vertex) Returns a list of vertices that are the direct successors of a specified vertex.
static <V,E> boolean	Graphs.testIncidence(Graph<V,E> g, E e, V v) Tests whether an edge is incident to a vertex.
static <V,E> Graph<V,E>	Graphs.undirectedGraph(Graph<V,E> g) Returns an undirected view of the specified graph.
static <V,E> boolean	Graphs.vertexHasPredecessors(Graph<V,E> graph, V vertex) Check if a vertex has any direct predecessors.
static <V,E> boolean	Graphs.vertexHasSuccessors(Graph<V,E> graph, V vertex) Check if a vertex has any direct successors.

Uses of Graph in org.jgrapht.alg

Classes in org.jgrapht.alg that implement Graph

Modifier and Type	Class and 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.

Methods in org.jgrapht.alg that return Graph

Modifier and Type	Method and 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>	CliqueMinimalSeparatorDecomposition.getGraph() Deprecated. Get the original graph.
Graph<V,E>	CliqueMinimalSeparatorDecomposition.getMinimalTriangulation() Deprecated. Get the minimal triangulation of the graph.

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

Modifier and Type	Method and 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 and Description
BiconnectivityInspector(Graph<V,E> graph) Running time = O(m) where m is the number of edges.
BlockCutpointGraph(Graph<V,E> graph) Running time = O(m) where m is the number of edges.
BronKerboschCliqueFinder(Graph<V,E> graph) Deprecated. Creates a new clique finder.
CliqueMinimalSeparatorDecomposition(Graph<V,E> g) Deprecated. Setup a clique minimal separator decomposition on undirected graph g.
ConnectivityInspector(Graph<V,E> g) Creates a connectivity inspector for the specified graph.
CycleDetector(Graph<V,E> graph) Creates a cycle detector for the specified graph.
DirectedNeighborIndex(Graph<V,E> g) Deprecated. Creates a neighbor index for the specified directed graph.
GabowStrongConnectivityInspector(Graph<V,E> graph) Constructor
KosarajuStrongConnectivityInspector(Graph<V,E> graph) Constructor
NaiveLcaFinder(Graph<V,E> graph) Create a new instance of the native LCA finder.
NeighborIndex(Graph<V,E> g) Deprecated. Creates a neighbor index for the specified undirected graph.
StoerWagnerMinimumCut(Graph<V,E> graph) Will compute the minimum cut in graph.
TarjanLowestCommonAncestor(Graph<V,E> g) Create an instance with a reference to the graph that we will find LCAs for

Uses of Graph in org.jgrapht.alg.clique

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

Modifier and Type	Method and 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 and Description
BronKerboschCliqueFinder(Graph<V,E> graph) Constructs a new clique finder.
BronKerboschCliqueFinder(Graph<V,E> graph, long timeout, TimeUnit unit) Constructs a new clique finder.
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, TimeUnit unit) Constructs a new clique finder.
PivotBronKerboschCliqueFinder(Graph<V,E> graph) Constructs a new clique finder.
PivotBronKerboschCliqueFinder(Graph<V,E> graph, long timeout, TimeUnit unit) Constructs a new clique finder.

Uses of Graph in org.jgrapht.alg.color

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

Modifier and Type	Field and Description
protected Graph<V,E>	GreedyColoring.graph The input graph

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

Constructor and Description
GreedyColoring(Graph<V,E> graph) Construct a new coloring algorithm.
LargestDegreeFirstColoring(Graph<V,E> graph) Construct a new coloring algorithm.
RandomGreedyColoring(Graph<V,E> graph) Construct a new coloring algorithm.
RandomGreedyColoring(Graph<V,E> graph, Random rng) Construct a new coloring 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.cycle

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

Modifier and Type	Method and Description
Graph<V,E>	UndirectedCycleBase.getGraph() Returns the graph on which the cycle base search algorithm is executed by this object.
Graph<V,E>	TiernanSimpleCycles.getGraph() Returns the graph on which the simple cycle search algorithm is executed by this object.
Graph<V,E>	TarjanSimpleCycles.getGraph() Returns the graph on which the simple cycle search algorithm is executed by this object.
Graph<V,E>	SzwarcfiterLauerSimpleCycles.getGraph() Returns the graph on which the simple cycle search algorithm is executed by this object.
Graph<V,E>	PatonCycleBase.getGraph() Returns the graph on which the cycle base search algorithm is executed by this object.
Graph<V,E>	JohnsonSimpleCycles.getGraph() Returns the graph on which the simple cycle search algorithm is executed by this object.
Graph<V,E>	HawickJamesSimpleCycles.getGraph() Returns the graph on which the simple cycle search algorithm is executed by this object.
Graph<V,E>	DirectedSimpleCycles.getGraph() Returns the graph on which the simple cycle search algorithm is executed by this object.

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

Modifier and Type	Method and Description
GraphPath<V,E>	HierholzerEulerianCycle.getEulerianCycle(Graph<V,E> g) Compute an Eulerian cycle of a graph.
boolean	HierholzerEulerianCycle.isEulerian(Graph<V,E> graph) Test whether a graph is Eulerian.
void	UndirectedCycleBase.setGraph(Graph<V,E> graph) Sets the graph on which the cycle base search algorithm is executed by this object.
void	TiernanSimpleCycles.setGraph(Graph<V,E> graph) Sets the graph on which the simple cycle search algorithm is executed by this object.
void	TarjanSimpleCycles.setGraph(Graph<V,E> graph) Sets the graph on which the simple cycle search algorithm is executed by this object.
void	SzwarcfiterLauerSimpleCycles.setGraph(Graph<V,E> graph) Sets the graph on which the simple cycle search algorithm is executed by this object.
void	PatonCycleBase.setGraph(Graph<V,E> graph) Sets the graph on which the cycle base search algorithm is executed by this object.
void	JohnsonSimpleCycles.setGraph(Graph<V,E> graph) Sets the graph on which the simple cycle search algorithm is executed by this object.
void	HawickJamesSimpleCycles.setGraph(Graph<V,E> graph) Sets the graph on which the simple cycle search algorithm is executed by this object.
void	DirectedSimpleCycles.setGraph(Graph<V,E> graph) Sets the graph on which the simple cycle search algorithm is executed by this object.

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

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

Uses of Graph in org.jgrapht.alg.flow

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

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

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

Constructor and 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 and Description
Graph<Graph<V,E>,DefaultEdge>	StrongConnectivityAlgorithm.getCondensation() Compute the condensation of the given graph.
Graph<V,E>	StrongConnectivityAlgorithm.getGraph() Return the underlying graph.
Graph<V,E>	ShortestPathAlgorithm.SingleSourcePaths.getGraph() Returns the graph over which this set of paths is defined.
Graph<V,E>	MatchingAlgorithm.Matching.getGraph() Returns the graph over which this matching is defined.
Graph<V,E>	MatchingAlgorithm.MatchingImpl.getGraph()

Methods in org.jgrapht.alg.interfaces that return types with arguments of type Graph

Modifier and Type	Method and Description
Graph<Graph<V,E>,DefaultEdge>	StrongConnectivityAlgorithm.getCondensation() Compute the condensation of the given graph.
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 and Description
GraphPath<V,E>	EulerianCycleAlgorithm.getEulerianCycle(Graph<V,E> graph) Compute an Eulerian cycle of a graph.
GraphPath<V,E>	TSPAlgorithm.getTour(Graph<V,E> graph) Computes a tour.
default MinimumVertexCoverAlgorithm.VertexCover<V>	MinimumWeightedVertexCoverAlgorithm.getVertexCover(Graph<V,E> graph) Computes a vertex cover; all vertices are considered to have equal weight.
MinimumVertexCoverAlgorithm.VertexCover<V>	MinimumVertexCoverAlgorithm.getVertexCover(Graph<V,E> graph) Computes a vertex cover; all vertices are considered to have equal weight.
MinimumVertexCoverAlgorithm.VertexCover<V>	MinimumWeightedVertexCoverAlgorithm.getVertexCover(Graph<V,E> graph, Map<V,Double> vertexWeightMap) Computes a vertex cover; the weight of each vertex is provided in the in the vertexWeightMap.

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

Constructor and Description
MatchingImpl(Graph<V,E> graph, Set<E> edges, double weight) Construct a new instance

Uses of Graph in org.jgrapht.alg.isomorphism

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

Modifier and Type	Field and Description
protected Graph<V,E>	VF2AbstractIsomorphismInspector.graph1
protected Graph<V,E>	VF2AbstractIsomorphismInspector.graph2

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

Constructor and Description
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) 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, boolean cacheEdges) Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new base implementation of the VF2 isomorphism inspector.
VF2AbstractIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new base implementation of the VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2) Construct a new 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, boolean cacheEdges) Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new VF2 isomorphism inspector.
VF2GraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, 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) 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, boolean cacheEdges) Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator) Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new VF2 isomorphism inspector.
VF2SubgraphIsomorphismInspector(Graph<V,E> graph1, Graph<V,E> graph2, Comparator<V> vertexComparator, Comparator<E> edgeComparator, boolean cacheEdges) Construct a new VF2 isomorphism inspector.

Uses of Graph in org.jgrapht.alg.matching

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

Constructor and Description
EdmondsBlossomShrinking(Graph<V,E> graph) Deprecated. Construct an instance of the Edmonds blossom shrinking algorithm.
EdmondsMaximumCardinalityMatching(Graph<V,E> graph) Constructs a new instance of the algorithm.
EdmondsMaximumCardinalityMatching(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.
HopcroftKarpBipartiteMatching(Graph<V,E> graph, Set<V> partition1, Set<V> partition2) Deprecated. Construct a new instance of the Hopcroft-Karp algorithm for the computation of maximum matchings in bipartite graphs.
HopcroftKarpMaximumCardinalityBipartiteMatching(Graph<V,E> graph, Set<V> partition1, Set<V> partition2) Constructs a new instance of the Hopcroft Karp bipartite matching algorithm.
KuhnMunkresMinimalWeightBipartitePerfectMatching(Graph<V,E> graph, Set<? extends V> partition1, Set<? extends V> partition2) Construct a new instance of the algorithm.
MaximumWeightBipartiteMatching(Graph<V,E> graph, Set<V> partition1, 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 and Description
protected Graph<V,E>	ClosenessCentrality.graph Underlying graph

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

Constructor and Description
ClosenessCentrality(Graph<V,E> graph) Construct a new instance.
ClosenessCentrality(Graph<V,E> graph, boolean incoming, boolean normalize) 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> 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.

Uses of Graph in org.jgrapht.alg.shortestpath

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

Modifier and Type	Field and Description
protected Graph<V,E>	TreeSingleSourcePathsImpl.g The graph
protected Graph<V,E>	ListSingleSourcePathsImpl.graph The graph

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

Modifier and Type	Method and Description
Graph<V,E>	TreeSingleSourcePathsImpl.getGraph() Returns the graph over which this set of paths is defined.
Graph<V,E>	ListSingleSourcePathsImpl.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 and Description
static <V,E> GraphPath<V,E>	DijkstraShortestPath.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>	BellmanFordShortestPath.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 and Description
AllDirectedPaths(Graph<V,E> graph) Create a new instance
ALTAdmissibleHeuristic(Graph<V,E> graph, 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.
BellmanFordShortestPath(Graph<V,E> graph) Construct a new instance.
BellmanFordShortestPath(Graph<V,E> graph, double epsilon) Construct a new instance.
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.
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.
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.
JohnsonShortestPaths(Graph<V,E> graph, Class<? extends V> vertexClass) Construct a new instance.
JohnsonShortestPaths(Graph<V,E> graph, VertexFactory<V> vertexFactory) Construct a new instance.
JohnsonShortestPaths(Graph<V,E> graph, VertexFactory<V> vertexFactory, double epsilon) Construct a new instance.
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.
ListSingleSourcePathsImpl(Graph<V,E> graph, V source, Map<V,GraphPath<V,E>> paths) Construct a new instance.
TreeSingleSourcePathsImpl(Graph<V,E> g, V source, Map<V,Pair<Double,E>> distanceAndPredecessorMap) Construct a new instance.

Uses of Graph in org.jgrapht.alg.spanning

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

Constructor and Description
BoruvkaMinimumSpanningTree(Graph<V,E> graph) Construct a new instance of the algorithm.
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 and Description
GraphPath<V,E>	TwoApproxMetricTSP.getTour(Graph<V,E> graph) Computes a 2-approximate tour.

Uses of Graph in org.jgrapht.alg.util

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

Constructor and 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

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

Modifier and Type	Method and Description
MinimumVertexCoverAlgorithm.VertexCover<V>	RecursiveExactVCImpl.getVertexCover(Graph<V,E> graph)
MinimumVertexCoverAlgorithm.VertexCover<V>	EdgeBasedTwoApproxVCImpl.getVertexCover(Graph<V,E> graph) Finds a 2-approximation for a minimal vertex cover of the specified graph.
MinimumVertexCoverAlgorithm.VertexCover<V>	RecursiveExactVCImpl.getVertexCover(Graph<V,E> graph, Map<V,Double> vertexWeightMap)
MinimumVertexCoverAlgorithm.VertexCover<V>	GreedyVCImpl.getVertexCover(Graph<V,E> graph, Map<V,Double> vertexWeightMap) Finds a greedy solution to the minimum weighted vertex cover problem.
MinimumVertexCoverAlgorithm.VertexCover<V>	ClarksonTwoApproxVCImpl.getVertexCover(Graph<V,E> graph, Map<V,Double> vertexWeightMap)
MinimumVertexCoverAlgorithm.VertexCover<V>	BarYehudaEvenTwoApproxVCImpl.getVertexCover(Graph<V,E> graph, Map<V,Double> vertexWeightMap)

Uses of Graph in org.jgrapht.experimental

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

Constructor and Description
BrownBacktrackColoring(Graph<V,E> g) Construct a new Brown backtracking algorithm.

Uses of Graph in org.jgrapht.ext

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

Modifier and Type	Method and Description
static <V,E> org.jgraph.graph.AttributeMap	JGraphModelAdapter.createDefaultEdgeAttributes(Graph<V,E> jGraphTGraph) Creates and returns a map of attributes to be used as defaults for edge attributes, depending on the specified graph.
default void	GraphExporter.exportGraph(Graph<V,E> g, File file) Deprecated. Export a graph
default void	GraphExporter.exportGraph(Graph<V,E> g, OutputStream out) Deprecated. Export a graph
void	VisioExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Exports the specified graph into a Visio CSV file format.
void	MatrixExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated.
void	GraphMLExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Exports a graph in GraphML format.
void	GraphExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Export a graph
void	GmlExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Exports an graph into a plain text GML format.
void	DOTExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Exports a graph into a plain text file in DOT format.
void	DIMACSExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Export a graph
void	CSVExporter.exportGraph(Graph<V,E> g, Writer writer) Deprecated. Exports a graph
default void	GraphImporter.importGraph(Graph<V,E> g, File file) Deprecated. Import a graph
default void	GraphImporter.importGraph(Graph<V,E> g, InputStream in) Deprecated. Import a graph
void	GraphMLImporter.importGraph(Graph<V,E> graph, Reader input) Deprecated. Import a graph.
void	GraphImporter.importGraph(Graph<V,E> g, Reader in) Deprecated. Import a graph
void	GmlImporter.importGraph(Graph<V,E> graph, Reader input) Deprecated. Import a graph.
void	DOTImporter.importGraph(Graph<V,E> graph, Reader input) Deprecated. Read a dot formatted input and populate the provided graph.
void	DIMACSImporter.importGraph(Graph<V,E> graph, Reader input) Deprecated. Import a graph.
void	CSVImporter.importGraph(Graph<V,E> graph, Reader input) Deprecated. Import a graph.

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

Constructor and Description
JGraphModelAdapter(Graph<V,E> jGraphTGraph) Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter(Graph<V,E> jGraphTGraph, org.jgraph.graph.AttributeMap defaultVertexAttributes, org.jgraph.graph.AttributeMap defaultEdgeAttributes) Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphModelAdapter(Graph<V,E> jGraphTGraph, org.jgraph.graph.AttributeMap defaultVertexAttributes, org.jgraph.graph.AttributeMap defaultEdgeAttributes, JGraphModelAdapter.CellFactory<V,E> cellFactory) Constructs a new JGraph model adapter for the specified JGraphT graph.
JGraphXAdapter(Graph<V,E> graph) Constructs and draws a new mxGraph from a jGraphT graph.

Constructor parameters in org.jgrapht.ext with type arguments of type Graph

Constructor and Description
DOTExporter(ComponentNameProvider<V> vertexIDProvider, ComponentNameProvider<V> vertexLabelProvider, ComponentNameProvider<E> edgeLabelProvider, ComponentAttributeProvider<V> vertexAttributeProvider, ComponentAttributeProvider<E> edgeAttributeProvider, ComponentNameProvider<Graph<V,E>> graphIDProvider) Deprecated. Constructs a new DOTExporter object with the given ID, label, attribute, and graph id providers.
DOTImporter(VertexProvider<V> vertexProvider, EdgeProvider<V,E> edgeProvider, ComponentUpdater<V> vertexUpdater, ComponentUpdater<Graph<V,E>> graphUpdater) Deprecated. Constructs a new DOTImporter with the given providers

Uses of Graph in org.jgrapht.generate

Methods in org.jgrapht.generate that return Graph

Modifier and Type	Method and Description
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.bidiakisCubeGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.blanusaFirstSnarkGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.blanusaSecondSnarkGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.brinkmannGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.buckyBallGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.bullGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.butterflyGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.chvatalGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.clawGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.clebschGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.coxeterGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.desarguesGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.dodecahedronGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.doubleStarSnarkGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.doyleGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.dürerGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.ellinghamHorton54Graph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.ellinghamHorton78Graph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.erreraGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.franklinGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.fruchtGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.generalizedPetersenGraph(int n, int k)
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.goldnerHararyGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.gossetGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.grötzschGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.heawoodGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.herschelGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.hoffmanGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.kittellGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.klein3RegularGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.klein7RegularGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.krackhardtKiteGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.möbiusKantorGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.moserSpindleGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.nauruGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.petersenGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.poussinGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.schläfliGraph()
static Graph<Integer,DefaultEdge>	NamedGraphGenerator.thomsenGraph()

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

Modifier and Type	Method and 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.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.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	ComplementGraphGenerator.generateGraph(Graph<V,E> target) Generates the complement graph.
void	GeneralizedPetersenGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,List<V>> resultMap) Generates the Generalized Petersen Graph
void	WeightedGraphGeneratorAdapter.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,T> resultMap) Deprecated. Generate a graph structure.
void	GraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,T> resultMap) Generate a graph structure.
void	WindmillGraphsGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
void	WheelGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	WattsStrogatzGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a small-world graph based on the Watts-Strogatz model.
void	StarGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a star graph with the designated order from the constructor
void	SimpleWeightedGraphMatrixGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
void	SimpleWeightedBipartiteGraphMatrixGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	ScaleFreeGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates scale-free network with size passed to the constructor.
void	RingGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	LinearizedChordDiagramGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates an instance.
void	LinearGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	KleinbergSmallWorldGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a small-world graph.
void	HyperCubeGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) This will generate the hypercube graph
void	GridGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	GnpRandomGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a random graph based on the G(n, p) model.
void	GnpRandomBipartiteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a random bipartite graph.
void	GnmRandomGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a random graph based on the G(n, M) model
void	GnmRandomBipartiteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates a random bipartite graph.
void	EmptyGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	CompleteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generate a graph structure.
void	CompleteBipartiteGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Construct a complete bipartite graph
void	ComplementGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap)
void	BarabasiAlbertGraphGenerator.generateGraph(Graph<V,E> target, VertexFactory<V> vertexFactory, Map<String,V> resultMap) Generates an instance.
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.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.

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

Constructor and 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 with type parameters of type Graph

Modifier and Type	Class and Description
class	GraphUnion<V,E,G extends Graph<V,E>> Deprecated. In favor of AsGraphUnion.
class	Subgraph<V,E,G extends Graph<V,E>> Deprecated. In favor of AsSubgraph.

Classes in org.jgrapht.graph that implement Graph

Modifier and Type	Class and 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	AsUnweightedDirectedGraph<V,E> Deprecated. In favor of AsUnweightedGraph.
class	AsUnweightedGraph<V,E> An unweighted view of a graph.
class	AsWeightedDirectedGraph<V,E> Deprecated. In favor of AsWeightedGraph.
class	AsWeightedGraph<V,E> A weighted view of a graph.
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	DirectedAcyclicGraph<V,E> A directed acyclic graph (DAG).
class	DirectedGraphUnion<V,E> Deprecated. In favor of AsGraphUnion.
class	DirectedMaskSubgraph<V,E> Deprecated. In favor of MaskSubgraph.
class	DirectedMultigraph<V,E> A directed multigraph.
class	DirectedPseudograph<V,E> A directed pseudograph.
class	DirectedSubgraph<V,E> Deprecated. In favor of AsSubgraph.
class	DirectedWeightedMultigraph<V,E> A directed weighted multigraph.
class	DirectedWeightedPseudograph<V,E> A directed weighted pseudograph.
class	DirectedWeightedSubgraph<V,E> Deprecated. In favor of AsSubgraph.
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>> Deprecated. In favor of AsGraphUnion.
class	ListenableDirectedGraph<V,E> Deprecated. In favor of DefaultListenableGraph.
class	ListenableDirectedWeightedGraph<V,E> Deprecated. In favor of DefaultListenableGraph.
class	ListenableUndirectedGraph<V,E> Deprecated. In favor of DefaultListenableGraph.
class	ListenableUndirectedWeightedGraph<V,E> Deprecated. In favor of DefaultListenableGraph.
class	MaskSubgraph<V,E> An unmodifiable subgraph induced by a vertex/edge masking function.
class	MixedGraphUnion<V,E> Deprecated. In favor of AsGraphUnion.
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>> Deprecated. In favor of AsSubgraph.
class	UndirectedGraphUnion<V,E> Deprecated. In favor of AsGraphUnion.
class	UndirectedMaskSubgraph<V,E> Deprecated. In favor of MaskSubgraph.
class	UndirectedSubgraph<V,E> Deprecated. In favor of AsSubgraph.
class	UndirectedWeightedSubgraph<V,E> Deprecated. In favor of AsSubgraph.
class	UnmodifiableDirectedGraph<V,E> Deprecated. In favor of AsUnmodifiableGraph.
class	UnmodifiableGraph<V,E> Deprecated. In favor of AsUnmodifiableGraph.
class	UnmodifiableUndirectedGraph<V,E> Deprecated. In favor of AsUnmodifiableGraph.
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 and Description
protected Graph<V,E>	MaskSubgraph.base
protected Graph<V,E>	AsSubgraph.base
protected G	Subgraph.g Deprecated.
protected Graph<V,E>	GraphWalk.graph

Methods in org.jgrapht.graph that return Graph

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

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

Modifier and Type	Method and 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 and Description
AsGraphUnion(Graph<V,E> g1, Graph<V,E> g2) Construct a new graph union.
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.
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, Set<? extends V> vertexSubset) Creates a new induced subgraph.
AsSubgraph(Graph<V,E> base, Set<? extends V> vertexSubset, 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
AsWeightedGraph(Graph<V,E> g, Map<E,Double> weightMap) Constructor for AsWeightedGraph.
DefaultGraphMapping(Map<V,V> g1ToG2, Map<V,V> g2ToG1, Graph<V,E> g1, Graph<V,E> g2) The maps themselves are used.
DefaultGraphMapping(Map<V,V> g1ToG2, 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.
DirectedSubgraph(Graph<V,E> base) Deprecated. Creates a new directed induced subgraph with all vertices included.
DirectedSubgraph(Graph<V,E> base, Set<? extends V> vertexSubset) Deprecated. Creates a new directed induced subgraph.
DirectedSubgraph(Graph<V,E> base, Set<? extends V> vertexSubset, Set<? extends E> edgeSubset) Deprecated. Creates a new directed subgraph.
EdgeReversedGraph(Graph<V,E> g) Creates a new EdgeReversedGraph.
GraphDelegator(Graph<V,E> g) Constructor for GraphDelegator.
GraphWalk(Graph<V,E> graph, List<V> vertexList, double weight) Creates a walk defined by a sequence of vertices.
GraphWalk(Graph<V,E> graph, V startVertex, V endVertex, List<E> edgeList, double weight) Creates a walk defined by a sequence of edges.
GraphWalk(Graph<V,E> graph, V startVertex, V endVertex, List<V> vertexList, List<E> edgeList, double weight) Creates a walk defined by both a sequence of edges and a sequence of vertices.
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.
UnmodifiableGraph(Graph<V,E> g) Deprecated. 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 and 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 and Description
protected G	AbstractGraphBuilder.graph

Methods in org.jgrapht.graph.builder that return Graph

Modifier and Type	Method and Description
Graph<V,E>	AbstractGraphBuilder.buildAsUnmodifiable() Build an unmodifiable version graph.

Methods in org.jgrapht.graph.builder with parameters of type Graph

Modifier and Type	Method and 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.io

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

Modifier and Type	Method and Description
default void	GraphExporter.exportGraph(Graph<V,E> g, File file) Export a graph
default void	GraphExporter.exportGraph(Graph<V,E> g, OutputStream out) Export a graph
void	VisioExporter.exportGraph(Graph<V,E> g, Writer writer) Exports the specified graph into a Visio CSV file format.
void	MatrixExporter.exportGraph(Graph<V,E> g, Writer writer)
void	GraphMLExporter.exportGraph(Graph<V,E> g, Writer writer) Exports a graph in GraphML format.
void	GraphExporter.exportGraph(Graph<V,E> g, Writer writer) Export a graph
void	Graph6Sparse6Exporter.exportGraph(Graph<V,E> g, Writer writer)
void	GmlExporter.exportGraph(Graph<V,E> g, Writer writer) Exports an graph into a plain text GML format.
void	DOTExporter.exportGraph(Graph<V,E> g, Writer writer) Exports a graph into a plain text file in DOT format.
void	DIMACSExporter.exportGraph(Graph<V,E> g, Writer writer) Export a graph
void	CSVExporter.exportGraph(Graph<V,E> g, Writer writer) Exports a graph
default void	GraphImporter.importGraph(Graph<V,E> g, File file) Import a graph
default void	GraphImporter.importGraph(Graph<V,E> g, InputStream in) Import a graph
void	GraphMLImporter.importGraph(Graph<V,E> graph, Reader input) Import a graph.
void	GraphImporter.importGraph(Graph<V,E> g, Reader in) Import a graph
void	Graph6Sparse6Importer.importGraph(Graph<V,E> g, Reader input)
void	GmlImporter.importGraph(Graph<V,E> graph, Reader input) Import a graph.
void	DOTImporter.importGraph(Graph<V,E> g, Reader in) Import a graph
void	DIMACSImporter.importGraph(Graph<V,E> graph, Reader input) Import a graph.
void	CSVImporter.importGraph(Graph<V,E> graph, Reader input) Import a graph.
void	Graph6Sparse6Importer.importGraph(Graph<V,E> g, String g6) Import the graph represented by a String in graph6 or sparse6 encoding.

Constructor parameters in org.jgrapht.io with type arguments of type Graph

Constructor and Description
DOTExporter(ComponentNameProvider<V> vertexIDProvider, ComponentNameProvider<V> vertexLabelProvider, ComponentNameProvider<E> edgeLabelProvider, ComponentAttributeProvider<V> vertexAttributeProvider, ComponentAttributeProvider<E> edgeAttributeProvider, ComponentNameProvider<Graph<V,E>> graphIDProvider) Constructs a new DOTExporter object with the given ID, label, attribute, and graph id providers.
DOTImporter(VertexProvider<V> vertexProvider, EdgeProvider<V,E> edgeProvider, ComponentUpdater<V> vertexUpdater, ComponentUpdater<Graph<V,E>> graphUpdater) Constructs a new importer.

Uses of Graph in org.jgrapht.traverse

Fields in org.jgrapht.traverse declared as Graph

Modifier and Type	Field and Description
protected Graph<V,E>	AbstractGraphIterator.graph

Methods in org.jgrapht.traverse that return Graph

Modifier and Type	Method and Description
Graph<V,E>	AbstractGraphIterator.getGraph() Get the graph being traversed.

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

Constructor and 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, 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) Creates a new closest-first iterator for the specified graph.
ClosestFirstIterator(Graph<V,E> g, Iterable<V> startVertices) Creates a new closest-first iterator for the specified graph.
ClosestFirstIterator(Graph<V,E> g, Iterable<V> startVertices, double radius) 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.
CrossComponentIterator(Graph<V,E> g) Creates a new iterator for the specified graph.
CrossComponentIterator(Graph<V,E> g, 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, 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.
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, 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, Comparator<V> comparator) Construct a topological order iterator.
TopologicalOrderIterator(Graph<V,E> graph, Queue<V> queue) Deprecated. in favor of TopologicalOrderIterator.TopologicalOrderIterator(Graph, Comparator)