How to write this pseudocode in matlab?

Dijkstra algorithm's - pseudo code

1. For each node n in the graph - 0 n.distance = Infinity
2. Create an empty list.
3. start.distance = 0,add start to list.
4. While list not empty

• Let current = node in the list with the smallest distance, remove current from list
• For each node, n that is adjacent to current

If n.distance > current.distance + length of edge from n to current

n.distance = current.distance + length of edge from n to current

n.parent = current

add n to list if isn't there already

[Walter Roberson]

http://www.mathworks.com/matlabcentral/answers/8026-best-way-s-to-master-matlab

[Walter Roberson]

Chanya Selvan:

If you feel that the question is not clear, then as you are the person who posted the question, it is up to you to clarify it.

Answer 1

[Walter Roberson]

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

Answer 2

[Chanya Selvan]

From the source node (green coloured box) require to reach the target node (yellow coloured box) using the shortest route.The Dijkstra algorithm using the pseudocode is shown above which requires to be interpreted to MATLAB program. Kindly assist to solve this problem.Thanks.

[Walter Roberson]

http://www.mathworks.com/matlabcentral/answers/6200-tutorial-how-to-ask-a-question-on-answers-and-get-a-fast-answer