-
- Type Parameters:
V
- vertex the graph vertex type
- All Known Implementing Classes:
ChordalGraphIndependentSetFinder
public interface IndependentSetAlgorithm<V>
Algorithm to compute an Independent Set in a graph.- Author:
- Joris Kinable
-
-
Nested Class Summary
Nested Classes Modifier and Type Interface Description static interface
IndependentSetAlgorithm.IndependentSet<V>
A (weighted) Independent Setstatic class
IndependentSetAlgorithm.IndependentSetImpl<V>
Default implementation of a (weighted) independent set
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description IndependentSetAlgorithm.IndependentSet<V>
getIndependentSet()
Computes an independent set; all vertices are considered to have equal weight.
-
-
-
Method Detail
-
getIndependentSet
IndependentSetAlgorithm.IndependentSet<V> getIndependentSet()
Computes an independent set; all vertices are considered to have equal weight.- Returns:
- a vertex independent set
-
-