原书出处
Introduction to Algorithms, Fourth Edition
第六部分 图算法
thm for computing maximum flows can help solve a variety of related problems efficiently.
Finally, Chapter 25 explores matchings in bipartite graphs: methods for pairing up vertices that are partitioned into two sets by selecting edges that go between the sets.
Bipartite-matching problems model several situations that arise in the real world. The ch
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/part006.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea