再问Amazon难题# JobHunting - 待字闺中M*a2014-07-20 07:071 楼Disconnect two nodes in a graph by removing minimum number of edges.
b*r2014-07-20 07:072 楼max-flow/min-cut...【在 M*******a 的大作中提到】: Disconnect two nodes in a graph by removing minimum number of edges.
b*y2014-07-20 07:076 楼BFS?【在 M*******a 的大作中提到】: Disconnect two nodes in a graph by removing minimum number of edges.