知识卡片
二分图的边只能跨越两侧
二分图顶点可分成互不相交的L与R,所有边都连接两侧顶点;同侧顶点之间没有边。
机器与任务的可分配关系可表示为这类图。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第24章 最大流 · 查看原书依据
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
参考来源
- 位置:《算法导论(第4版)》第24章《最大流》(OEBPS/chapter024.xhtml,文本字符[40000,45000))。
- 结论依据:24.3节给出二分图划分定义及机器—任务例子。
- 原始内容: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