Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
midas-journal/midas-journal-315
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
This directory contains the source files for the Dijkstra's shortest path filter. The folder Data contains the sample images and the desired shortest path results of our tests. The folder Results is an empty folder which will hold the user's tests results. The embedded tests write several configarations of shortests paths results (of the sample images) to the Results folder, and compares the results to the results in the Data folder. In order to use this application you need to have the following software installed: CMake 2.2 (or above) Boost C++ library 1.36.0 (or above) Insight Toolkit 2.4 (or above)
About
Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published