how to create hop-constrained minimum spanning tree?

1 次查看（过去 30 天）
Afsaneh
Afsaneh 2013-11-17
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 个）

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by