Solve the puzzle via djstra shortest path algorithm

an interesting application of djstra algorithm

This file apply djstra algorithm(only consider the positive edge weight case) to solve the
puzzle and visualize the result.
Please run the following commands to duplicate the screen shot(have fun :):

mex vcDjstra.cpp;%compile the cpp file
im = imread('puzzle.png'); im = rgb2gray(im);
[pc, path] = shortestPath(im, [57, 94], [471, 496]);
Acknowledgement:
The puzzle.png is from steven's blog:
http://blogs.mathworks.com/steve/?s_cid=global_nav
Note:
The core file that implement djstra algorithm is 'cShortestPath.h', the compiler I used in
msvc++ 6.0