Introduction - If you have any usage issues, please Google them yourself
Four color theorem, also known as four-color conjecture, four-color problem, is the world s three or four color theorem is a well-known mathematical theorem, the popular argument is: Every planar map can be dyed using only four colors, but no two adjacent the same region color. The program uses the idea of the use of the stack and backtracking algorithm to solve the map coloring problem, the program algorithm is simple and easy to understand, use the mouse to draw a different area, the program automatically fills, good demonstration of the four-color map problem