原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
this section, we restrict our attention to finding maximum matchings in bipartite graphs:
graphs in which the vertex set can be partitioned into V = L ∪ R, where L and R are disjoint and all edges in E go between L and R. We further assume that every vertex in V has at least one incident edge. Figure 24.8
illustrates the notion of a matching in a bipartite graph. The problem of finding a maxim
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea