How to implement the following algorithm in MATLAB ?
5 次查看(过去 30 天)
显示 更早的评论
Hello all, I am trying to implement MATLAB code for following statements of one of the algorithm which is as follows:
- We consider that there are multiple cellular towers. These towers are called as nodes, where node i and node j are neighbours of each others.
- We consider one of the towers among all the towers as the Macro tower (MT).
- Let the minimum number of hops from tower to the MT be denoted as .
After going through web, I understand that number of hops can be computed using Bellman ford algorithm.
My query is that how to implement the Bellman ford algorithm in this scenario.
Any help in this regard will be highly appreciated.
采纳的回答
Walter Roberson
2023-4-1
sr = [1 1 1 1 2 2 2 2 3 3 4 5 5 5 5 6 6 6 6 6]; % various possible sources
ta = [2 6 7 8 3 7 5 8 4 8 8 4 3 7 8 5 4 7 3 8]; % various possible targets
G = graph(sr,ta);
p = plot(G);
target = 8;
[TR, d] = shortestpathtree(G, 'all', target, 'outputform', 'cell')
3 个评论
Walter Roberson
2023-4-1
Each cell in TR shows the exact path from one node to the target. d summarizes the cost of each path.
更多回答(1 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!