Uses of Interface
org.graph4j.Graph

Packages that use Graph

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.
org.graph4j.clique	Clique related algorithms, such as enumerating all maximal cliques of a graph.
org.graph4j.coloring
org.graph4j.coloring.bw	Algorithms for the bandwith graph coloring problem.
org.graph4j.coloring.eq	Algorithms for the equitable graph coloring problem.
org.graph4j.connectivity	Algorithms for analyzing connectivity of graphs and digraphs.
org.graph4j.converters
org.graph4j.eulerian	Algorithms for determining eulerian circuits and trails.
org.graph4j.generators	Graph generators of various kinds.
org.graph4j.hamiltonian
org.graph4j.io	Reading and writing graphs in various formats.
org.graph4j.isomorphism	Algorithms for testing graph isomorphism.
org.graph4j.matching	Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.
org.graph4j.measures	Classes responsible with calculating various graph measures (degrees, number of traingles, etc.).
org.graph4j.metrics	Classes responsible with calculating various graph metrics (girth, radius, diameter, etc.).
org.graph4j.ordering	Algorithms that produce various orderings of the vertices of a graph.
org.graph4j.realization	Algorithms for graph realization problems.
org.graph4j.route	Algorithms related to paths and cycles.
org.graph4j.shortestpath	Algorithms related to shortest paths, such as Dijkstra, Bellman-Ford, Floyd-Warshall, etc.
org.graph4j.spanning	Minimum spanning tree algorithms, such as Prim's and Kruskal's.
org.graph4j.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).
org.graph4j.traversal	Implementations of the depth-first search (DFS) and breadth-first search (BFS) algorithms, using both iterator and visitor patterns.
org.graph4j.util	Utility classes, such as apecialized collection for vertices and edges.
org.graph4j.vsp	Algorithms for the Vertex Separator Problem (VSP).

Uses of Graph in org.graph4j

Subinterfaces of Graph in org.graph4j

Modifier and Type	Interface	Description
interface	Digraph<V,E>	Represents a directed graph.
interface	DirectedMultigraph<V,E>	Multiple (parallel) edges are allowed.
interface	DirectedPseudograph<V,E>	Multiple (parallel) edges are allowed.
interface	Multigraph<V,E>	Multiple (parallel) edges are allowed.
interface	Network<V,E>	Represents a single commodity transportation (flow) network.
interface	Pseudograph<V,E>	Self loops and multiple (parallel) edges are allowed.

Fields in org.graph4j declared as Graph

Modifier and Type	Field	Description
protected final Graph	GraphAlgorithm.graph
protected final Graph	SimpleGraphAlgorithm.graph
protected final Graph	UndirectedGraphAlgorithm.graph

Methods in org.graph4j that return Graph

Modifier and Type	Method	Description
Graph	GraphBuilder.buildGraph()	Builds an undirected graph, without multiple edges or self loops.
Graph<V,E>	Graph.complement()	Creates the complement of the graph.
Graph<V,E>	Graph.copy()	Creates and returns an identical copy of the graph.
Graph<V,E>	Graph.copy(boolean vertexWeights, boolean vertexLabels, boolean edges, boolean edgeWeights, boolean edgeLabels)	Creates and returns a copy of the graph.
static Graph	GraphUtils.createIntersectionGraph(List<Graph> graphs, boolean vertexLabeled)	Creates the intersection graph of the vertex sets of the specified graphs.An intersection graph is a graph where each vertex corresponds to a set, and there is an edge between two vertices if and only if the corresponding sets intersect.
static Graph<Edge,Object>	GraphUtils.createLineGraph(Graph graph)	Creates the line graph of an undirected graph.
static Graph	GraphUtils.createSupportGraph(Graph graph)	Convenience method for obtaining the support graph of a digraph, multigraph or pseudograph.
static Graph	GraphUtils.disjointUnion(Graph... graphs)	Performs the disjoint union operation.
Graph	GraphAlgorithm.getGraph()	Returns the input graph on which the algorithm is executed.
Graph	SimpleGraphAlgorithm.getGraph()
static Graph	GraphUtils.join(Graph... graphs)	Performs the join operation on the specified graphs.
static Graph	GraphUtils.mapVertexNumbers(Graph graph, int[] vertices)	Creates a new graph by mapping the vertex numbers in the input graph to the specified values, while preserving the edges.
static Graph	GraphUtils.rotate(Graph graph, int distance)	Creates a new graph by rotating the vertex numbers in the input graph by a specified distance, while preserving the edges.
static Graph	GraphUtils.shuffle(Graph graph)	Creates a new graph by shuffling the vertex numbers in the input graph, while preserving the edges.
default Graph<V,E>	Graph.subgraph(int... vertices)	Creates and returns the subgraph induced by an array of vertices.
Graph<V,E>	Graph.subgraph(Collection<Edge> edges)	Creates and returns the subgraph generated by a collection of edges.
Graph<V,E>	Graph.subgraph(VertexSet vertexSet)	Creates and returns the subgraph induced by a set of vertices.
Graph<V,E>	Digraph.supportGraph()	Creates the support graph of this digraph.
Graph<V,E>	Multigraph.supportGraph()	The support graph of a multigraph or a pseudograph G is an undirected graph containing all the vertices of G, self loops are removed and multiple edges are merged into a single one.
static Graph	GraphUtils.union(Graph... graphs)	Performs the union of the specified graph.

Methods in org.graph4j with parameters of type Graph

Modifier and Type	Method	Description
default void	Graph.addGraph(Graph<V,E> graph)	Adds the vertices and edges of another graph.
static int	GraphUtils.computeEdgeConnectivity(Graph graph)	Computes the edge connectivity number, that is the minimum size of a set of edges whose removal disconnects the graph.
static int	GraphUtils.computeVertexConnectivity(Graph graph)	Computes the vertex connectivity number, that is the minimum size of a set of vertices whose removal disconnects the graph.
static double	GraphUtils.computeWeight(Graph graph, Collection<Edge> edges)	Computes the sum of the weights of the edges in a specified collection
static Digraph	GraphUtils.createAcyclicOrientation(Graph graph)	Creates the acyclic orientation of an undirected graph.
static Graph<Edge,Object>	GraphUtils.createLineGraph(Graph graph)	Creates the line graph of an undirected graph.
static Graph	GraphUtils.createSupportGraph(Graph graph)	Convenience method for obtaining the support graph of a digraph, multigraph or pseudograph.
static Graph	GraphUtils.disjointUnion(Graph... graphs)	Performs the disjoint union operation.
static VertexSet	GraphUtils.getVertices(Graph graph, Collection<Edge> edges)	Determines the set of distinct vertices belonging to a collection of edges.
static boolean	GraphTests.hasOreProperty(Graph graph)	Checks if an undirected graph has Ore's property: deg(v) + deg(u) >= |V|, for every pair of distinct non-adjacent vertices v and u.
static boolean	GraphTests.isAcyclic(Graph graph)	Determines if the graph is acyclic, meaning it does not contain any cycle.
static boolean	GraphTests.isBiconnected(Graph graph)	Determines if the graph is biconnected (2-connected). that is it does not contain a cut-vertex.
static boolean	GraphTests.isBipartite(Graph graph)	Determines if a graph is bipartite, meaning that its vertices can be partitioned in two disjoint stable sets.
static boolean	GraphTests.isBridgeless(Graph graph)	Determines if the graph is bridgeless, that is it does not contain any bridge.
static boolean	GraphTests.isChordal(Graph graph)	Determines if a graph is chordal, meaning it does not contain an induced cycle of four or more vertices.
static boolean	GraphTests.isClique(Graph graph, int[] vertices)	Checks if the specified vertices represent a clique, meaning that the subgraph induced by them is complete.
static boolean	GraphTests.isConnected(Graph graph)	Determines if a graph is connected, meaning that there exists a path between every pair of vertices.
static boolean	GraphTests.isCubic(Graph graph)	Determines if a graph is cubic, meaning that all of its vertices have degree 3.
static boolean	GraphTests.isEulerian(Graph graph)	Determines if a graph is Eulerian, that is it contains a circuit passing through all of its edges.
static boolean	GraphTests.isForest(Graph graph)	Determines if a graph is a forest, an undirected and acyclic graph.
static boolean	GraphTests.isOverfull(Graph graph)	Checks if a graph is overfull, meaning its size is greater than the product of its maximum degree and half of its order floored: |E| > Δ(G) |V|/2, where Δ(G) is the maximum degree of the graph.
static boolean	GraphUtils.isPartitionValid(Graph graph, List<? extends VertexCollection> subsets)	Checks if a vertex partition is valid, meaning the subsets are disjoint and cover all vertices in the graph.
static boolean	GraphTests.isRegular(Graph graph)	Determines if the graph is regular, that is a graph where each vertex has the same number of neighbors (degree).
static boolean	GraphTests.isRegular(Graph graph, int k)	Determines if the graph is k-regular, that is a graph where each vertex has exactly k neighbors.
static boolean	GraphTests.isStableSet(Graph graph, int[] vertices)	Checks if the specified vertices represent a stable set, meaning that the subgraph induced by them is edgeless.
static boolean	GraphTests.isTree(Graph graph)	Determines if a graph is a tree, that is an undirected, connected and acyclic graph.
static boolean	GraphTests.isTriangleFree(Graph graph)	Determines if a graph is triangle-free, that is no three distinct vertices form a triangle.
static Graph	GraphUtils.join(Graph... graphs)	Performs the join operation on the specified graphs.
static Graph	GraphUtils.mapVertexNumbers(Graph graph, int[] vertices)	Creates a new graph by mapping the vertex numbers in the input graph to the specified values, while preserving the edges.
static Graph	GraphUtils.rotate(Graph graph, int distance)	Creates a new graph by rotating the vertex numbers in the input graph by a specified distance, while preserving the edges.
static Graph	GraphUtils.shuffle(Graph graph)	Creates a new graph by shuffling the vertex numbers in the input graph, while preserving the edges.
static Digraph	GraphUtils.toDigraph(Graph graph)	The corresponding directed graph of an undirected graph G has all the vertices of G and a pair of symmetrical arcs for each edge of G.
static Network	GraphUtils.toNetwork(Graph graph)	Creates a network having the same vertices and edges as the specified graph.
static Network	GraphUtils.toNetwork(Graph graph, int source, int sink)	Creates a network having the same vertices and edges as the specified graph.
static Graph	GraphUtils.union(Graph... graphs)	Performs the union of the specified graph.
static GraphBuilder	GraphBuilder.verticesFrom(Graph graph)	Creates a new graph having the same vertex numbers as the specified graph.
static NetworkBuilder	NetworkBuilder.verticesFrom(Graph graph)	Creates a new network having the same vertex numbers as the specified graph.

Method parameters in org.graph4j with type arguments of type Graph

Modifier and Type	Method	Description
static Graph	GraphUtils.createIntersectionGraph(List<Graph> graphs, boolean vertexLabeled)	Creates the intersection graph of the vertex sets of the specified graphs.An intersection graph is a graph where each vertex corresponds to a set, and there is an edge between two vertices if and only if the corresponding sets intersect.

Constructors in org.graph4j with parameters of type Graph

Modifier	Constructor	Description
	GraphAlgorithm(Graph graph)	Constructs an algorithm which will be executed on the input graph.
	SimpleGraphAlgorithm(Graph graph)	Creates a new instance of the algorithm.
	UndirectedGraphAlgorithm(Graph graph)	Creates a new instance of the algorithm.

Uses of Graph in org.graph4j.clique

Methods in org.graph4j.clique with parameters of type Graph

Modifier and Type	Method	Description
static CliqueIterator	CliqueIterator.getInstance(Graph graph)
static MaximalCliqueIterator	MaximalCliqueIterator.getInstance(Graph graph)

Constructors in org.graph4j.clique with parameters of type Graph

