Path Finding Visualization Взлом 1.0
Разработчик: Josh Sauder
Категория: Образование
Взлом не работает?
Описание
Want to see various pathfinding algorithms in action? With Path Finding Visualization, you can visualize, in action, six different algorithms. This app allows you to select your own starting and ending points, select the algorithm you want to use, and add walls in order to create boundaries.
This app includes the following algorithms:
Dijkstra's - Works by expanding outwards until it reaches the target node. Guaranteed to find the shortest path as long as there are not any negative weights.
Bidirectional Dijkstra's - Dijkstra's algorithm from both sides.
A* - Like Dijkstra's in that it favors nodes close to the starting point, but also favors nodes close to the ending point (heuristic). It does not guarantee the shortest path. A tie-breaker that prefers straight lines was included in order to prevent multiple nodes from having the same F values.
Bidirectional A* - The A* algorithm from both sides.
Breadth-First Search - Traverses through a graph one level at a time until it finds the target node. Since there are no weights, this algorithm does guarantee the shortest path.
Depth-First Search - Traverses through a graph by going as deep as possible and then backtracking until it finds the target node. It does not guarantee the shortest path.
Learning about or want to visualize any of the above algorithms in action? Download Path Finding Visualization today and have a better understanding of how each algorithm works.
This app includes the following algorithms:
Dijkstra's - Works by expanding outwards until it reaches the target node. Guaranteed to find the shortest path as long as there are not any negative weights.
Bidirectional Dijkstra's - Dijkstra's algorithm from both sides.
A* - Like Dijkstra's in that it favors nodes close to the starting point, but also favors nodes close to the ending point (heuristic). It does not guarantee the shortest path. A tie-breaker that prefers straight lines was included in order to prevent multiple nodes from having the same F values.
Bidirectional A* - The A* algorithm from both sides.
Breadth-First Search - Traverses through a graph one level at a time until it finds the target node. Since there are no weights, this algorithm does guarantee the shortest path.
Depth-First Search - Traverses through a graph by going as deep as possible and then backtracking until it finds the target node. It does not guarantee the shortest path.
Learning about or want to visualize any of the above algorithms in action? Download Path Finding Visualization today and have a better understanding of how each algorithm works.