原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
ts positive. b. Redo part (a), but with edge weights allowed to also be 0 or negative. c.
A cycle cover in a directed graph, not necessarily bipartite, is a set of edge-disjoint directed cycles such that each vertex lies on at most one cycle. Given nonnegative edge weights w(u, v), let C be
the set of edges in a cycle cover, and define w(C) = ∑(u,v)∈C w(u, v) to be the weight of
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea