Uses of Interface com.jgalgo.graph.Graph (JGAlgo

Packages that use Graph
Package Description

com.jgalgo

com.jgalgo.example

com.jgalgo.graph

Packages that use Graph
Package	Description
com.jgalgo
com.jgalgo.example
com.jgalgo.graph

Uses of Graph in com.jgalgo

Methods in com.jgalgo with parameters of type Graph
Modifier and Type	Method	Description
`default ShortestPathAllPairs.Result`	ShortestPathAllPairs.`computeAllCardinalityShortestPaths(Graph g)`	Compute the cardinality shortest path between each pair of vertices in a graph.
`ShortestPathAllPairs.Result`	ShortestPathAllPairs.`computeAllShortestPaths(Graph g, WeightFunction w)`	Compute the shortest path between each pair of vertices in a graph.
`BiConnectedComponentsAlgo.Result`	BiConnectedComponentsAlgo.`computeBiConnectivityComponents(Graph g)`	Compute all maximal bi-connected components of a graph.
`default ShortestPathSingleSource.Result`	ShortestPathSingleSource.`computeCardinalityShortestPaths(Graph g, int source)`	Compute the cardinality shortest paths from a source to any other vertex in a graph.
`Coloring.Result`	Coloring.`computeColoring(Graph g)`	Assign a color to each vertex of the given graph, resulting in a valid coloring.
`ConnectedComponentsAlgo.Result`	ConnectedComponentsAlgo.`computeConnectivityComponents(Graph g)`	Find all (strongly) connected components in a graph.
`default CoreAlgo.Result`	CoreAlgo.`computeCores(Graph g)`	Compute the cores of the graph with respect to both in and out degree of the vertices.
`CoreAlgo.Result`	CoreAlgo.`computeCores(Graph g, CoreAlgo.DegreeType degreeType)`	Compute the cores of the graph with respect the given degree type.
`Path`	EulerianTourAlgo.`computeEulerianTour(Graph g)`	Compute an Eulerian tour in the graph that visit all edges exactly once.
`TreePathMaxima.Result`	TreePathMaxima.`computeHeaviestEdgeInTreePaths(Graph tree, WeightFunction w, TreePathMaxima.Queries queries)`	Compute the heaviest edge in multiple tree paths.
`Matching`	MatchingAlgorithm.`computeMaximumCardinalityMatching(Graph g)`	Compute the maximum matching of unweighted undirected graph.
`double`	MaximumFlow.`computeMaximumFlow(Graph g, FlowNetwork net, int source, int sink)`	Calculate the maximum flow in a network between a source and a sink.
`double`	MaximumFlow.`computeMaximumFlow(Graph g, FlowNetwork net, IntCollection sources, IntCollection sinks)`	Calculate the maximum flow in a network between a set of sources and a set of sinks.
`Matching`	MatchingAlgorithm.`computeMaximumWeightedMatching(Graph g, WeightFunction w)`	Compute the maximum weighted matching of a weighted undirected graph.
`Matching`	MatchingAlgorithm.`computeMaximumWeightedPerfectMatching(Graph g, WeightFunction w)`	Compute the maximum perfect matching of a weighted undirected graph.
`void`	MinimumCostFlow.`computeMinCostFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction supply)`	Compute the min-cost (not maximum!) flow in a network given a supply for each vertex.
`void`	MinimumCostFlow.`computeMinCostFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, WeightFunction supply)`	Compute the min-cost (not maximum!) flow in a network given a supply for each vertex and a lower bound for the edges flows.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, int source, int sink)`	Compute the min-cost max-flow in a network between a source and a sink.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, int source, int sink)`	Compute the min-cost max-flow in a network between a source and a sink given a lower bound for the edges flows.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, WeightFunction lowerBound, IntCollection sources, IntCollection sinks)`	Compute the min-cost max-flow in a network between a set of sources and a set of sinks given a lower bound for the edges flows.
`void`	MinimumCostFlow.`computeMinCostMaxFlow(Graph g, FlowNetwork net, WeightFunction cost, IntCollection sources, IntCollection sinks)`	Compute the min-cost max-flow in a network between a set of sources and a set of sinks.
`Cut`	MinimumCutGlobal.`computeMinimumCut(Graph g, WeightFunction w)`	Compute the global minimum cut in a graph.
`Cut`	MinimumCutST.`computeMinimumCut(Graph g, WeightFunction w, int source, int sink)`	Compute the minimum cut in a graph between two terminal vertices.
`Cut`	MinimumCutST.`computeMinimumCut(Graph g, WeightFunction w, IntCollection sources, IntCollection sinks)`	Compute the minimum cut in a graph between two sets of vertices.
`MinimumSpanningTree.Result`	MinimumDirectedSpanningTree.`computeMinimumDirectedSpanningTree(Graph g, WeightFunction w, int root)`	Compute a minimum directed spanning tree (MDST) in a directed graph, rooted at the given vertex.
`Path`	MinimumMeanCycle.`computeMinimumMeanCycle(Graph g, WeightFunction w)`	Compute the minimum mean cycle in a graph.
`MinimumSpanningTree.Result`	MinimumSpanningTree.`computeMinimumSpanningTree(Graph g, WeightFunction w)`	Compute the minimum spanning tree (MST) of a given graph.
`VertexCover.Result`	VertexCover.`computeMinimumVertexCover(Graph g, WeightFunction w)`	Compute a minimum vertex cover of a graph with respect to a vertex weight function.
`Matching`	MatchingAlgorithm.`computeMinimumWeightedMatching(Graph g, WeightFunction w)`	Compute the minimum weighted matching of a weighted undirected graph.
`Matching`	MatchingAlgorithm.`computeMinimumWeightedPerfectMatching(Graph g, WeightFunction w)`	Compute the minimum perfect matching of a weighted undirected graph.
`Path`	ChinesePostman.`computeShortestEdgeVisitorCircle(Graph g, WeightFunction w)`	Compute the shortest circuit that visits all edges in the graph at least once.
`Path`	ShortestPathWithHeuristic.`computeShortestPath(Graph g, WeightFunction w, int source, int target, IntToDoubleFunction vHeuristic)`	Compute the shortest path between two vertices in a graph.
`ShortestPathSingleSource.Result`	ShortestPathSingleSource.`computeShortestPaths(Graph g, WeightFunction w, int source)`	Compute the shortest paths from a source to any other vertex in a graph.
`Path`	TSPMetric.`computeShortestTour(Graph g, WeightFunction w)`	Compute the shortest tour that visit all vertices.
`default ShortestPathAllPairs.Result`	ShortestPathAllPairs.`computeSubsetCardinalityShortestPaths(Graph g, IntCollection verticesSubset)`	Compute the cardinality shortest path between each pair of vertices in a given subset of the vertices of the graph.
`ShortestPathAllPairs.Result`	ShortestPathAllPairs.`computeSubsetShortestPaths(Graph g, IntCollection verticesSubset, WeightFunction w)`	Compute the shortest path between each pair of vertices in a given subset of the vertices of the graph.
`TopologicalOrderAlgo.Result`	TopologicalOrderAlgo.`computeTopologicalSorting(Graph g)`	Compute the topological order of a DAG vertices.
`ConnectedComponentsAlgo.Result`	ConnectedComponentsAlgo.`computeWeaklyConnectivityComponents(Graph g)`	Compute all weakly connected components in a directed graph.
`static boolean`	GraphsUtils.`containsParallelEdges(Graph g)`	Check whether a graph contain parallel edges.
`static boolean`	GraphsUtils.`containsSelfEdges(Graph g)`	Check whether a graph contain self edges.
`static FlowNetwork`	FlowNetwork.`createFromEdgeWeights(Graph g)`	Create a flow network by adding edge weights using `addEdgesWeights(java.lang.Object, java.lang.Class<? super E>)`.
`static FlowNetwork.Int`	FlowNetwork.Int.`createFromEdgeWeights(Graph g)`	Create an integer flow network by adding edge weights using `addEdgesWeights(java.lang.Object, java.lang.Class<? super E>)`.
`Iterator<Path>`	CyclesFinder.`findAllCycles(Graph g)`	Find all cycles in the given graph.
`default Collection<IntCollection>`	MaximalCliques.`findAllMaximalCliques(Graph g)`	Finds all the maximal cliques in a graph.
`static Path`	Path.`findPath(Graph g, int source, int target)`	Find a valid path from \(u\) to \(v\).
`default double`	FlowNetwork.`getFlowSum(Graph g, int source)`	Get the sum of flow units going out of a source vertex.
`default double`	FlowNetwork.`getFlowSum(Graph g, IntCollection sources)`	Get the sum of flow units going out of a set of source vertices.
`static boolean`	Trees.`isForest(Graph g)`	Check if a graph is a forest.
`static boolean`	Trees.`isTree(Graph g)`	Check if an undirected graph is a tree.
`static boolean`	Trees.`isTree(Graph g, int root)`	Check if a graph is a tree rooted as some vertex.
`Iterator<IntCollection>`	MaximalCliques.`iterateMaximalCliques(Graph g)`	Iterate over all maximal cliques in a graph.
`static BFSIter`	BFSIter.`newInstance(Graph g, int source)`	Create a BFS iterator rooted at a single source vertex.
`static DFSIter`	DFSIter.`newInstance(Graph g, int source)`	Create a DFS iterator rooted at some source vertex.
`static BFSIter`	BFSIter.`newInstanceBackward(Graph g, int source)`	Create a backward BFS iterator rooted at a single source vertex.
`LowestCommonAncestorStatic.DataStructure`	LowestCommonAncestorStatic.`preProcessTree(Graph tree, int root)`	Perform a static pre processing of a tree for future LCA (Lowest common ancestor) queries.
`static boolean`	TreePathMaxima.`verifyMST(Graph g, WeightFunction w, IntCollection mstEdges, TreePathMaxima tpmAlgo)`	Verify that the given edges actually form an MST of a graph.

Uses of Graph in com.jgalgo.example

Methods in com.jgalgo.example that return Graph
Modifier and Type	Method	Description
`static Graph`	BfsDfsExample.`createGraph()`
`static Graph`	ColoringExample.`createGraph()`
`static Graph`	MaximumMatchingExample.`createGraph()`

Uses of Graph in com.jgalgo.graph

Subinterfaces of Graph in com.jgalgo.graph
Modifier and Type	Interface	Description
`interface`	`IndexGraph`	A graph whose vertices and edges identifiers are indices.

Methods in com.jgalgo.graph that return Graph
Modifier and Type	Method	Description
`Graph`	GraphBuilder.`build()`	Build a new immutable graph with the builder vertices and edges.
`Graph`	GraphBuilder.`buildMutable()`	Build a new mutable graph with the builder vertices and edges.
`default Graph`	Graph.`copy()`	Create a copy of this graph, with the same vertices and edges, without copying weights.
`default Graph`	Graph.`copy(boolean copyWeights)`	Create a copy of this graph, with the same vertices and edges, with/without copying weights.
`default Graph`	Graph.`immutableCopy()`	Create an immutable copy of this graph, with the same vertices and edges, without copying weights.
`default Graph`	Graph.`immutableCopy(boolean copyWeights)`	Create an immutable copy of this graph, with the same vertices and edges, with/without copying weights.
`default Graph`	Graph.`immutableView()`	Get an immutable view of this graph.
`default Graph`	GraphFactory.`newCopyOf(Graph g)`	Create a copy of a given graph, with the same vertices and edges, without copying weights.
`Graph`	GraphFactory.`newCopyOf(Graph g, boolean copyWeights)`	Create a copy of a given graph, with the same vertices and edges, with/without copying weights.
`Graph`	GraphFactory.`newGraph()`	Create a new empty graph.
`default Graph`	Graph.`reverseView()`	Get a reversed view of this graph.

Methods in com.jgalgo.graph with parameters of type Graph
Modifier and Type	Method	Description
`static <E,WeightsT extends Weights<E>> WeightsT`	Weights.`createExternalEdgesWeights(Graph g, Class<? super E> type)`	Create an external edge weights container.
`static <E,WeightsT extends Weights<E>> WeightsT`	Weights.`createExternalEdgesWeights(Graph g, Class<? super E> type, E defVal)`	Create an external edge weights container with default values.
`static <E,WeightsT extends Weights<E>> WeightsT`	Weights.`createExternalVerticesWeights(Graph g, Class<? super E> type)`	Create an external vertex weights container.
`static <E,WeightsT extends Weights<E>> WeightsT`	Weights.`createExternalVerticesWeights(Graph g, Class<? super E> type, E defVal)`	Create an external vertex weights container with default values.
`default Graph`	GraphFactory.`newCopyOf(Graph g)`	Create a copy of a given graph, with the same vertices and edges, without copying weights.
`Graph`	GraphFactory.`newCopyOf(Graph g, boolean copyWeights)`	Create a copy of a given graph, with the same vertices and edges, with/without copying weights.
`static GraphBuilder`	GraphBuilder.`newFrom(Graph g)`	Create a new builder initialized with an existing graph vertices and edges, without copying the weights.
`static GraphBuilder`	GraphBuilder.`newFrom(Graph g, boolean copyWeights)`	Create a new builder initialized with an existing graph vertices and edges, with/without copying the weights.
`static GraphFactory`	GraphFactory.`newFrom(Graph g)`	Create a new graph factory based on a given implementation.

Uses of Interfacecom.jgalgo.graph.Graph

Uses of Graph in com.jgalgo

Uses of Graph in com.jgalgo.example

Uses of Graph in com.jgalgo.graph

Uses of Interface
com.jgalgo.graph.Graph