PathFinding

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

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