To view the live website please refer to https://yuval-moshe.github.io/
The following project presents a pathfinding algorithms visualizer on which you can view the methodology of the most well-known pathfinding algorithms. The project currently presents 3 different algorithms:
- BFS (Breadth-first search) - is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node and explores all nodes at the present depth prior to moving on to the nodes at the next depth level, BFS guarantees the shortest path
- DFS (Depth-first search) - is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node and explores as far as possible along each branch before backtracking, therfore DFS does not guarantees the shortest path
- Bidirectional BFS - a BFS based algorithms which preforms the search both from the source and destination nodes until a common node is reached, Bidirectional BFS guarantees the shortest path