Skip to content

Implementation of Dijkstra's algorithm in the context of pathfinding in a subway system.

Notifications You must be signed in to change notification settings

brettsmentek/dijkstra-pathfinding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 

Repository files navigation

NYC Subway Pathfinder

Prerequisites

  • Node (optional) tested in 6.6.0

Setup

  • Run: node pathfinder.js or run in any vanilla JavaScript environment

Testing

  • Train lines with times are added here: // add new lines with time definitions
  • Train lines without times are added here: // add new lines without time definitions
  • Challenge 1 can be run by un-commenting the lines without times
  • Challenge 2 can be run by commenting the lines with times
  • The implementation will not report a time unless all lines are given time estimates
  • See Figure 1 for a test map to compare against test cases

Map Figure 1

About

Implementation of Dijkstra's algorithm in the context of pathfinding in a subway system.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published