L27A
00:00 Review of Shortest-path problem (L26B)
01:00 Dijkstra's algorithm
L27B
00:00 Example of Dijkstra's algorithm (cont. from L26B 16:40 )
22:00 Complexity of Dijkstra's algorithm
L27C
00:00 Definition of minimal spanning trees
04:00 Examples of spanning trees (cont. from L26B 16:40 )
10:40 Greedy algorithm
13:50 Prim's algorithm
20:20 Example of Prim's algorithm (cont. from L26B 16:40 )
L27D
00:00 Proof of correctness of Prim's algorithm
第27講 Optimality 版書.pdf
