利用邻接矩阵或邻接表存储一张图，分别采用图的深度优先搜索和广度优先搜索遍历该图，并输出遍历结果-Using the adjacency matrix or adjacency list storage a picture, using depth-first search and the breadth first search traversal of the graph, and the output traversal results

to implement breadth first search and depth first searh

图用邻接矩阵表示，程序逻辑为，首先实现了用于确定一种有效颜色的函数color（），然后，按照深度优先和违反约束则回溯的策略进行搜索。-Map with the adjacency matrix that logic to, first of all to achieve the color used to determine the function of an effective color (), and then, in accordance with the depth-first an