A Kind of Map Coloring Algorithm Considering of Depth First Search

Map coloring problem is a hot topic in combinatorial optimization, which is one of the main tasks in discrete mathematics. It has gone through a long time for map coloring, especially with the development of computer wide applications. Map coloring theories has a long development, its applications are widely used. So, we propose a kind of map coloring algorithm based on depth-first search algorithm. the algorithm overcomes the shortcomings of the map colored areas compared to other algorithms. The experiment showed that the map coloring algorithm put forward by the paper is much valid, which could link these two types of data, and something useful is obtained.