Constructor Detail

• ChromaticNumber

  public ChromaticNumber()

Method Detail

• findGreedyChromaticNumber

  public static <V,E> int findGreedyChromaticNumber(UndirectedGraph<V,E> g)

  Finds the number of colors required for a greedy coloring of the graph.

  Parameters:

  g - an undirected graph to find the chromatic number of

  Returns:

  integer the approximate chromatic number from the greedy algorithm

• findGreedyColoredGroups

  public static <V,E> java.util.Map<java.lang.Integer,java.util.Set<V>> findGreedyColoredGroups(UndirectedGraph<V,E> g)

  Finds a greedy coloring of the graph.

  Parameters:

  g - an undirected graph for which to find the coloring