2015年8月28日
摘要: Atreeis a graph withnvertices and exactlyn - 1edges; this graph should meet the following condition: there exists exactly one shortest (by number of e... 阅读全文
posted @ 2015-08-28 23:04 _fukua 阅读(356) 评论(0) 推荐(0) 编辑
摘要: Appleman has a tree withnvertices. Some of the vertices (at least one) are colored black and other vertices are colored white.Consider a set consistin... 阅读全文
posted @ 2015-08-28 17:46 _fukua 阅读(246) 评论(0) 推荐(0) 编辑