Modifier	Constructor	Description
	BFSCliqueIterator(Graph graph)
	BFSCliqueIterator(Graph graph, int minSize, int maxSize)
	BoundedCliqueIterator(Graph graph, int minSize, int maxSize)	Deprecated.
	BoundedCliqueIterator(Graph graph, int minSize, int maxSize, long timeout)	Deprecated.
	BronKerboschCliqueFinder(Graph graph)	Deprecated.
	BronKerboschCliqueIterator(Graph graph)
	BronKerboschCliqueIterator(Graph graph, boolean shuffle, boolean useAdjacencyMatrix)	Using the adjacency matrix allows for a slightly faster execution of the algorithm, at the expense of using more memory.Not recommended for large sparse graphs.
	DFSCliqueIterator(Graph graph)
	DFSCliqueIterator(Graph graph, int minSize, int maxSize)
	DFSCliqueIterator(Graph graph, int minSize, int maxSize, long timeout)
	MaximalCliqueFinder(Graph graph)

Uses of Graph in org.graph4j.coloring

Fields in org.graph4j.coloring declared as Graph

Modifier and Type	Field	Description
protected final Graph	Coloring.graph

Methods in org.graph4j.coloring that return Graph

Modifier and Type	Method	Description
Graph	Coloring.getGraph()
Graph	ColoringAlgorithm.getGraph()	Returns the input graph.

Methods in org.graph4j.coloring with parameters of type Graph

Modifier and Type	Method	Description
protected BacktrackColoring	BacktrackColoring.getInstance(Graph graph, long timeLimit)
static ColoringAlgorithm	ColoringAlgorithm.getInstance(Graph graph)	Returns the default implementation of this interface.
protected abstract ColoringAlgorithm	ExactColoringBase.getInstance(Graph graph, long timeLimit)

Constructors in org.graph4j.coloring with parameters of type Graph

Modifier	Constructor	Description
	BacktrackColoring(Graph graph)
	BacktrackColoring(Graph graph, long timeLimit)
	BacktrackColoring(Graph graph, Coloring initialColoring)
	BacktrackColoring(Graph graph, Coloring initialColoring, long timeLimit)
	BacktrackColoringBase(Graph graph)
	BacktrackColoringBase(Graph graph, long timeLimit)
	BacktrackColoringBase(Graph graph, Coloring initialColoring)
	BacktrackColoringBase(Graph graph, Coloring initialColoring, long timeLimit)
	Coloring(Graph graph)	Creates an empty coloring - no vertex has a color assigned to it.
	Coloring(Graph graph, int[] colors)	Creates a vertex coloring using the colors in the given array: the color of the vertex with index i in the graph is colors[i].
	Coloring(Graph graph, List<VertexSet> colorClasses)	Creates a vertex coloring using the specified color classes: all the vertices in the i-th set of the colorClasses list are assigned color i.
	Coloring(Graph graph, Coloring other)
	DSaturGreedyColoring(Graph graph)
	ExactColoringBase(Graph graph)
	ExactColoringBase(Graph graph, long timeLimit)
	ExactColoringBase(Graph graph, Coloring initialColoring)
	ExactColoringBase(Graph graph, Coloring coloring, long timeLimit)
	GreedyColoring(Graph graph)	The vertices will be colored in the order of their graph indices.
	GreedyColoring(Graph graph, int[] vertexOrdering)	Creates a greedy algorithm that will color the vertices of the graph in the specified order.
	GreedyColoring(Graph graph, int[] vertexOrdering, boolean validateOrdering)	Creates a greedy algorithm that will color the vertices of the graph in the specified order.Validation of the ordering is optional.
	GreedyColoringBase(Graph graph)
	LargestDegreeFirstColoring(Graph graph)	The vertices will be colored in decreasing order by their degree.
	RandomGreedyColoring(Graph graph)	The vertices will be colored in a randomly chosen order.
	RecursiveLargestFirstColoring(Graph graph)
	SmallestDegreeLastColoring(Graph graph)

Uses of Graph in org.graph4j.coloring.bw

Methods in org.graph4j.coloring.bw with parameters of type Graph

Modifier and Type	Method	Description
protected BacktrackBandwithColoring	BacktrackBandwithColoring.getInstance(Graph graph, long timeLimit)
static ColoringAlgorithm	BandwithColoringAlgorithm.getInstance(Graph graph)	Returns the default implementation of this interface.

Constructors in org.graph4j.coloring.bw with parameters of type Graph

Modifier	Constructor	Description
	BacktrackBandwithColoring(Graph graph)
	BacktrackBandwithColoring(Graph graph, long timeLimit)
	BacktrackBandwithColoring(Graph graph, Coloring initialColoring)
	BacktrackBandwithColoring(Graph graph, Coloring initialColoring, long timeLimit)
	GreedyBandwithColoring(Graph graph)

Uses of Graph in org.graph4j.coloring.eq

Methods in org.graph4j.coloring.eq with parameters of type Graph

Modifier and Type	Method	Description
protected BacktrackEquitableColoring	BacktrackEquitableColoring.getInstance(Graph graph, long timeLimit)
static ColoringAlgorithm	EquitableColoringAlgorithm.getInstance(Graph graph)	Returns the default implementation of this interface.

Constructors in org.graph4j.coloring.eq with parameters of type Graph

Modifier	Constructor	Description
	BacktrackEquitableColoring(Graph graph)
	BacktrackEquitableColoring(Graph graph, long timeLimit)
	BacktrackEquitableColoring(Graph graph, Coloring initialColoring)
	BacktrackEquitableColoring(Graph graph, Coloring initialColoring, long timeLimit)
	GreedyEquitableColoring(Graph graph)
	GreedyEquitableColoring(Graph graph, Coloring initialColoring)

Uses of Graph in org.graph4j.connectivity

Methods in org.graph4j.connectivity that return Graph

Modifier and Type	Method	Description
default Graph	BiconnectivityAlgorithm.computeBlockCutTree()	A block-cut tree (also known as BC-tree) is a tree that represents the blocks and articulation points (cut vertices) of a graph.
default Graph	BiconnectivityAlgorithm.computeBlockGraph()	The block graph has one vertex for each block, and an edge between two vertices whenever their corresponding blocks share a vertex (an articulation point).
Graph	ConnectivityAlgorithm.getConnectedComponent(int v)	Returns the connected component the specified vertex belongs to.

