1. You can run MCST.m to generate input graph data and the resulting MCST.

2. The Matlab program assumes that the graph is a completely connected graph with edge weight being the Euclidean distance between vertices. To simplify your task, your can assume that all graphs used to test your program will be completely connected, i.e., m=0

3. The Matlab program does not follow the inputs/output conventions specified in the handout. For example, the Matlab code outputs vertices without prefixing the vertices with a line of the total number of vertices. It outputs MCST edges in reverse order, e.g., instead of (1,5), it outputs (5,1). The program also outputs the edge weight which is not required. You need to modify vertices and tree edges outputed by the Matlab codes to confirm with the formats specified in the handout to test your program.

4. Furthermore, Matlab uses 1-index, while C and C++  use 0-index. So if Matlab outputs an edge like 1 4, you should output 0 3 instead.