jaydenmilne.github.io
pathfinding
jaydenmilne.github.io | pathfinding | |
---|---|---|
1 | 2 | |
1 | 179 | |
- | - | |
0.0 | 0.0 | |
over 1 year ago | over 2 years ago | |
JavaScript | JavaScript | |
- | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
jaydenmilne.github.io
-
Show HN: BFS, Dijkstra and A* interactive demo made in React
Same story, made something similar in straight JavaScript while I was at school and never showed it to anyone:
https://jayd.ml/algorithms/search/ (source https://github.com/jaydenmilne/jaydenmilne.github.io/tree/ma...)
Features:
- Draw your own maze!
- Several different algorithms!
- Adjust solving speed / step algorithm!
- Bugs!
- Share your mazes in the URL (abuse link shorteners to store your data! shorturl.at/quyQR)
I'm quite proud of how I (ab)used async/await to increase the stack size and be able to easily step and delay the algorithms without having to rewrite them to be re-entrant.
(in case your wondering, left click to draw walls, right click to place start then end node, left click and drag on walls to go into erase mode)
pathfinding
-
Show HN: BFS, Dijkstra and A* interactive demo made in React
I think your priority queue is doing O(nlogn) sort for every insert https://github.com/npretto/pathfinding/blob/master/src/algo/...
This should be a heap instead.
What are some alternatives?
mineflayer-pathfinder - Pathfinding plugin that gives bot the ability to go from A to B
Path-finder - 🎯A tool for visualising Path Finding Algorithms and maze generation algorithms