知识卡片

普通读书笔记卡 · 3645.e

DAG可容负边而无负环

理解等级:中级

有向无环图不存在任何环,因此即使边权为负,也不会出现可反复绕行的负权环。单源最短路可以在拓扑序中一次处理各顶点。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第22章 单源最短路径 · 查看原书依据

      Shortest paths are always well defined in a dag, since even if there are negative-weight edges, no negative-weight cycles can exist. We’ll see that if the edges of a weighted dag G = (V, E) are relaxed according to a

    参考来源

    - 位置:《算法导论(第4版)》第22章《单源最短路径》(OEBPS/chapter022.xhtml,文本字符[25000,30000))。 - 结论依据:原文以无环性排除负环,并引出拓扑序松弛算法。 - 原始内容:Shortest paths are always well defined in a dag, since even if there are negative-weight edges, no negative-weight cycles can exist. We’ll see that if the edges of a weighted dag G = ( V , E ) are relaxed according to a