A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.A graph which is connected and acyclic can be cons
阅读背景：
1021 Deepest Root (25)
来源：互联网
分享到：
