Expand description
Graph coloring algorithms.
Provides greedy (Welsh-Powell), DSATUR, exact backtracking, and chromatic number computation for undirected graphs.
Structs§
- Graph
Coloring - Undirected graph represented as an adjacency list.
Type Aliases§
- Coloring
Result - Result type for graph coloring operations.