# Related to Graph ?

2 visualizzazioni (ultimi 30 giorni)
charu shree il 4 Mag 2023
Commentato: Torsten il 5 Mag 2023
Hello all, I have the following Graph:
sr = [1,2,2,2,3,3,3,4,5];
ta = [2,3,6,8,6,4,7,6,6];
G = graph(sr,ta);
plot(G)
Here node 'i', 'node j' denotes the neighbors of each other. For e.g., if node 'i' = 2 then 'j' can be 1,3,6,8. Similarly if 'i' = 5 then 'j' is 6.
And Siganl to Noise ratio (SNR) of the link from 'i' to 'j' is Gaussian random variable.
My query is I am not getting how to compute SNR of the link from node 'i' to node 'j'.
Any help in this regard will be highly appreciated.
##### 0 CommentiMostra -2 commenti meno recentiNascondi -2 commenti meno recenti

Accedi per commentare.

### Risposte (1)

Chunru il 4 Mag 2023
sr = [1,2,2,2,3,3,3,4,5];
ta = [2,3,6,8,6,4,7,6,6];
% Use graph weight for SNR
snr = randn(size(sr)); % gaussian distribution (adjust this)
G = graph(sr,ta, snr);
% Show graph and SNR
plot(G, 'EdgeLabel', G.Edges.Weight)
##### 4 CommentiMostra 2 commenti meno recentiNascondi 2 commenti meno recenti
charu shree il 5 Mag 2023
Basically i want to move from node in 'sr' to node in 'ta' and then generate the SNR between these nodes.
Torsten il 5 Mag 2023
If your graph is directed (direction source to target) and you generate snr(i) = 20, e.g., you can interprete this as 20 packages being sent from sr(i) to ta(i). You don't need to "move from node i to node j" (whatever this may mean).

Accedi per commentare.

### Categorie

Scopri di più su Graph and Network Algorithms in Help Center e File Exchange

### Community Treasure Hunt

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

Start Hunting!

Translated by