Uses of Interface com.jgalgo.graph.IntGraph (JGAlgo - Parent 0.4.0 API)

Packages that use IntGraph
Package	Description
com.jgalgo.alg	Algorithms for solving graph problems.
com.jgalgo.graph	Graphs object are the fundamental building blocks of the JGAlgo library.

Uses of IntGraph in com.jgalgo.alg

Methods in com.jgalgo.alg that return IntGraph
Modifier and Type	Method	Description
`default IntGraph`	IVertexPartition.`blocksGraph()`
`IntGraph`	IVertexPartition.`blocksGraph(boolean parallelEdges, boolean selfEdges)`
`default IntGraph`	IVertexPartition.`blockSubGraph(int block)`
`default IntGraph`	IVertexPartition.`blockSubGraph(int block, boolean copyVerticesWeights, boolean copyEdgesWeights)`
`default IntGraph`	KVertexConnectedComponentsAlgo.IResult.`componentSubGraph(int compIndex)`
`IntGraph`	BiConnectedComponentsAlgo.Result.`getBlockGraph()`	Get the graph of the bi-connected components.
`IntGraph`	IPath.`graph()`
`IntGraph`	IVertexPartition.`graph()`
`IntGraph`	KVertexConnectedComponentsAlgo.IResult.`graph()`
`IntGraph`	ShortestPathSingleSource.IResult.`graph()`
`default IntGraph`	ShortestPathSingleSource.IResult.`shortestPathTree()`
`default IntGraph`	ShortestPathSingleSource.IResult.`shortestPathTree(boolean directed)`
`IntGraph`	IsomorphismIMapping.`sourceGraph()`
`IntGraph`	IsomorphismIMapping.`targetGraph()`

Methods in com.jgalgo.alg with parameters of type IntGraph
Modifier and Type	Method	Description
`IPath`	ShortestPathHeuristicST.`computeShortestPath(IntGraph g, IWeightFunction w, int source, int target, IntToDoubleFunction vHeuristic)`	Compute the shortest path between two vertices in an int graph.
`static IPath`	IPath.`findPath(IntGraph g, int source, int target)`	Find a valid path from \(u\) to \(v\).
`static IVertexBiPartition`	IVertexBiPartition.`fromMap(IntGraph g, Map<Integer,Boolean> map)`	Create a new vertex bi-partition from a vertex-side map.
`static IVertexPartition`	IVertexPartition.`fromMap(IntGraph g, Int2IntMap map)`	Create a new vertex partition from a vertex-blockIndex map.
`static IVertexBiPartition`	IVertexBiPartition.`fromMapping(IntGraph g, IntPredicate mapping)`	Create a new vertex bi-partition from a vertex-side mapping function.
`static IVertexPartition`	IVertexPartition.`fromMapping(IntGraph g, IntUnaryOperator mapping)`	Create a new vertex partition from a vertex-blockIndex mapping function.
`static Optional<IVertexBiPartition>`	BipartiteGraphs.`getExistingPartition(IntGraph g)`	Get the existing bipartite partition of the given `IntGraph` (if one exists).
`static boolean`	IVertexBiPartition.`isPartition(IntGraph g, IntPredicate mapping)`	Check if a mapping is a valid bi-partition of the vertices of a graph.
`static boolean`	IVertexPartition.`isPartition(IntGraph g, IntUnaryOperator mapping)`	Check if a mapping is a valid partition of the vertices of a graph.
`static boolean`	IPath.`isPath(IntGraph g, int source, int target, IntList edges)`	Check whether the given edge list is a valid path in the given graph.
`static BfsIter.Int`	BfsIter.`newInstance(IntGraph g, int source)`	Create a BFS iterator in an int graph.
`static DfsIter.Int`	DfsIter.`newInstance(IntGraph g, int source)`	Create a DFS iterator for an int graph.
`static IntSet`	IPath.`reachableVertices(IntGraph g, int source)`	Find all the vertices reachable from a given source vertex.
`static IntSet`	IPath.`reachableVertices(IntGraph g, IntIterator sources)`	Find all the vertices reachable from a set of given source vertices.
`static IPath`	IPath.`valueOf(IntGraph g, int source, int target, IntList edges)`	Create a new path from an edge list, a source and a target vertices.

