PathFinding

Dijkstra's pathfinding algorithm: computing a shortest path between an initial node to a final node.
1.3K Downloads
Updated 7 Feb 2012

View License

%% Pathfinding
% An example how to use class Graph.
% Usage:
% g=Graph(map);
% Constructor, where map is 2D matrix of mobility map.
%
% ShowPath(g,map,shortpathv);
% Displaying where shortpathv is list of nodes on shortest path.
%
% [shortpathv g]=GetPath(g,initv,finalv); Computing the shortest path
% between init_node and final_node.

Cite As

Wasit Limprasert (2024). PathFinding (https://www.mathworks.com/matlabcentral/fileexchange/34966-pathfinding), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2011a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!
Version Published Release Notes
1.0.0.0