Description: For a given graph G, if there is a vertex with two colors on the color scheme, making the graph an edge is connected to any two vertices with different colors, called graph G is 2 coloring.
To Search:
File list (Check if you may need any files):
实验三 着色问题\着色问题.cpp
...............\着色问题实验报告书.doc
实验三 着色问题
Download