Uses of IntGraph in com.jgalgo.graph

Subinterfaces of IntGraph 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 IntGraph
Modifier and Type	Method	Description
`IntGraph`	IntGraphBuilder.`build()`
`IntGraph`	IntGraphBuilder.`buildMutable()`
`default IntGraph`	IntGraph.`copy()`
`default IntGraph`	IntGraph.`copy(boolean copyVerticesWeights, boolean copyEdgesWeights)`
`default IntGraph`	IntGraph.`immutableCopy()`
`default IntGraph`	IntGraph.`immutableCopy(boolean copyVerticesWeights, boolean copyEdgesWeights)`
`default IntGraph`	IntGraph.`immutableView()`
`default IntGraph`	IntGraphFactory.`newCopyOf(Graph<Integer,Integer> g)`
`IntGraph`	IntGraphFactory.`newCopyOf(Graph<Integer,Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights)`
`static IntGraph`	IntGraph.`newDirected()`	Create a new directed empty int graph.
`IntGraph`	IntGraphFactory.`newGraph()`
`default IntGraph`	IntGraphFactory.`newImmutableCopyOf(Graph<Integer,Integer> g)`
`IntGraph`	IntGraphFactory.`newImmutableCopyOf(Graph<Integer,Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights)`
`static IntGraph`	IntGraph.`newUndirected()`	Create a new undirected empty int graph.
`default IntGraph`	IntGraph.`reverseView()`
`static IntGraph`	Graphs.`subGraph(IntGraph g, IntCollection vertices, IntCollection edges, boolean copyVerticesWeights, boolean copyEdgesWeights)`	Create a new graph that is a subgraph of the given int graph, with option to copy weights.
`default IntGraph`	IntGraph.`subGraphCopy(Collection<Integer> vertices, Collection<Integer> edges)`	Create a new graph that is a subgraph of this graph.
`default IntGraph`	IntGraph.`undirectedView()`

Methods in com.jgalgo.graph with parameters of type IntGraph
Modifier and Type	Method	Description
`static IEdgeSet`	IEdgeSet.`allOf(IntGraph g)`	Create an edge set object of all the edges in a graph.
`static <T,WeightsT extends IWeights<T>> WeightsT`	IWeights.`createExternalEdgesWeights(IntGraph g, Class<? super T> type)`	Create an external edge weights container.
`static <T,WeightsT extends IWeights<T>> WeightsT`	IWeights.`createExternalEdgesWeights(IntGraph g, Class<? super T> type, T defVal)`	Create an external edge weights container with default values.
`static <T,WeightsT extends IWeights<T>> WeightsT`	IWeights.`createExternalVerticesWeights(IntGraph g, Class<? super T> type)`	Create an external vertex weights container.
`static <T,WeightsT extends IWeights<T>> WeightsT`	IWeights.`createExternalVerticesWeights(IntGraph g, Class<? super T> type, T defVal)`	Create an external vertex weights container with default values.
`static IEdgeIter`	IndexIdMaps.`indexToIdEdgeIter(IntGraph g, IEdgeIter indexIter)`	Create an `IEdgeIter` that return IDs of vertices and edges from an `IEdgeIter` that return indices of vertices and edges.
`static IEdgeSet`	IndexIdMaps.`indexToIdEdgeSet(IEdgeSet indexSet, IntGraph g)`	Create an edge set of IDs from an edge set of indices in an `IntGraph`.
`static IEdgeSet`	IEdgeSet.`of(IntSet edges, IntGraph g)`	Create an edge set object from a plain set of edges.
`static int`	Graphs.`randEdge(IntGraph g, Random rand)`	Get a random edge from the given int graph.
`static int`	Graphs.`randVertex(IntGraph g, Random rand)`	Get a random vertex from the given int graph.
`static IntSet`	Graphs.`selfEdges(IntGraph g)`	Get a view of all the self edges in an int graph.
`static IntGraph`	Graphs.`subGraph(IntGraph g, IntCollection vertices, IntCollection edges, boolean copyVerticesWeights, boolean copyEdgesWeights)`	Create a new graph that is a subgraph of the given int graph, with option to copy weights.