知识卡片

普通读书笔记卡 · 3645.a.3.b

最短路可取无环简单路径

理解等级:中级
  • 正权环删去会变短;
  • 零权环删去不改变权重;
  • 负权环所在可达目标没有有限最短路。

因此只要有限最短路存在,总能选一条无环路径,边数至多 |V|−1。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      Therefore, without loss of generality, assume that shortest paths have no cycles, that is, they are simple paths. Since any acyclic path in a graph G = (V, E) contains at most |V| distinct vertices, it also

    参考来源

    - 位置:《算法导论(第4版)》第22章《单源最短路径》(OEBPS/chapter022.xhtml,文本字符[5000,10000))。 - 结论依据:原文逐类分析环权并由简单路径顶点数推出边数上界。 - 原始内容:Therefore, without loss of generality, assume that shortest paths have no cycles, that is, they are simple paths. Since any acyclic path in a graph G = ( V , E ) contains at most | V | distinct vertices, it also