演算法›Ch4 圖論演算法第 40 題／共 111 題
40. Bellman-Ford、Convergence、Edge Relaxation Order
#AL-04-040中Bellman-FordConvergenceEdge Relaxation Order
- Consider the same graph as in Question 7. Which one of the following orders of edge relaxation results in the minimum number of passes for the Bellman-Ford algorithm to converge?
📄 交大115
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法