How to find a minimum spanning tree if the information is in a matrix?
1. Label the column corresponding to the start vertex with a 1. Delete the row correspondign to that vertex.
2. Ring the smallest value in any labeled column.
3. Label the column corresponding to the ringed vetext with a 2, etc. Delete the row corresponding to that vertex.
4. Repeat steps 2 and 3 until all the rows have been deleted.
5. Wirte down the oder in which the edges were selected (it is advised to do this as you go) and calculate the length of the MST.
Comments
No comments have yet been made