Methods in org.graph4j.connectivity that return types with arguments of type Graph

Modifier and Type	Method	Description
List<Graph>	ConnectivityAlgorithm.getConnectedComponents()	Returns the connected components of the graph.

Methods in org.graph4j.connectivity with parameters of type Graph

Modifier and Type	Method	Description
static BiconnectivityAlgorithm	BiconnectivityAlgorithm.getInstance(Graph graph)	Returns the default implementation of this interface.

Constructors in org.graph4j.connectivity with parameters of type Graph

Modifier	Constructor	Description
	BridgeDetectionAlgorithm(Graph graph)
	ConnectivityAlgorithm(Graph graph)	Creates an algorithm for analyzing the connectivity of a graph.
	EdgeConnectivityAlgorithm(Graph graph)	Creates an algorithm for determining the edge connectivity of a graph.
	EdgeCut(Graph graph)	Creates an empty edge cut.
	EdgeCut(Graph graph, int[] leftSide, Double weight)	Creates a new edge cut.
	EdgeCut(Graph graph, EdgeSet edges, Double weight)	Creates a new edge cut.
	StoerWagnerMinimumCut(Graph graph)	Creates an algorithm for computing the minimum weighted cut.
	StoerWagnerMinimumCut(Graph graph, boolean ignoreWeights)	Creates an algorithm for computing the minimum weighted/cardinality cut.
	StoerWagnerMinimumCut1(Graph graph)	Creates an algorithm for computing the minimum weighted cut.
	StoerWagnerMinimumCut1(Graph graph, boolean ignoreWeights)	Creates an algorithm for computing the minimum weighted/cardinality cut.
	StoerWagnerMinimumCut2(Graph graph)	Creates an algorithm for computing the minimum weighted cut.
	StoerWagnerMinimumCut2(Graph graph, boolean ignoreWeights)	Creates an algorithm for computing the minimum weighted/cardinality cut.
	StoerWagnerMinimumCut3(Graph graph)	Creates an algorithm for computing the minimum weighted cut.
	StoerWagnerMinimumCut3(Graph graph, boolean ignoreWeights)	Creates an algorithm for computing the minimum weighted/cardinality cut.
	TarjanBiconnectivity(Graph graph)
	VertexConnectivityAlgorithm(Graph graph)	Creates an algorithm for determining the vertex connectivity of a graph.

Uses of Graph in org.graph4j.converters

Methods in org.graph4j.converters that return Graph

Modifier and Type	Method	Description
Graph	PruferTreeDecoder.createTree()	Decodes a Prufer sequence to a tree.

Constructors in org.graph4j.converters with parameters of type Graph

Modifier	Constructor	Description
	PruferTreeEncoder(Graph tree)	Creates a new encoder.

Uses of Graph in org.graph4j.eulerian

Methods in org.graph4j.eulerian with parameters of type Graph

Modifier and Type	Method	Description
static EulerianCircuitAlgorithm	EulerianCircuitAlgorithm.getInstance(Graph graph)	Returns the default implementation of the algorithm.

Constructors in org.graph4j.eulerian with parameters of type Graph

Modifier	Constructor	Description
	EulerianCircuitAlgorithmBase(Graph graph)
	HierholzerEulerianCircuit(Graph graph)
	HierholzerEulerianTrail(Graph graph)

Uses of Graph in org.graph4j.generators

Methods in org.graph4j.generators that return Graph

Modifier and Type	Method	Description
static Graph	GraphGenerator.complete(int numVertices)	Generates a complete graph.
static Graph	GraphGenerator.completeBipartite(int n1, int n2)	Generates a complete bipartite graph.
static Graph	GraphGenerator.completeMultipartite(int... numVertices)	Generates a complete multipartite graph.
static Graph	GraphGenerator.completeTree(int numLevels, int degree)	Generates a complete tree.
Graph	CompleteMultipartiteGenerator.create()	Creates a complete multipartite graph.
Graph	CompleteTreeGenerator.create()
Graph	FanGenerator.create()	Creates a fan graph by performing the union of the empty graph and the path graph.
Graph	KingGraphGenerator.create()	Vertices are numbered from left to right and from top to bottom.
Graph	MycielskiGenerator.create(int chromaticNumber)	Creates a Mycielski graph with the specified chromatic number.
Graph	RandomMultipartiteGenerator.create()	Creates a random multipartite graph.
Graph	RandomGnmGraphGenerator.createConnectedGraph()
Graph	RandomForestGenerator.createForest()	Creates a random forest.
Graph	MycielskiGenerator.createFrom(Graph graph, int chromaticNumber)	Creates a Mycielski graph starting from a specified graph.
Graph	AbstractBipartiteGenerator.createGraph()
Graph	BarabasiAlbertGenerator.createGraph()
Graph	CompleteBipartiteGenerator.createGraph()
Graph	CompleteGraphGenerator.createGraph()
Graph	CycleGenerator.createGraph()
Graph	GridGenerator.createGraph()	Vertices are numbered from left to right and from top to bottom.
Graph	PathGenerator.createGraph()
Graph	RandomChordalGraphGenerator.createGraph()	Creates a random chordal graph.
Graph	RandomGnmGraphGenerator.createGraph()
Graph	RandomGnpGraphGenerator.createGraph()
Graph	RandomHamiltonianGenerator.createGraph()
Graph	RandomKNNGenerator.createGraph()
Graph	RandomLayeredGenerator.createGraph()
Graph	RandomOreGraphGenerator.createGraph()
Graph	RandomUnitDiskGenerator.createGraph()	Creates a random unit disk graph.
Graph	RegularGraphGenerator.createGraph()
Graph	StarGenerator.createGraph()
Graph	WattsStrogatzGenerator.createGraph()
Graph	WheelGenerator.createGraph()	Creates a wheel graph.
Graph	RandomTreeGenerator.createTree()	Creates a random tree.
static Graph	GraphGenerator.cycle(int numVertices)	Generates a random cycle graph.
static Graph	GraphGenerator.empty(int numVertices)	Creates a graph with a specified number of vertices and no edges.
static Graph	GraphGenerator.fan(int m, int n)	Generates a fan graph (a join between an empty graph and a path).
Graph	FanGenerator.getEmptyGraph()	Returns the empty graph used to create the fan.
Graph	FanGenerator.getPathGraph()	Returns the path graph used to create the fan.
static Graph	GraphGenerator.grid(int rows, int cols)	Generates a grid graph.
static Graph	GraphGenerator.mycielski(int chromaticNumber)	Generates a Mycielski graph with the specified chromatic number.
static Graph	GraphGenerator.path(int numVertices)	Generates a random path graph.
static Graph	GraphGenerator.randomChordalGraph(int numVertices)	Generates a random chordal graph.
static Graph	GraphGenerator.randomForest(int numVertices)	Generates a random forest.
static Graph	GraphGenerator.randomGnm(int numVertices, int numEdges)	Generates a random G(n,m) graph.
static Graph	GraphGenerator.randomGnmBipartite(int n1, int n2, int m)	Generates a random Gnm bipartite graph.
static Graph	GraphGenerator.randomGnp(int numVertices, double edgeProbability)	Generates a random G(n,p) graph.
static Graph	GraphGenerator.randomGnpBipartite(int n1, int n2, double edgeProbability)	Generates a random G(n,p) bipartite graph.
static Graph	GraphGenerator.randomTree(int numVertices)	Generates a random tree.
static Graph	GraphGenerator.regular(int numVertices, int degree)	Generates a regular graph.
static Graph	GraphGenerator.star(int numVertices)	Generates a random star graph.
static Graph	GraphGenerator.trivial(int vertexNumber)	Creates a graph with a single vertex having the specified number.
static Graph	GraphGenerator.wheel(int numVertices)	Generates a random wheel graph.

