Skip to content
Find the shortest closed circuit that will visit all paths from a series of connected GPX files.
JavaScript Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
examples
postman_problems @ 4e38476
scripts
src
test
.eslintrc
.gitignore
.gitmodules
.prettierrc
LICENSE
README.md
package-lock.json
package.json

README.md

gpx-route-inspector

Find the shortest closed circuit that will visit all paths from a series of connected GPX files.

Instructions

  1. git clone --recursive git@github.com:lukekarrys/gpx-route-inspector.git
  2. npm install
  3. cd gpx-route-inspector
  4. cd postman_problems
  5. Run postman_problems install instructions
  6. cd ..
  7. ./src/cli.js --gpx examples/santan/routes --start 'GOLDMINE|END' --type gpx

Output

TODO

  • Port postman_problems to JavaScript
  • Handle GPX files with overlapping sections
  • Find/create connector gpx files for usery so Vista and Merkle and accessible
  • Fix Usery Desert Hawk loop
  • South Mountain?
You can’t perform that action at this time.