See: Description
Class | Description |
---|---|
Algorithms<V,E> |
This class is used to set up factories for the different algorithms classes.
|
Coloring<V,E> |
The goal of this class is to compute the minimum number of colors to properly color an undirected graph.
|
MarkMap<V> |
This class is used for Maximum Acyclic Set algorithm (Razgon, 2007).
|
MinDFVS<V,E> |
This class is dedicated to the minimum directed feedback vertex set.
|
MIS<V,E> |
This class computes the maximum independ set of a graph (directed or undirected).
|
MVC<V,E> |
This class implements algorithms for solving the Minimum Vertex Cover problem.
|
Separators<V,E> |
This class provides methods for ab-separators problem.
|