V- the graph vertex type
E- the graph edge type
public class LargestDegreeFirstColoring<V,E> extends GreedyColoring<V,E>
This is the greedy coloring algorithm which orders the vertices by non-increasing degree. See the following paper for details.
|Constructor and Description|
Construct a new coloring algorithm.
|Modifier and Type||Method and Description|
Get the ordering of the vertices used by the algorithm.
Copyright © 2017. All rights reserved.