A Java application built with JavaFX that visualizes popular pathfinding algorithms, including:
- Dijkstra's Algorithm – finds the optimal path in a weighted graph.
- BFS (Breadth-First Search) – traverses unweighted, undirected graphs level by level.
The app lets users interactively build a graph by adding vertices and edges, then watch how each algorithm finds a path between two selected points.
- Java 17+
- JavaFX – for the graphical interface
- Maven – for dependency management
- Interactive vertex and edge creation
- Algorithm selection (Dijkstra / BFS)
- Visualization of the solution path and the search area
- Graph reset functionality
- Color-coded highlighting of the path found by the algorithm
Requirements:
- Java 17+
- Maven
▶ Run: Clone the repository:
git clone https://github.com/Kambolo/Pathfinding-Visualization.git
cd Pathfinding-Visualization
Build the project:
mvn clean install
Run the application:
mvn javafx:run
BFS
Dijkstra
Kamil Bołoz