3 ms·
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 yo
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 !)
- ColinWright 6y agoWhile I don't have any roles or opportunities available, when you say things like this: contact us if you have any exciting jr. dev roles/opportunities ... it would help if you had contact details in your HN profile.
- walker_tw 6y agoThanks 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/ https://www.linkedin.com/in/thomas-w-walker/
- ColinWright 6y agoYou might want to re-visit this. Under "Depth First Search" you say: > Depth first search is the only algorithm listed which will NOT find the shortest path. That turns out not to be the case. Euclidean will also sometimes not find the shortest path. And indeed, you say so in the section on Euclidean you say: > *However because our grid is only traversable on horizontal or vertical vertices using this heurtistic will NOT always give the shortest path, ..." You also mis-spelled "heuristics", but that's easily done, and easily fixed. The app is nice ... well done.
- walker_tw 6y agoThank you very much for the feedback. And for adding the url above.