Dijkstra Algorithm Practice

版本 1.0.4 (69.9 KB) 作者: Putu Fadya
Dijkstra's algorithm allows us to find the shortest path between any two vertices of a graph.
0.0
(0)
85.0 次下载
更新时间 2023/1/13

查看许可证

Dijkstra's algorithm allows us to find the shortest path between any two vertices of a graph. It differs from the minimum spanning tree because the shortest distance between two vertices might not include all the vertices of the graph. Djikstra used this property in the opposite direction i.e we overestimate the distance of each vertex from the starting vertex. Then we visit each node and its neighbors to find the shortest subpath to those neighbors. The algorithm uses a greedy approach in the sense that we find the next best solution hoping that the end result is the best solution for the whole problem.

引用格式

Putu Fadya (2024). Dijkstra Algorithm Practice (https://www.mathworks.com/matlabcentral/fileexchange/123175-dijkstra-algorithm-practice), MATLAB Central File Exchange. 检索来源 .

MATLAB 版本兼容性
创建方式 R2022b
兼容任何版本
平台兼容性
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!

Dijkstra Update 1.0.4

版本 已发布 发行说明
1.0.4

Bug fixes, new variable, new practice, graph and table example
1.0.3

update file name
1.0.2

Update file name and variable
1.0.1

Adding image
1.0.0