Skip to content

sample code of shortest path computation using Dijkstra

Notifications You must be signed in to change notification settings

ratnesh1729/dijkstra-geodesics

Repository files navigation

#dijkstra's algorithm for computing geodesics.

  • uses C++11 and google test for some testing.
  • REquirements - CImg.h - needed for images based testing [refer to CMakeLists.txt inside main].
  • How to use - ./main/fit [image-path] Click on some points to select seeds - as many seeds as valid inputs. Close the image window and click spacebar to see segmentation id.
  • Currently, for images - L2 norm between pixel values is the geodesic distance.
  • For other graphs, please see test/ folder.

About

sample code of shortest path computation using Dijkstra

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published