The PathFindingOnSquaredGrid framework towards shortest path finding by applying all three distance metrics as defined i.e., shortest path based on Manhattan distance, shortest path based on Euclidean distance, shortest path based on Chebyshev distance. Implementation can switch over these three distance metrics and produce, for each one, as output: a) visualisation of the shortest path on the squared grid, b) the total cost of the shortest path depending on the applied distance metric.
-
Notifications
You must be signed in to change notification settings - Fork 0
The PathFindingOnSquaredGrid framework towards shortest path finding by applying all three distance metrics as defined i.e., shortest path based on Manhattan distance, shortest path based on Euclidean distance, shortest path based on Chebyshev distance.
lakshang/AStarPathfindingAlgorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The PathFindingOnSquaredGrid framework towards shortest path finding by applying all three distance metrics as defined i.e., shortest path based on Manhattan distance, shortest path based on Euclidean distance, shortest path based on Chebyshev distance.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published