Module org.jhotdraw8.graph

Package org.jhotdraw8.graph.algo

Class DisjointSetsAlgo

java.lang.Object

org.jhotdraw8.graph.algo.DisjointSetsAlgo

public class DisjointSetsAlgo
extends Object

Constructor Summary

Constructors

Constructor	Description
DisjointSetsAlgo()

Method Summary

Modifier and Type	Method	Description
<V> @NonNull List<Set<V>>	findDisjointSets(@NonNull Collection<V> vertices, @NonNull Function<V,Iterable<V>> getNextVertices)	Given a directed graph, returns all disjoint sets of vertices.
<V, A> @NonNull List<Set<V>>	findDisjointSets(@NonNull DirectedGraph<V,A> graph)	Given a directed graph, returns all disjoint sets of vertices.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

DisjointSetsAlgo

public DisjointSetsAlgo()

Method Details

findDisjointSets

public <V,
A> @NonNull List<Set<V>> findDisjointSets(@NonNull DirectedGraph<V,A> graph)

Given a directed graph, returns all disjoint sets of vertices.

Uses Kruskal's algorithm.

Type Parameters:

V - the vertex data type

A - the arrow data type

Parameters:

graph - a directed graph

Returns:

the disjoint sets.

findDisjointSets

public <V> @NonNull List<Set<V>> findDisjointSets(@NonNull Collection<V> vertices,
 @NonNull Function<V,Iterable<V>> getNextVertices)

Given a directed graph, returns all disjoint sets of vertices.

Uses Kruskal's algorithm.

Type Parameters:

V - the vertex data type

Parameters:

vertices - the vertices of the directed graph

getNextVertices - a function that returns the next vertices given a vertex

Returns:

the disjoint sets.