Graph problem# JobHunting - 待字闺中
b*m
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)
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)