Goal of an algorithm: Relax the edges in a shortest path in order (but ... Every shortest path must be relaxed in order ... for each vertex v ∈ Adj[u].
確定！ 回上一頁
