|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.jgrapht.alg.ChromaticNumber
public abstract class ChromaticNumber
Allows the chromatic number of a graph to be calculated. This is the minimal number of colors needed to color each vertex such that no two adjacent vertices share the same color. This algorithm will not find the true chromatic number, since this is an NP-complete problem. So, a greedy algorithm will find an approximate chromatic number.
Constructor Summary | |
---|---|
ChromaticNumber()
|
Method Summary | ||
---|---|---|
static
|
findGreedyChromaticNumber(UndirectedGraph<V,E> g)
Finds the number of colors required for a greedy coloring of the graph. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ChromaticNumber()
Method Detail |
---|
public static <V,E> int findGreedyChromaticNumber(UndirectedGraph<V,E> g)
g
- an undirected graph to find the chromatic number of
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |