Johnsonsalgorithm.pptVIP

Johnson’s algorithm Johnson’s演算法可用於計算All pairs shortest path問題。 在邊的數量不多的時候，如|E|=O(|V|log|V|)時，能有比Warshall-Floyd演算法較佳的效能。 其輸入需求是利用Adjacency list表示的圖。 Graph reweighting Producing Nonnegative Weights Johnson’s algorithm Johnson’s algorithm Johnson’s 演算法利用reweighing來除去負邊，使得該圖可以套用Dijkstra演算法，來達到較高的效能。 Reweighing是將每個點v設定一個高度h(v)，並且調整邊的weight function w(u,v)成為w’(u,v)=w(u,v)+h(u)-h(v)。 令δ‘(u,v)如此調整之後的最短距離，則原先的最短距離δ(u,v)=δ‘(u,v)-h(u)+h(v)。 Johnson’s algorithm Johnson(G) { compute G’, where V[G’]=V[G]?{s} and E[G’]=E[G]?{(s,v):v?V[G] if Bellman-Ford(G’,w,s)=False then print “? a neg-weight cycle” else for each vertex v ?V[G’] set h(v)=?(s,v) computed by Bellman-Ford algo. for each edge (u,v)?E[G’] w’(u,v)=w(u,v)+h(u)-h(v) for each vertex u ?V[G] run Dijkstra(G,w’,u) to compute ?’(u,v) for each v ?V[G] duv=?’(u,v)-h(u)+h(v) return D } Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm範例 Johnson’s algorithm複雜度分析 執行一次Bellman-Ford。O(|V||E|)。 執行|V|次Dijkstra。 使用Fibonacci heap，總計O(|V|2log|V|+|V||E|) 。 使用Binary heap，總計O(|V||E|log|V|)。 當|E|足夠小，比Warshall-Floyd快。 * Theorem. Given a label h(v) for each v ? V, reweight each edge (u, v) ? E by ?(u, v) = w(u, v) + h(u) – h(v). Then, all paths between the same two vertices are reweighted by the same amount. Proof. Let p = v1 → v2 → ? → vk be a path in the grah Then, we have Find a vertex labeling h such that ?(u, v) ≥ 0 for all (u, v) ? E by using Bellman-Ford to solve the difference constraints h(v) – h(u) ≤ w(u, v), or determine that a negative-weight cycle exists. Time = O(VE). Run Dijkstra’s algorithm from each vertex using ?. Time = O(VE + V2 lg V). Reweight each shortest-path length ?(p) to produce the shortest-path lengths w(p) of the original graph. Time = O(V2). To