Coloring the nodes of the graph such that they satisfy Four Color Theorem using Flood Fill algorithm
-
Updated
Mar 15, 2024 - Python
Coloring the nodes of the graph such that they satisfy Four Color Theorem using Flood Fill algorithm
Calculate the chromatic number and visualize the associated k-coloring of any graph.
Description and examples of what's the 4 Color Theorem
Add a description, image, and links to the 4-color-theorem topic page so that developers can more easily learn about it.
To associate your repository with the 4-color-theorem topic, visit your repo's landing page and select "manage topics."