创建图的邻接表存储结构,输出邻接表数据(验证创建过程),深度优先遍历(DFS) ,广度优先遍历(BFS),增加一个顶点到图, 删除一个顶点(同时删除其所有邻接边) ,增加一条弧到图,从图中删除一条弧- Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-fi

图用邻接矩阵表示，程序逻辑为，首先实现了用于确定一种有效颜色的函数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