APT Graph Colouring
Summary
This repository demonstrates converting graph m-coloring problems into a Debian packaging task, using APT's dependency resolver to assign colors to graph nodes. It includes usage instructions, example instances, and explanations of the DIMACS input/output formats, illustrating an innovative intersection of combinatorial problems and package management automation.