Methods in org.graph4j.generators with parameters of type Graph

Modifier and Type	Method	Description
protected abstract void	AbstractBipartiteGenerator.addEdges(Graph g, Boolean leftToRight)
protected void	CompleteBipartiteGenerator.addEdges(Graph g, Boolean leftToRight)
protected void	RandomGnmBipartiteGenerator.addEdges(Graph g, Boolean leftToRight)
protected void	RandomGnpBipartiteGenerator.addEdges(Graph g, Boolean leftToRight)
protected void	AbstractGraphGenerator.addRandomEdges(Graph g, double edgeProbability)
static void	EdgeWeightsGenerator.consecutiveIntegers(Graph graph)	Each edge will receive a distinct weight, between 0 and numEdges - 1.
Graph	MycielskiGenerator.createFrom(Graph graph, int chromaticNumber)	Creates a Mycielski graph starting from a specified graph.
static void	EdgeWeightsGenerator.fill(Graph graph, double value)
static void	VertexWeightsGenerator.fill(Graph graph, double value)
static void	EdgeWeightsGenerator.randomDoubles(Graph graph, double min, double max)
static void	VertexWeightsGenerator.randomDoubles(Graph graph, double min, double max)
static void	EdgeWeightsGenerator.randomIntegers(Graph graph, int min, int max)
static void	VertexWeightsGenerator.randomIntegers(Graph graph, int min, int max)

Constructors in org.graph4j.generators with parameters of type Graph

Modifier	Constructor	Description
	BarabasiAlbertGenerator(Graph initialGraph, int edgesPerVertex, int numVertices)
	EdgeDataGenerator(Graph graph, int dataType)	Creates a generator for setting random or specific values on the edges of a graph.The data type of the values may be Graph.WEIGHT, Network.CAPACITY, Network.COST or user defined.

Uses of Graph in org.graph4j.hamiltonian

Methods in org.graph4j.hamiltonian with parameters of type Graph

Modifier and Type	Method	Description
static HamiltonianCycleAlgorithm	HamiltonianCycleAlgorithm.getInstance(Graph graph)
static HamiltonianPathAlgorithm	HamiltonianPathAlgorithm.getInstance(Graph graph)

Constructors in org.graph4j.hamiltonian with parameters of type Graph

Modifier	Constructor	Description
	BacktrackLongestPathAlgoritm(Graph graph)
	PalmerHamiltonianCycle(Graph graph)

Uses of Graph in org.graph4j.io

Methods in org.graph4j.io that return Graph

Modifier and Type	Method	Description
Graph	DimacsIO.read(String file)

Uses of Graph in org.graph4j.isomorphism

Methods in org.graph4j.isomorphism that return Graph

Modifier and Type	Method	Description
Graph	TreeIsomorphism.getTree1()	The first tree.
Graph	TreeIsomorphism.getTree2()	The second tree.

Methods in org.graph4j.isomorphism with parameters of type Graph

Modifier and Type	Method	Description
default boolean	IsomorphismAlgorithm.checkTrivialConditions(Graph graph1, Graph graph2)	Performs some trivial checks in order to determine if two graphs may be isomorphic.

Constructors in org.graph4j.isomorphism with parameters of type Graph

Modifier	Constructor	Description
	AbstractGraphIsomorphism(Graph g1, Graph g2)
	AbstractGraphIsomorphism(Graph g1, Graph g2, boolean cache)	Constructor for the AbstractGraphIsomorphism class.
	ForestIsomorphism(Graph forest1, Graph forest2)	Constructor for the forest isomorphism algorithm.
	Isomorphism(Graph graph1, Graph graph2, int[] mapping, int[] inverse)	Creates an isomorphism between two graphs.
	RootedForestIsomorphism(Graph forest1, Graph forest2, VertexSet roots1, VertexSet roots2)	Constructor for the rooted forest isomorphism algorithm.
	RootedTreeIsomorphism(Graph tree1, Graph tree2, int root1, int root2)	Constructor for the rooted tree isomorphism algorithm.
	TreeIsomorphism(Graph tree1, Graph tree2)	Constructor for the tree isomorphism algorithm.
	UllmanExactGraphIsomorphism(Graph g1, Graph g2)
	UllmanExactGraphIsomorphism(Graph g1, Graph g2, boolean cache)
	UllmanSubGraphIsomorphism(Graph g1, Graph g2)
	UllmanSubGraphIsomorphism(Graph g1, Graph g2, boolean cache)
	VF2ExactGraphIsomorphism(Graph g1, Graph g2)
	VF2ExactGraphIsomorphism(Graph g1, Graph g2, boolean cache)
	VF2SubGraphIsomorphism(Graph g1, Graph g2)
	VF2SubGraphIsomorphism(Graph g1, Graph g2, boolean cache)

