walker_tw

4 ms·

1. 1.▲
   by walker_tw 6y ago

   Location: London Remote: Of Course Willing to relocate: Yes Technologies: React, Ruby, PostgreSQL, JavaScript, Git, Rspec, Jest, Travis, Heroku, macOS, React Native (some), used to working in CI/CD, TDD and Agile based workflows but h
2. 2.▲
   by walker_tw 6y ago

   Thanks for the help. Can you expand on what you mean? The function called on line 35 (heuristicNodeCheck) will compare the heuristic to the new total created every time a node is checked or listed as a neighbour. Therefore the heuristic wil
3. 3.▲
   by walker_tw 6y ago

   Ah hello thanks for looking at the app. The reason that we state that Euclidean does not always find the shortest path is because the way the distance heuristic is calculated. Euclidean will not work on a quad-directional traversal grid suc
4. 4.▲
   by walker_tw 6y ago

   Thank you very much for the feedback. And for adding the url above.
5. 5.▲
   by walker_tw 6y ago

   Thanks for the help! I hope that you enjoyed the app. I have updated it (but ill put it just here in case) https://www.linkedin.com/in/thomas-w-walker/
6. 6.▲
   Algorithm-Visualizer(github.com)

   79 points by walker_tw 6y ago|20 comments
7. 7.▲
   by walker_tw 6y ago

   While job searching me and a mate made an interactive app to learn ReactJS and teach graphing algorithms (Dijkstra, A*, BFS etc). Enjoy it (and contact us if you have any exciting jr. dev roles/opportunities !)