<V,E> VertexPartition<V,E> |
ColoringAlgo.computeColoring(Graph<V,E> g) |
Assign a color to each vertex of the given graph, resulting in a valid coloring.
|
<V,E> VertexPartition<V,E> |
KEdgeConnectedComponentsAlgo.computeKEdgeConnectedComponents(Graph<V,E> g,
int k) |
Compute the k-edge connected components of a graph.
|
<V,E> VertexPartition<V,E> |
StronglyConnectedComponentsAlgo.findStronglyConnectedComponents(Graph<V,E> g) |
Find all strongly connected components in a graph.
|
<V,E> VertexPartition<V,E> |
WeaklyConnectedComponentsAlgo.findWeaklyConnectedComponents(Graph<V,E> g) |
Compute all weakly connected components in a graph.
|
static <V,E> VertexPartition<V,E> |
VertexPartition.fromMap(Graph<V,E> g,
Object2IntMap<V> map) |
Create a new vertex partition from a vertex-blockIndex map.
|
static <V,E> VertexPartition<V,E> |
VertexPartition.fromMapping(Graph<V,E> g,
ToIntFunction<V> mapping) |
Create a new vertex partition from a vertex-blockIndex mapping function.
|