Uses of Graph in org.graph4j.matching

Methods in org.graph4j.matching that return Graph

Modifier and Type	Method	Description
Graph	MatchingAlgorithm.getGraph()

Constructors in org.graph4j.matching with parameters of type Graph

Modifier	Constructor	Description
	EdmondsMaximumMatching(Graph graph)
	GreedyWeightedMatching(Graph graph)	Creates a maximal weighted matching algorithm that iterates over the edges of the graph in the descending order given by their normalized weight.
	GreedyWeightedMatching(Graph graph, boolean normalized)	Creates a maximal weighted matching algorithm that iterates over the edges of the graph in the descending order given by theier wight or normalized weight.
	GreedyWeightedMatching(Graph graph, Comparator<Edge> comparator)	Creates a maximal matching algorithm that iterates over the edges of the graph in the order given by a specified comparator.
	HopcroftKarpMaximumMatching(Graph graph)	Creates an algorithm for determining a maximum matching in a bipartite graph.
	HopcroftKarpMaximumMatching(Graph graph, StableSet leftSide, StableSet rightSide)	Creates an algorithm for determining a maximum matching in a bipartite graph.
	MaximalCardinalityMatching(Graph graph)	Creates a maximal matching algorithm that iterates over the edges of the graph in the order given by the sum of degrees of the edges endpoints.This method has O(m + m log n) time complexity and produces, in general, better results than the random version.
	MaximalCardinalityMatching(Graph graph, boolean random)	Creates a maximal matching algorithm that iterates over the edges of the graph in a random order (random=true) or in the order in which the edges are internally stored (random=false).This method has O(m) time complexity.
	MaximalCardinalityMatching(Graph graph, Comparator<Edge> comparator)	Creates a maximal matching algorithm that iterates over the edges of the graph in the order given by a specified comparator.This method has O(m + m log n) time complexity.

Uses of Graph in org.graph4j.measures

Methods in org.graph4j.measures with parameters of type Graph

Modifier and Type	Method	Description
static double	GraphMeasures.avgDegree(Graph graph)
static double[]	GraphMeasures.degreeDistribution(Graph graph)	The degree distribution is the probability distribution P of the graph degrees over the whole graph.
static int[]	GraphMeasures.degreeHistogram(Graph graph)	The degree histogram counts how many vertices have a specific degree in the graph.
static double	GraphMeasures.density(Graph graph)
static int	GraphMeasures.maxDegree(Graph graph)
static int	GraphMeasures.maxDegreeVertex(Graph graph)
static int	GraphMeasures.minDegree(Graph graph)	Determines the minimum degree of the vertices.
static int	GraphMeasures.minDegreeVertex(Graph graph)	Determines a vertex with minimum degree.
static long	GraphMeasures.numberOfTriangles(Graph graph)	A triangle is formed by three distinct vertices connected all with each other.
static long	GraphMeasures.numberOfTriplets(Graph graph)	A triplet is formed by three distinct vertices that are connected by either two (open triplet) or three (closed triplet) undirected edges.

Constructors in org.graph4j.measures with parameters of type Graph

Modifier	Constructor	Description
	TriangleCounter(Graph graph)

Uses of Graph in org.graph4j.metrics

Constructors in org.graph4j.metrics with parameters of type Graph

Modifier	Constructor	Description
	GraphMetrics(Graph graph)
	TreeExtremaCalculator(Graph graph)
	TreeExtremaCalculator(Graph graph, int startVertex)
	TreeMetrics(Graph graph)

Uses of Graph in org.graph4j.ordering

Methods in org.graph4j.ordering with parameters of type Graph

Modifier and Type	Method	Description
static int[]	VertexOrderings.breadthFirst(Graph graph, int startVertex)	Creates an array containing the vertices of the graph in the order produced by a BFS (Breadth First Search) traversal.
static int[]	VertexOrderings.depthFirst(Graph graph, int startVertex)	Creates an array containing the vertices of the graph in the order produced by a DFS (Depth First Search) traversal.
static int[]	VertexOrderings.largestDegreeFirst(Graph graph)	Creates an array containing the vertices of the graph in decreasing order by their degree.
static int[]	VertexOrderings.lexBFS(Graph graph)	Creates an array containing the vertices of the graph in the order produced by the Lexicographic Breadth-First Search algorithm.
static int[]	VertexOrderings.maximumCardinality(Graph graph)	Creates an array containing the vertices of the graph in the order produced by the Maximum Cardinality Search (MCS) algorithm.
static int[]	VertexOrderings.smallestDegreeFirst(Graph graph)	Creates an array containing the vertices of the graph in increasing order by their degree.
static int[]	VertexOrderings.smallestDegreeLast(Graph graph)	Computes the vertex ordering from the end to the beginning: at each step, the node of minimum degree in the current graph is selected and then it is removed from the graph.

Constructors in org.graph4j.ordering with parameters of type Graph

Modifier	Constructor	Description
	AcyclicOrientation(Graph graph)
	AcyclicOrientation(Graph graph, int[] vertexOrdering)
	SmallestDegreeLastOrdering(Graph graph)

Uses of Graph in org.graph4j.realization

Methods in org.graph4j.realization that return Graph

Modifier and Type	Method	Description
Graph	BipartiteRealizationAlgorithm.getGraph()	Creates a bipartite graph with the specified degree sequence.
Graph	GraphRealizationAlgorithm.getGraph()	Creates a graph with the specified degree sequence.
Graph	HavelHakimiBipartiteRealization.getGraph()
Graph	HavelHakimiGraphRealization.getGraph()

Uses of Graph in org.graph4j.route

Methods in org.graph4j.route with parameters of type Graph

