Given that for a graph the Minimum Spanning Tree might not be unique I want to generate all distinct MSTs with igraph in R. Is that possible?
For now, I'm obtaining a single MST:
completeGraph <- graph.adjacency(distanceMatrix, mode='undirected', weighted = TRUE)
mstGraph <- mst(completeGraph,algorithm = 'prim')