app/src/main/java/org/jgrapht/alg/ChromaticNumber.java
public static <V, E> int findGreedyChromaticNumber(UndirectedGraph<V, E> g)
    {
        Map<Integer, Set<V>> coloredGroups = findGreedyColoredGroups(g);
        return coloredGroups.keySet().size();
    }
/**
     * Finds the number of colors required for a greedy coloring of the graph.
     *
     * @param g an undirected graph to find the chromatic number of
     *
     * @return integer the approximate chromatic number from the greedy
     * algorithm
     */
Finds the number of colors required for a greedy coloring of the graph.
@param g an undirected graph to find the chromatic number of

@return integer the approximate chromatic number from the greedy
algorithm
Finds the number of colors required for a greedy coloring of the graph . @param g an undirected graph to find the chromatic number of @return integer the approximate chromatic number from the greedy algorithm
public static <V, E> int findGreedyChromaticNumber(UndirectedGraph<V, E> g)
    {
        Map<Integer, Set<V>> coloredGroups = findGreedyColoredGroups(g);
        return coloredGroups.keySet().size();
    }
public static < V , E > int findGreedyChromaticNumber ( UndirectedGraph < V , E > g ) { Map < Integer , Set < V > > coloredGroups = findGreedyColoredGroups ( g ) ; return coloredGroups . keySet ( ) . size ( ) ; }
Finds the number of colors required for a greedy coloring of the graph.
Finds the number of colors required for a greedy coloring of the graph .