Graph coloring is a technique used to avoid conflicts between elements in a graph. The goal is to assign colors to the elements such that no two neighboring elements have the same color. Currently, the following aspects are implemented (✓) and planned (⌛):
- ✓ Greedy
- ✓ DSATUR (Degree SATURated)
- ✓ Workstream
- ⌛ Random (and iterative random coloring)
- ⌛ First-Fit Coloring
- Documentation for the latest stable version.
- Documentation for the development version
![@dependabot[bot]](https://avatars.githubusercontent.com/in/29110?s=64&v=4){kind=small}