# Create a simple square matrix of distances:
distance_matrix <- matrix(c(0, 1, 2, 3, 1, 0, 1, 2, 2, 1, 0, 1, 3, 2, 1, 0),
nrow = 4,
dimnames = list(LETTERS[1:4], LETTERS[1:4])
)
# Show matrix to confirm that the off diagonal has the shortest
# distances:
distance_matrix
# Use find_minimum_spanning_edges to get the edges for the minimum spanning
# tree:
find_minimum_spanning_edges(distance_matrix)
# Use sum of find_minimum_spanning_edges to get the length of the minimum
# spanning tree:
sum(find_minimum_spanning_edges(distance_matrix))
Run the code above in your browser using DataLab