Package | Description |
---|---|
agape.algos |
Exponential and FPT algorithms such as Maximum Independent Set, Minimum Cover Set or Directed Feedback Vertex Set.
|
agape.applications |
Applications using algorithms.
|
Modifier and Type | Class and Description |
---|---|
class |
Coloring<V,E>
The goal of this class is to compute the minimum number of colors to properly color an undirected graph.
|
class |
MinDFVS<V,E>
This class is dedicated to the minimum directed feedback vertex set.
|
class |
MIS<V,E>
This class computes the maximum independ set of a graph (directed or undirected).
|
class |
MVC<V,E>
This class implements algorithms for solving the Minimum Vertex Cover problem.
|
class |
Separators<V,E>
This class provides methods for ab-separators problem.
|
Modifier and Type | Method and Description |
---|---|
static void |
AgapeCL.initFactories(Algorithms<java.lang.String,java.lang.Integer> alg,
org.apache.commons.collections15.Factory<edu.uci.ics.jung.graph.Graph<java.lang.String,java.lang.Integer>> gf,
org.apache.commons.collections15.Factory<java.lang.String> vf,
org.apache.commons.collections15.Factory<java.lang.Integer> ef)
Deprecated.
you must send the factories to the constructor of alogirhtms.
|