b**m
发帖数: 1466 | 1 Directed graph without cycle.
For each node n, there may be two paths(p1,p2) started from this node. Every
node on these two paths should only be in one path(except the start node).
Let L(n) = min(len(p1),len(p2))
how to figure out max(L) | n****e
发帖数: 678 | 2 这道题是说每个node的fanout是 <= 2吗？
即使fanout <= 2, (p1, p2)也有多种可能啊，如何定义这两个paths。
感觉题目没说清楚 |
|
