Skip to content

This algorithm is a re-implementation based on Dijkstra algorithm, added a gradient constrain for special use. For instance, in railway route planning and design the route must constantly under a certain gradient.

Notifications You must be signed in to change notification settings

lin102/smooth-shortest-path

Error
Looks like something went wrong!

About

This algorithm is a re-implementation based on Dijkstra algorithm, added a gradient constrain for special use. For instance, in railway route planning and design the route must constantly under a certain gradient.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published