Coloring¶
|
Color a graph using various strategies of greedy graph coloring. |
|
Provides equitable (r + 1)-coloring for nodes of G in O(r * n^2) time if deg(G) <= r. |
Some node ordering strategies are provided for use with greedy_color()
.
|
Returns an iterable over nodes in |
|
Returns an iterable over nodes in |
|
Returns an iterable over nodes in |
|
Uses a greedy independent set removal strategy to determine the colors. |
|
Returns a list of the nodes of |
|
Returns a random permutation of the nodes of |
|
Iterates over all the nodes of |
|
Returns a deque of the nodes of |