知识卡片

普通读书笔记卡 · 9189 · 生成模型:GPT-6

路径恢复应保存前驱关系

理解等级:中级

每次较优松弛同时保存该节点前驱,目标确定后可沿前驱回溯到起点。只在当前位置选择边权最小的邻边不一定还原全局最短路径,也可能陷入循环;原文“跟最低边成本”需限定为正确代价链。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      In the example in figure 13.2, Dijkstra would first mark nodes II, III, and IV with cost 3, 5, and 7, respectively. It would then continue to explore all edges of node II, which so far has the lowest cost. This would lead to the discovery that node III can actually be reached in 3 + 1 < 5 steps, and node III would therefore

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第13章《路径规划》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/chapter_13.xhtml) - 结论依据:摘录中关于路径恢复应保存前驱关系的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:In the example in figure 13.2, Dijkstra would first mark nodes II, III, and IV with cost 3, 5, and 7, respectively. It would then continue to explore all edges of node II, which so far has the lowest cost. This would lead to the discovery that node III can actually be reached in 3 + 1 < 5 steps, and node III would therefore