演算法›Ch4 圖論演算法第 39 題／共 111 題
39. Bellman-Ford、Convergence、Edge Relaxation Order
#AL-04-039中Bellman-FordConvergenceEdge Relaxation Order
- Consider the same graph as in Question 7. If you can determine the order of edge relaxation, what are the minimum and maximum numbers of passes for the Bellman-Ford algorithm to converge (i.e., to correctly find shortest paths from S to each of other vertices)?
📄 交大115
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法