https://github.com/joshuainovero/pathfinding-visualizer-cpp
https://github.com/joshuainovero/pathfinding-visualizer-cpp
algorithms astar bfs dfs dijkstra graph pathfinding shortest-path
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/joshuainovero/pathfinding-visualizer-cpp
- Owner: joshuainovero
- License: mit
- Created: 2021-10-14T08:44:07.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2021-12-08T01:10:34.000Z (over 4 years ago)
- Last Synced: 2025-04-10T19:43:05.922Z (about 1 year ago)
- Topics: algorithms, astar, bfs, dfs, dijkstra, graph, pathfinding, shortest-path
- Language: C++
- Homepage:
- Size: 19 MB
- Stars: 7
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Pathfinding Visualizer #
Visualize common pathfinding algorithms through the animations of this application!
## What is Pathfinding? ##
In computer science, there are a lot of situations that require us to find the shortest path between a set of points. Graphs are essential in pathfinding algorithms; in basic terms, graphs exist as an environment, and their traversals are calculated by the type of pathfinding algorithm being used.
## For Linux ##
If you want to build binaries from source in linux, you must install the SFML package:
```sh
sudo apt-get install libsfml-dev
```
## How to use ##
### Setting the starting node and the target node ###
If you want to move the starting node and target node from their default location, you can simply right click them and drag them around the board.
### Adding and deleting a wall ###
The white tiles on the board are the only ones that can be used to place wall nodes. To delete a wall, you can right click the tiles that are marked as obstructed. The obstructions can be cleared with a button if you've placed too many obstacles on the board or created a maze.
### Choosing an algorithm ###
The A* algorithm is selected by default. You can select a different a algorithm by clicking the other boxes on the left panel.
### Visualize! ###
After you set your configurations, you can now press the "Visualize" button at the middle-top of the screen.
## Available algorithms ##
- A* Search - the A* search algorithm extends the principles of Dijkstra's shortest path algorithm to provide a faster solution to the problem of finding the shortest path between two nodes. It accomplishes this by introducing a heuristic element to assist in determining the next node to consider as it moves along the path.
- Dijkstra's Algorithm - Dijkstra's algorithm finds the shortest path from a starting node to a target node in a weighted graph. The algorithm constructs a tree of the shortest paths from the starting vertex, known as the source, to all other points in the graph.
- Breadth-First Search - one of the fundamental graph traversal algorithms is breadth first search. It begins with a chosen node and visits all of its neighbors one hop away before moving on to all of its neighbors two hops away, and so on. Take note that this algorithm is only applicable to unweighted graphs.
- Depth-First Search - Depth-First Search is the other fundamental graph traversal algorithm. It starts from a chosen node, picks one of its neighbors, and then traverses as far as it can along that path before backtracking. It is also only applicable to unweighted graphs. Additionally, DFS is not optimal as it produce a much longer path than any pathfinding algorithms such as BFS.
## Maze Algorithms ##
- Recursive Backtracker - a randomized version of the depth-first search algorithm. It generates a perfect maze with no closed off areas or loops.
- Random Terrain - generates random tile obstructions and uses the simple rand() function. The generated random terrain may obstruct both the start node and the target node.
## Screenshots ##
