PathFinding

Dijkstra's pathfinding algorithm: computing a shortest path between an initial node to a final node.

Description

%% 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.

• Required Products: MATLAB
• MATLAB release: MATLAB 7.12 (R2011a)

[raman makhaik]

i get error in this code ..... i.e.
??? Maximum recursion limit of 500 reached. Use set(0,'RecursionLimit',N)
to change the limit. Be aware that exceeding your available stack space can
crash MATLAB and/or your computer.

Error in ==> Node..

any solution please reply..??

[Wasit Limprasert]

Please feel free to comment:)