The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not share the same color. This problem is sometimes also called Guthrie's problem after F. Guthrie, who first conjectured the theorem in 1852.
This project is a C implementation of this theorem, using both both greedy and backtrack algorithms based on the four color theorem, the application concerns Morocco's and Africa's Map.
Check out the following links to read more about the four color theorm and algorithms used in this repo :
https://en.wikipedia.org/wiki/Four_color_theorem
https://en.wikipedia.org/wiki/Greedy_coloring
https://en.wikipedia.org/wiki/Backtracking
https://en.wikipedia.org/wiki/Greedy_algorithm
https://en.wikipedia.org/wiki/Graph_%28abstract_data_type%29
