Array ( [0] => Array ( [title] => L28A [link] => https://www.youtube.com/embed/XAW_4UvQGWg ) [1] => Array ( [title] => L28B [link] => https://www.youtube.com/embed/LIKCqbxc-sI ) ) 國立清華大學開放式課程OpenCourseWare(NTHU, OCW) - 第28講 Minimal Spanning Trees

Title

第28講 Minimal Spanning Trees

第1節

L28A

第2節

L28B

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