- 博客(2)
- 收藏
- 关注
原创 maximum flow
mincut problem: an edge-weighted digraph, source vertex s, and target vertex t.a st-cut is a partition of the vertices into two disjoint sets, with s in one set A and t in the other set B.他的容量就是从A
2016-04-18 22:31:05
446
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人