利用C++实现图的邻接矩阵的存储，这在网络流的计算中有很大的帮助。-Using C++, adjacency matrix of storage, which in the calculation of network flow is very helpful.

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