Title

第28講 Minimal Spanning Trees

Syllabus

章節大綱

L28A
       00:00 Review of minimal spanning trees and Prim's algorithm
       01:30 Kruskal's algorithm
       07:15 Example of Kruskal's algorithm (cont. from L26B 16:40 )
       15:00 Proof of correctness of Kruskal's algorithm

 

L28B
       00:00 Proof of correctness of Kruskal's algorithm (cont. )
       18:30 Complexity of Kruskal's algorithm