Uses of Interface
com.jgalgo.graph.IndexGraph
Packages that use IndexGraph
Package
Description
Adapters from Guava to JGalgo, and from JGalgo to Guava.
Adapters from JGraphT to JGalgo, and from JGalgo to JGraphT.
Package for common classes and interfaces used by the algorithms in the JGAlgo library.
Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.
Algorithms for finding the minimum spanning trees and Steiner trees of graphs.
Graphs object are the fundamental building blocks of the JGAlgo library.
-
Uses of IndexGraph in com.jgalgo.adapt.guava
Methods in com.jgalgo.adapt.guava that return IndexGraph -
Uses of IndexGraph in com.jgalgo.adapt.jgrapht
Methods in com.jgalgo.adapt.jgrapht that return IndexGraph -
Uses of IndexGraph in com.jgalgo.alg.common
Methods in com.jgalgo.alg.common with parameters of type IndexGraphModifier and TypeMethodDescriptionstatic IVertexPartitionIVertexPartition.fromArray(IndexGraph g, int[] vertexToBlock, int blocksNum) Create a new vertex partition from an array of vertex-blockIndex mapping.static IVertexBiPartitionIVertexBiPartition.fromBitmap(IndexGraph g, com.jgalgo.internal.util.Bitmap bitmap) Create a new vertex bi-partition from a bitmap. -
Uses of IndexGraph in com.jgalgo.alg.flow
Methods in com.jgalgo.alg.flow with parameters of type IndexGraphModifier and TypeMethodDescriptionMaximumFlowPushRelabel.computeMinimumCut(IndexGraph g, IWeightFunction w, int source, int sink) -
Uses of IndexGraph in com.jgalgo.alg.span
Methods in com.jgalgo.alg.span with parameters of type IndexGraphModifier and TypeMethodDescriptionSteinerTreeMehlhorn.computeSteinerTree(IndexGraph g, IWeightFunction w, IntCollection terminals) -
Uses of IndexGraph in com.jgalgo.graph
Fields in com.jgalgo.graph declared as IndexGraphModifier and TypeFieldDescriptionfinal IndexGraphIndexGraphBuilder.ReIndexedGraph.graphThe newly created re-indexed graph.Methods in com.jgalgo.graph that return IndexGraphModifier and TypeMethodDescriptionIndexGraphBuilder.build()IndexGraphBuilder.buildMutable()default IndexGraphIndexGraph.copy()default IndexGraphIndexGraph.copy(boolean copyVerticesWeights, boolean copyEdgesWeights) default IndexGraphIndexGraph.immutableCopy()default IndexGraphIndexGraph.immutableCopy(boolean copyVerticesWeights, boolean copyEdgesWeights) default IndexGraphIndexGraph.immutableView()Graph.indexGraph()Get an Index graph view of this graph.default IndexGraphIndexGraph.indexGraph()Deprecated.this function will always return the same graph, no reason to call itdefault IndexGraphIndexGraphFactory.newCopyOf(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) static IndexGraphIndexGraph.newDirected()Create a new directed empty index graph.IndexGraphFactory.newGraph()default IndexGraphIndexGraphFactory.newImmutableCopyOf(Graph<Integer, Integer> g) IndexGraphFactory.newImmutableCopyOf(Graph<Integer, Integer> g, boolean copyVerticesWeights, boolean copyEdgesWeights) static IndexGraphIndexGraph.newUndirected()Create a new undirected empty index graph.default IndexGraphIndexGraph.reverseView()default IndexGraphIndexGraph.undirectedView()Methods in com.jgalgo.graph with parameters of type IndexGraphModifier and TypeMethodDescriptionstatic IWeightFunctionWeightFunctions.localEdgeWeightFunction(IndexGraph g, IWeightFunction w) Get a 'local' version of a given weight function.static IWeightFunctionIntWeightFunctions.localEdgeWeightFunction(IndexGraph g, IWeightFunctionInt w) Get a 'local' version of a given weight function.static IndexGraphBuilderIndexGraphBuilder.newCopyOf(IndexGraph g) Create a new builder initialized with an existing graph vertices and edges, without copying the weights.static IndexGraphBuilderIndexGraphBuilder.newCopyOf(IndexGraph g, boolean copyVerticesWeights, boolean copyEdgesWeights) Create a new builder initialized with an existing graph vertices and edges, with/without copying the weights.