Week 3: Minimum Spanning Trees and Applications
Prepared by Lusheng Wang
Notes for Lecture 3
Tutorial 3/Assignment 1 (Hand in a HARD copy.
Deadline: Week 5 before the end of the lecture. I will collect the assignment during the lecture.)
Tutorial 3/Assignment 1 for CS5335 (Hand in a HARD copy.
Deadline: Week 5 before the end of the lecture. I will collect the assignment during the lecture.)
My research paper using minimum spanning tree (pdf file)
Summary of Week 3
The program for Prim's algorithm