2015年12月4日
uva 193 Graph Coloring（图染色 dfs回溯）
摘要： DescriptionYou are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the o... 阅读全文
posted @ 2015-12-04 22:01 UniqueColor 阅读(566) 评论(0) 推荐(1)
uva 10004 Bicoloring（dfs二分染色，和hdu 4751代码差不多）
摘要： DescriptionIn 1976 the ``Four Color Map Theorem" was proven with the assistance of a computer. This theorem states that every map can be colored using... 阅读全文
posted @ 2015-12-04 20:36 UniqueColor 阅读(381) 评论(0) 推荐(0)
CSU - 1356 Catch（dfs染色两种写法，和hdu4751比较）
摘要： DescriptionA thief is running away!We can consider the city where he locates as an undirected graph in which nodes stand for crosses and edges stand f... 阅读全文
posted @ 2015-12-04 20:13 UniqueColor 阅读(242) 评论(0) 推荐(0)