How to write this pseudocode in matlab?

24 次查看（过去 30 天）
Chanya Selvan
Chanya Selvan 2020-7-2
评论： Walter Roberson 2020-7-3
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

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

回答（2 个）

Walter Roberson
Walter Roberson 2020-7-2
Chanya Selvan
Chanya Selvan 2020-7-3
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.

类别

在 Help Center 和 File Exchange 中查找有关 Dijkstra algorithm 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by