- Type Parameters:
V- the graph vertex type
E- the graph edge type
- All Implemented Interfaces:
public class LargestDegreeFirstColoring<V,E> extends GreedyColoring<V,E>The largest degree first greedy coloring algorithm.
This is the greedy coloring algorithm which orders the vertices by non-increasing degree. See the following paper for details.
- D. J. A. Welsh and M. B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1):85--86, 1967.
- Dimitrios Michail
All Methods Instance Methods Concrete Methods Modifier and Type Method Description
getVertexOrdering()Get the ordering of the vertices used by the algorithm.