摘要:
Atreeis a graph withnvertices and exactlyn - 1edges; this graph should meet the following condition: there exists exactly one shortest (by number of e... 阅读全文
摘要:
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... 阅读全文