Dijkstra Algorithm
This algorithm is to solve shortest path problem.
Usage
[cost rute] = dijkstra(graph, source, destination)
note : graph is matrix that represent the value of the edge. if node not connected with other node, value of the edge is 0.
example:
Finding shortest path form node 1 to node 7.
>> G = [0 3 9 0 0 0 0;
0 0 0 7 1 0 0;
0 2 0 7 0 0 0;
0 0 0 0 0 2 8;
0 0 4 5 0 9 0;
0 0 0 0 0 0 4;
0 0 0 0 0 0 0;
];
>> [cost rute] = dijkstra(G,1,7)
it will resulting
cost = 15
rute = [7 6 4 5 2 1]
引用
Dimas Aryo (2024). Dijkstra Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/36140-dijkstra-algorithm), MATLAB Central File Exchange. 取得済み .
MATLAB リリースの互換性
プラットフォームの互換性
Windows macOS Linuxカテゴリ
- MATLAB > Mathematics > Graph and Network Algorithms > Modify Nodes and Edges > Dijkstra algorithm >
- Sciences > Mathematics > Combinatorics > Graph Theory > Dijkstra Algorithm >
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!dijkstra/
バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.0.0.0 |