Minimal Spanning Tree

library("igraph")
M <- as.matrix(read.table("mst_distance_matrix.txt"))
M

      V1 V2 V3 V4 V5 V6 V7 V8 V9 V10
 [1,]  0  3  0  0  0  2  0  0  0   0
 [2,]  3  0 17 16  0  0  0  0  0   0
 [3,]  0 17  0  8  0  0  0  0 18   0
 [4,]  0 16  8  0 11  0  0  0  4   0
 [5,]  0  0  0 11  0  1  6  5 10   0
 [6,]  2  0  0  0  1  0  7  0  0   0
 [7,]  0  0  0  0  6  7  0 15  0   0
 [8,]  0  0  0  0  5  0 15  0 12  13
 [9,]  0  0 18  4 10  0  0 12  0   9
[10,]  0  0  0  0  0  0  0 13  9   0

G <- graph_from_adjacency_matrix(M, mode='undirected', 
                                 weighted = TRUE)
V(G)$color = 2
E(G)$color = 2
plot(G, edge.label=E(G)$weight)

tree <- mst(G)
V(G)$color = 2
E(G)$color = 2
plot(tree, edge.label=E(tree)$weight)