首页 > Term: minimum cut
minimum cut
The smallest set of edges in an undirected graph which separate two distinct vertices. That is, every path between them includes some member of the set.
0
创建者
- GeorgeV
- 100% positive feedback