Class GraphColoring.GreedyGraphColoring<N,E>
java.lang.Object
com.google.javascript.jscomp.graph.GraphColoring<N,E>
com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring<N,E>
- Enclosing class:
- GraphColoring<N,
E>
Greedily assign nodes with high degree unique colors.
-
Nested Class Summary
Nested classes/interfaces inherited from class com.google.javascript.jscomp.graph.GraphColoring
GraphColoring.Color, GraphColoring.GreedyGraphColoring<N,E> -
Field Summary
Fields inherited from class com.google.javascript.jscomp.graph.GraphColoring
colorToNodeMap, graph -
Constructor Summary
ConstructorsConstructorDescriptionGreedyGraphColoring(AdjacencyGraph<N, E> graph) GreedyGraphColoring(AdjacencyGraph<N, E> graph, Comparator<N> tieBreaker) -
Method Summary
Modifier and TypeMethodDescriptionintcolor()Annotates the graph withGraphColoring.Colorobjects usingAnnotatable.setAnnotation(Annotation).Methods inherited from class com.google.javascript.jscomp.graph.GraphColoring
getGraph, getPartitionSuperNode
-
Constructor Details
-
GreedyGraphColoring
-
GreedyGraphColoring
- Parameters:
tieBreaker- In case of a tie between two nodes of the same degree, this comparator will determine which node should be colored first.
-
-
Method Details
-
color
public int color()Description copied from class:GraphColoringAnnotates the graph withGraphColoring.Colorobjects usingAnnotatable.setAnnotation(Annotation).- Specified by:
colorin classGraphColoring<N,E> - Returns:
- The number of unique colors need.
-