Modifier and Type	Method	Description
Path	PathFinder.findShortestPath(Graph graph, int v, int u, int[] forbiddenVertices)	Finds the path with the fewest edges connecting two vertices.

Constructors in org.graph4j.route with parameters of type Graph

Modifier	Constructor	Description
	CycleFinder(Graph graph)
	MaximumInducedPath(Graph graph)
	PathFinder(Graph graph)

Uses of Graph in org.graph4j.shortestpath

Methods in org.graph4j.shortestpath that return Graph

Modifier and Type	Method	Description
Graph	AllPairsShortestPath.getGraph()	Returns the input graph on which the algorithm is executed.
Graph	SinglePairShortestPath.getGraph()	Returns the input graph on which the algorithm is executed.
Graph	SingleSourceShortestPath.getGraph()

Methods in org.graph4j.shortestpath with parameters of type Graph

Modifier and Type	Method	Description
static AllPairsShortestPath	AllPairsShortestPath.getInstance(Graph graph)	Returns the default implementation of this interface.
static SinglePairShortestPath	SinglePairShortestPath.getInstance(Graph graph, int source, int target)	Returns the default implementation of this interface.
static SingleSourceShortestPath	SingleSourceShortestPath.getInstance(Graph graph, int source)	Returns the default implementation of this interface.

Constructors in org.graph4j.shortestpath with parameters of type Graph

Modifier	Constructor	Description
	AStarAlgorithm(Graph graph, int source, int target, AStarEstimator heuristic)	Creates an algorithm to find the shortest path between source and target.
	BellmanFordShortestPath(Graph graph, int source)	Creates an algorithm to find all shortest paths starting in the source.
	BFSAllPairsShortestPath(Graph graph)	Creates an algorithm for finding all pair shortest paths in an unweighted graph.
	BFSSinglePairShortestPath(Graph graph, int source, int target)	Creates an algorithm to find the path with the fewest edges between two specified vertices.
	BFSSinglePairShortestPath(Graph graph, int source, int target, int[] forbiddenVertices)	Creates an algorithm to find the path with the fewest edges between two specified vertices, not passing through some forbidden vertices.
	BFSSingleSourceShortestPath(Graph graph, int source)	Creates an algorithm to find all shortest paths starting in the specified source, in an unweighted graph.
	BidirectionalDijkstra(Graph graph, int source, int target)	Creates an algorithm to find the shortest path between source and target.
	DijkstraShortestPathBase(Graph graph, int source)	Creates an algorithm to find all shortest paths starting in the source.
	DijkstraShortestPathDefault(Graph graph, int source)
	DijkstraShortestPathHeap(Graph graph, int source)
	FloydWarshallShortestPath(Graph graph)
	JohnsonShortestPath(Graph graph)

Uses of Graph in org.graph4j.spanning

Fields in org.graph4j.spanning declared as Graph

Modifier and Type	Field	Description
protected final Graph	WeightedSpanningTreeIterator.graph
protected Graph	MinimumSpanningTreeBase.tree

Methods in org.graph4j.spanning that return Graph

Modifier and Type	Method	Description
Graph	MinimumSpanningTreeAlgorithm.getTree()	If the graph is disconnected, this is actually a spanning forest.
Graph	MinimumSpanningTreeBase.getTree()
Graph	ParallelFilterKruskal.getTree()

Methods in org.graph4j.spanning with parameters of type Graph

Modifier and Type	Method	Description
static MinimumSpanningTreeAlgorithm	MinimumSpanningTreeAlgorithm.getInstance(Graph graph)

Constructors in org.graph4j.spanning with parameters of type Graph

Modifier	Constructor	Description
	BoruvkaMinimumSpanningTreeBase(Graph graph)
	BoruvkaMinimumSpanningTreeDefault(Graph graph)
	BoruvkaMinimumSpanningTreeParallel(Graph graph)
	BoruvkaMinimumSpanningTreeParallel(Graph graph, int nrThreads)
	KruskalMinimumSpanningTree(Graph graph)
	MinimumSpanningTreeBase(Graph graph)
	MinimumSpanningTreeIterator(Graph graph)	Creates an iterator over the minimum spanning trees of a weighted graph.
	ParallelFilterKruskal(Graph graph)
	PrimMinimumSpanningTree(Graph graph)
	SpanningTreeIterator(Graph graph)	Creates an iterator over the spanning trees of a graph.
	WeightedSpanningTreeIterator(Graph graph)	Creates an iterator over the spanning trees of the specified graph, in ascending order of their weight.
	WeightedSpanningTreeIterator(Graph graph, boolean ascending)	Creates an iterator over the spanning trees of the specified graph, in ascending or descending order by their weight.

Uses of Graph in org.graph4j.support

Constructors in org.graph4j.support with parameters of type Graph

Modifier	Constructor	Description
	BipartiteGraphSupport(Graph graph)	Creates an instance of the support class.
	ChordalGraphSupport(Graph graph)	Creates an instance of the support class.

Uses of Graph in org.graph4j.traversal

Constructors in org.graph4j.traversal with parameters of type Graph

Modifier	Constructor	Description
	BFSIterator(Graph graph)	Creates an iterator starting with the first vertex of the graph (the one at index 0)
	BFSIterator(Graph graph, int start)	Creates an iterator starting with the specified vertex.
	BFSIterator(Graph graph, int start, int[] forbiddenVertices, boolean reverse)	Creates an iterator starting with the specified vertex, traversing a directed graph either in the direction of the arcs, or in reversed direction.
	BFSTraverser(Graph graph)
	DFSIterator(Graph graph)
	DFSIterator(Graph graph, int start)
	DFSTraverser(Graph graph)
	LexBFSIterator(Graph graph)	Creates an iterator starting with the first vertex of the graph (the one at index 0)
	LexBFSIterator(Graph graph, int start)	Creates an iterator starting with the specified vertex.
	LexBFSIteratorInt(Graph graph)	Deprecated. Creates an iterator starting with the first vertex of the graph (the one at index 0)
	LexBFSIteratorInt(Graph graph, int start)	Deprecated. Creates an iterator starting with the specified vertex.
	MaximumCardinalityIterator(Graph graph)	Creates an iterator starting with the first vertex of the graph (the one at index 0)
	MaximumCardinalityIterator(Graph graph, int start)	Creates an iterator starting with the specified vertex.

