walker_tw

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 happy to branch out into anything.

Resume/CV: https://github.com/Walker-TW/CV

Gihtub: https://github.com/Walker-TW

LinkedIn: https://www.linkedin.com/in/thomas-w-walker/

email: thomas.w.walker(at)live.co.uk

Looking for Junior Dev/Graduate role based around London. Recently had one of my projects go to the front page of this very website and won a recent HackAthon. I would be happy to respond to any message big or small, no contact is a waste of time.

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 will always be kept relevant. Are you suggesting that when a node is labelled with a heuristic to keep it as its first value?

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 such as this (we cant use diagonals) so instead the Manhattan distance is used to override this issue.

Thank you very much for the feedback. And for adding the url above.

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/

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 !)