Prim#39;s Algorithm — Detailed Trace of Execution普里姆与# 39；-执行详细的跟踪算法.doc

CScD-320, Algorithms Prim’s Algorithm — Detailed Traces of Execution Node and Edge List: Node A, edges to: B(3) C(1) Node B, edges to: A(3) C(1) D(1) Node C, edges to: A(1) B(1) D(2) Node D, edges to: B(1) C(2) MinHeap: AC(1) | AB(3) C off: AB(3) — then enter CB(1), CD(2) MinHeap: CB(1) | AB(3) CD(2) B off: CD(2) | AB(3) — then add BD(1) MinHeap: BD(1) | AB(3) CD(2) D off: CD(2) | AB(3) Drop D : AB(3) Drop B : empty Prims min.spanning tree A AC CB BD Weight 3: A(1) B(3) C(2) D(4)  Note: This graph has a shape somewhat similar to the one for assignment 9, but the different edges and different edge weights will make Prim’s Algorithm behave very differently on this graph than it does on the homework assignment. Node and Edge List: Node A, edges to: B(1) C(2) G(5) Node B, edges to: A(1) C(6) E(1) F(5) Node C, edges to: A(2) B(6) D(1) F(2) Node D, edges to: C(1) F(2) G(1) Node E, edges to: B(1) F(3) Node F, edges to: B(5) C(2) D(2) E(3) G(1) Node G, edges to: A(5) D(1) F(1) MinHeap: AB(1) | AC(2) AG(5) B off: AC(2) | AG(5) — then enter BC(6), BE(1), BF(5) MinHeap: BE(1) | AC(2) BC(6) | AG(5) BF(5) E off: AC(2) | BF(5) BC(6) | AG(5) — then enter EF(3) MinHeap: AC(2) | EF(3) BC(6) | AG(5) BF(5) C off: EF(3) | BF(5) BC(6) | AG(5) — then enter CD(1), CF(2) MinHeap: CD(1) | EF(3) CF(2) | AG(5) BF(5) BC(6) D off: CF(2) | EF(3) BC(6) | AG(5) BF(5) — then enter DF(2), DG(1) MinHeap: DG(1) | EF(3) CF(2) | AG(5) BF(5) BC(6) DF(2) | G off: DF(2) | EF(3) CF(2) | AG(5) BF(5) BC(6) — then enter GF(1) MinHeap: GF(1) | EF(3) DF(2) | AG(5) BF(5) BC(6) CF(2) F off: CF(2) | EF(3) DF(2) | AG(5) BF(5) BC(6) At this point, all vertices are in the MST, so that successive removals will be discarded: Prims min.spanning tree A AB BE AC CD DG GF Weight 7: A(1) B(2) C(4) D(5) E(3) F(7) G(6) CScD-320, Algorithms Dijkstra’s Algorithm — Detailed Traces of Execution Node and Edge List