Generating all possible spanning trees in matlab

3 次查看（过去 30 天）
Sim
Sim 2011-12-1
评论： Ihsan 2014-10-22
Hello every1,
I am completely new to MATLAB and require some help regarding my research work. I need to work with graphs in MATLAB and my question is that how can we generate spanning trees of a graph in MATLAB. A graph can be entered through an adjacency matrix into MATLAB but how can that matrix be expanded to generate all the possible spanning trees of that particular graph. Can any1 help me solve this issue....??????
Thanks, Sim

请先登录，再回答此问题。

采纳的回答

Sim
Sim 2011-12-1
Okie guys i have got it how to display an undirected connected graph with N vertices and E edges using an adjacency matrix, But now how can i generate all its possible spanning trees???? The formula for getting total number of spanning trees of a graph is:
Cayley's formula : N^N-2 Where N is the Total vertices
if N= 4 then
N^N-2= 4^4-2= 16 SPANNING TREES
My question is "how can i create all these 16 spanning trees of a graph in matlab?????
Pleaseeeeeeeeeeeeee help :(
Sim
  2 个评论
Hin Kwan Wong
Hin Kwan Wong 2011-12-1
Try to look for programs people wrote at:
http://www.mathworks.com/matlabcentral/fileexchange/?term=spanning+tree
Walter Roberson
Walter Roberson 2011-12-2
A response time of just over 4 hours is not unusual for less common topics. Your post was during typical employment hours in both Western Europe and North America.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Directed Graphs 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by