implementation of dijkastra algorithm in any energy efficient protocol in wsn

i want to implement dijkastra algorithm in any energy efficieny protocol in wsn to find minimum path b/w cluster head nodes and gateway nodes

[Pratyasha Pradhan]

Hy

Can you help me in this ?

[Walter Roberson]

@Pratyasha Pradhan

If you are not able to find another source, then you could pull code out of http://cse.unl.edu/~carrick/papers/misc/MikeORourkeThesis.pdf

... but shortestpath() for graph() objects is built-in to MATLAB, so I am not clear as to why you would want to bother.

Answer 1

[Walter Roberson]

Okay, go ahead.

Is there a particular reason for programming it yourself instead of using

https://www.mathworks.com/help/matlab/ref/graph.shortestpath.html