https://github.com/fractal-solutions/pathpilotjs

A* search algorithm to find shortest distance between points given various landmarks
https://github.com/fractal-solutions/pathpilotjs

Last synced: about 2 months ago
JSON representation

A* search algorithm to find shortest distance between points given various landmarks

• Host: GitHub
• URL: https://github.com/fractal-solutions/pathpilotjs
• Owner: fractal-solutions
• Created: 2024-01-24T10:37:16.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-01-24T10:52:39.000Z (over 1 year ago)
• Last Synced: 2025-02-07T01:45:34.063Z (4 months ago)
• Language: JavaScript
• Homepage:
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

        
### node path-pilot

Uses the A* Search Algo to find shortest path from point A to B using distance between landmarks

run 'node path-pilot' from the dir to run.

You can change the Landmarks and the Distances between them in the code manually