count of minimum spanning tree with adjacency matrix of a graph

Hi friends I have a graph and it's adjacency matrix How can i calculate count of minimum spanning tree with matlab ? Thanks

Answer 1

[Walter Roberson]

https://www.mathworks.com/matlabcentral/fileexchange/19218-matgraph/content/matgraph/samples/html/spanning_tree.html

[Alireza Lashgary]

thanks for your reply can you learn me how to use it please? thanks

[Walter Roberson]

[r, c] = find(YourAdjacencyMatrix);
edgelist = [r, c];   %N by 2
g = graph(edgelist);
nt = nsptrees(g);
disp(nt)

Answer 2

[Steven Lord]

Take a look at the minspantree method of the graph and digraph classes.

[Walter Roberson]

That method appears to find one minimum spanning tree, and does not appear to allow one to count the spanning trees.