Uses of Graph in org.graph4j.util

Fields in org.graph4j.util declared as Graph

Modifier and Type	Field	Description
protected final Graph	EdgeArray.graph	Deprecated.
protected Graph	EdgeSet.graph
protected Graph	VertexCollection.graph

Methods in org.graph4j.util that return Graph

Modifier and Type	Method	Description
Graph	VertexCollection.getGraph()
Graph	RootedTree.tree()	Returns the tree.

Methods in org.graph4j.util with parameters of type Graph

Modifier and Type	Method	Description
static void	Validator.checkVertexIndex(Graph graph, int index)	Checks if a specified integer is a valid index in a graph, i.e. it is in the range 0 to graph.numVertices()-1.
static void	Validator.checkVertexOrdering(Graph graph, int[] ordering)	Checks if a specified ordering is valid, meaning it is a permutation of the vertices of the graph.
static void	Validator.containsEdge(Graph graph, int v, int u)	Checks if a graph contains an edge.
static void	Validator.containsEdge(Graph graph, Edge e)	Checks if a graph contains an edge.
static void	Validator.containsVertex(Graph graph, int v)	Checks if a graph contains a vertex.
static void	Validator.containsVertices(Graph graph, int... vertices)	Checks if a graph contains an array of vertices.
static void	Validator.haveDisjointVertices(Graph g1, Graph g2)	Checks if the vertex sets of two graphs are disjoint.
static void	Validator.requireNonEmpty(Graph graph)	Checks that the specified graph is not empty.
static void	Validator.requireSimple(Graph graph)	Checks if a graph is simple, i.e. undirected, does not allow multiple edges and does not allow self loops.
static void	Validator.requireUndirected(Graph graph)	Checks if a graph is undirected.

Constructors in org.graph4j.util with parameters of type Graph

Modifier	Constructor	Description
	Block(Graph graph)
	Block(Graph graph, int initialCapacity)
	Block(Graph graph, int[] vertices)
	Circuit(Graph graph)
	Circuit(Graph graph, int initialCapacity)
	Circuit(Graph graph, int[] vertices)
	Clique(Graph graph)
	Clique(Graph graph, int initialCapacity)
	Clique(Graph graph, int[] vertices)
	Cycle(Graph graph)
	Cycle(Graph graph, int initialCapacity)
	Cycle(Graph graph, int[] vertices)
	EdgeArray(Graph graph)	Deprecated.
	EdgeArray(Graph graph, int initialCapacity)	Deprecated.
	EdgeArray(Graph graph, int[][] edges)	Deprecated.
	EdgeArray(Graph graph, Edge[] edges)	Deprecated.
	EdgeSet(Graph graph)	Constructs a new, empty set of edges.
	EdgeSet(Graph graph, int initialCapacity)	Constructs a new, empty set of edges, with a specified initial capacity.
	EdgeSet(Graph graph, Collection<Edge> edges)	Constructs a new set containing the elements in the specified collection.
	EdgeSet(Graph graph, Edge[] edges)	Constructs a new set containing the elements in the specified array.
	Matching(Graph graph)
	Path(Graph graph)
	Path(Graph graph, int initialCapacity)
	Path(Graph graph, int[] vertices)
	RootedTree(Graph tree, int root)	Creates a rooted tree.
	StableSet(Graph graph)
	StableSet(Graph graph, int initialCapacity)
	StableSet(Graph graph, int[] vertices)
	Trail(Graph graph)
	Trail(Graph graph, int initialCapacity)
	Trail(Graph graph, int[] vertices)
	VertexCollection(Graph graph)
	VertexCollection(Graph graph, int initialCapacity)
	VertexCollection(Graph graph, int[] vertices)
	VertexHeap(Graph graph, boolean addAll, IntComparator comparator)
	VertexHeap(Graph graph, IntComparator comparator)
	VertexList(Graph graph)
	VertexList(Graph graph, int initialCapacity)
	VertexList(Graph graph, int[] vertices)
	VertexPartition(Graph graph)	Deprecated. Creates a partition of the vertices of the specified graph.
	VertexQueue(Graph graph)
	VertexQueue(Graph graph, int initialCapacity)
	VertexQueue(Graph graph, int[] vertices)
	VertexSet(Graph graph)
	VertexSet(Graph graph, int initialCapacity)
	VertexSet(Graph graph, int[] vertices)
	VertexStack(Graph graph)
	VertexStack(Graph graph, int initialCapacity)
	Walk(Graph graph)
	Walk(Graph graph, int initialCapacity)
	Walk(Graph graph, int[] vertices)

Uses of Graph in org.graph4j.vsp

Methods in org.graph4j.vsp that return Graph

Modifier and Type	Method	Description
Graph	VertexSeparatorAlgorithm.getGraph()	Returns the input graph.

Methods in org.graph4j.vsp with parameters of type Graph

Modifier and Type	Method	Description
static VertexSeparatorAlgorithm	VertexSeparatorAlgorithm.getInstance(Graph graph)	Returns the default implementation of this interface.

Constructors in org.graph4j.vsp with parameters of type Graph

Modifier	Constructor	Description
	BacktrackVertexSeparator(Graph graph)
	BacktrackVertexSeparator(Graph graph, int maxShoreSize)
	GreedyVertexSeparator(Graph graph)
	GreedyVertexSeparator(Graph graph, int maxShoreSize)
	VertexSeparator(Graph graph)	The default maximum shore size is 2n/3, where n is the number of vertices in the graph.
	VertexSeparator(Graph graph, int maxShoreSize)
	VertexSeparatorBase(Graph graph)	Creates an algorithm for computing a vertex separator with the default argument for the maximum shore size of 2n/3, where n is the number of vertices in the graph.
	VertexSeparatorBase(Graph graph, int maxShoreSize)	Creates an algorithm for computing a vertex separator with the specified maximum shore size.