Skip to content

This application is a GUI that visualizes simple pathfinding/search algorithms: BFS, DFS, Dijkstra, A*.

Notifications You must be signed in to change notification settings

mc2522/Pathfinding_Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

42 Commits
 
 
 
 

Repository files navigation

Pathfinding Visualizer

This application is a GUI that visualizes simple pathfinding/search algorithms: BFS, DFS, Dijkstra, A*. Users are able to move around the start and target nodes, and create obstacles to block paths. It is written in Java and uses the JavaFX 11 platform.

Creating Obstacles

Obstacles can be created by clicking and dragging the cursor across the grid.

Creating obstacles


Moving Nodes

The start and target node can be moved around by clicking them and dragging them around.

Moving nodes


Search Algorithms

Users are able to run the BFS (breadth-first search) and DFS (depth-first search) algorithms.

Search algorithms

Search algorithms with obstacles


Pathfinding Algorithms

Users are able to run the Dijkstra and A* pathfinding algorithms.

Pathfinding algorithms

Pathfinding algorithms with obstacles


Example of A* in Maze

Pathfinding algorithms with obstacles

About

This application is a GUI that visualizes simple pathfinding/search algorithms: BFS, DFS, Dijkstra, A*.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published