all possible spanning tree
显示 更早的评论
how can i generate all possible spanning tree ranked by the order of minimality ( based on edge weighting)., so that from the Ic I can select.
回答（1 个）
Rajani Mishra
2020-8-2
编辑：Rajani Mishra
2020-8-2
0 个投票
You can try below approach to find out all possible spanning trees:-
- Select permutations of vertices (as Start node and target node), find out all paths between them. Refer to these links for this step: 1) https://in.mathworks.com/matlabcentral/answers/171277-how-can-i-get-all-paths-between-two-nodes 2) https://in.mathworks.com/matlabcentral/answers/379462-find-all-possible-paths-from-a-single-sourcenode-to-a-single-targetnode-without-visiting-old-paths
- Check weather the complete path is a spanning tree or not. You can use function graphisspantree for this step
- Calculate total weight of the path.
Thus, you can find out all spanning trees/paths and their corresponding weights.
Hope this helps!
类别
在 帮助中心 和 File Exchange 中查找有关 Matrix Indexing 的更多信息
2020-7-25
2020-8-2
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
