HDU 4263 Red/Blue Spanning Tree
摘要：
DescriptionGiven an undirected, unweighted, connected graph, where each edge is colored either blue or red, determine whether a spanning tree with exactlykblue edges exists.InputThere will be several test cases in the input. Each test case will begin with a line with three integers:n m kWheren(2≤n≤1 阅读全文
posted @ 2012-08-27 15:30 -和尚- 阅读(248) 评论(0) 推荐(0) 编辑