edge-coloring
Implementation of Misra & Gries edge colouring algorithm that produces at most d+1 colours, where d is the maximum degree of the graph. Supports an arbitary number of nodes.
1.0.0 • Published 3 years ago
Gries Packages
edge-colouring
Implementation of Misra & Gries edge colouring algorithm that produces at most d+1 colours, where d is the maximum degree of the graph. Supports an arbitary number of nodes.