Solve the puzzle via djstra shortest path algorithm
by Su Dongcai
19 Jan 2012
(Updated 20 Jan 2012)
an interesting application of djstra algorithm
|
Watch this File
|
| File Information |
| Description |
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 |
| MATLAB release |
MATLAB 7 (R14)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Updates |
| 20 Jan 2012 |
Fix a bug on line59 'cShortestPath.h', where I erroneously written operator '%' instead of '/', this bug result in the incorrect path cost 'pc' |
|
Contact us at files@mathworks.com
