知识卡片

普通读书笔记卡 · 3651

拓扑排序给DAG排先后

理解等级:中级

拓扑序是有向无环图顶点的线性顺序,必须让每条边(u,v)的起点 u 出现在终点 v 之前。

它表达先决约束;无边约束的顶点可有多种合法顺序。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第20章 基本图算法 · 查看原书依据

      A topological sort of a dag G = (V, E) is a linear ordering of all its vertices such that if G contains an edge (u, v), then u appears before v in the ordering. Topological sorting is defined only on directed graphs that are acyclic; no

    参考来源

    - 位置:《算法导论(第4版)》第20章《基本图算法》(OEBPS/chapter020.xhtml,文本字符[45000,50000))。 - 结论依据:定义直接规定每条有向边的端点顺序;穿衣实例说明非相邻事件可以互换。 - 原始内容:A topological sort of a dag G = ( V , E ) is a linear ordering of all its vertices such that if G contains an edge ( u , v ), then u appears before v in the ordering. Topological sorting is defined only on directed graphs that are acyclic; no