RPI-Subway-Challenge / subwayChallenge

Finds fastest path through all 472 NYC subway stations
https://en.wikipedia.org/wiki/Subway_Challenge
MIT License
8 stars 1 forks source link

BFS #72

Closed priimej closed 1 year ago

priimej commented 1 year ago

Implementing a BFS that will go through each station and treats each unvisited one as a goal state. Eventually, it will have a driver function that derives a path using this recursive function.