"Gridster" challenge from PlusPeter: user defines and sees a X * Y grid where an arbitrary start and end square are selected and highlighted. User defines permissible squares through which path(s) can go between the two points. Breadth First Search algorithm finds and highlights any shortest path.
npm install
npm start
This project was bootstrapped with Create React App.
Install now
Run now --public