How to implement the following algorithm in MATLAB ?

Question

charu shree 2023-3-31

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1938614-how-to-implement-the-following-algorithm-in-matlab

评论： charu shree 2023-4-4

采纳的回答： Walter Roberson

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.

1 个评论
显示 -1更早的评论隐藏 -1更早的评论

charu shree 2023-3-31

Can we use Graph function in MATLAB for implementing the nodes ?

请先登录，再进行评论。

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

Answer 1

Walter Roberson 2023-4-1

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1938614-how-to-implement-the-following-algorithm-in-matlab#answer_1206219

在 MATLAB Online 中打开

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')

TR = 8×1 cell array

{[ 1 8]} {[ 2 8]} {[ 3 8]} {[ 4 8]} {[ 5 8]} {[ 6 8]} {[7 1 8]} {[ 8]}

d = 1×8

1 1 1 1 1 1 2 0

3 个评论
显示 1更早的评论隐藏 1更早的评论

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.

charu shree 2023-4-4

Ok ....Thank u sir....

请先登录，再进行评论。

Answer 2

Steven Lord 2023-3-31

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1938614-how-to-implement-the-following-algorithm-in-matlab#answer_1205954

See the shortestpath and/or shortestpathtree functions for graph objects.

2 个评论
显示无隐藏无

charu shree 2023-4-1

在 MATLAB Online 中打开

Thank you so much sir for ur response.....

Following are my efforts:

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);
plot(G);

I had created the Graph of possible sources and targets of mobile towers.

But still not getting how to compute number of hops from

tower to MT.

Please note that I am assuming node 8 to be MT i.e., Macro tower.

charu shree 2023-4-1

How to generalize the above code if there are large number of mobile towers say 60 ?

请先登录，再进行评论。