how to create hop-constrained minimum spanning tree?
显示 更早的评论
I want to create hop-constrained minimum spanning tree. the resulted answer must not have a cycle, or dose not exceed H (hop-constrained) and and must be minimum as well. the input is a graph. so the input is an nxn matrix.
i just know that i have to use Kruskall or Prime algorithm to create spanning tree from that graph. but i dont have any idea about hop-constrained (????). and then i will use an optimization method to improve the answer. i dont know how to implement it in matlab.
回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Matrix Indexing 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
