Algorithm-Visualizer
github.com
Algorithm-Visualizer
1–10 of 21 posts
Re: Algorithm-Visualizer
#2Re: Algorithm-Visualizer
#3While 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 !)
contact us if you have any exciting
jr. dev roles/opportunities
... it would help if you had contact details in your HN profile.Re: Algorithm-Visualizer
#4While 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 !)
While 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.
Re: Algorithm-Visualizer
#5Earlier quoted context omitted.
While 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.
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/
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.
Re: Algorithm-Visualizer
#6Re: Algorithm-Visualizer
#7Earlier quoted context omitted.
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/
You 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…
Re: Algorithm-Visualizer
#8Re: Algorithm-Visualizer
#9Re: Algorithm-Visualizer
#10From the title I was expecting a more general purpose algorithm visualizer. I think this is more accurately described as "Graph Traversal Algorithm Visualizer".