Skip to content

This program is a visualizer of different pathfinding algorithms. It will show how the algorithms search by visualzing each iteration and shows the shortest path to the end cell once found. You can also add obstacles like walls to see how it affects the search.

Notifications You must be signed in to change notification settings

MahmoudZayad/Pathfinding-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

39 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Pathfinding Visualizer

Written in C++, using SDL2 and IMGui.

A user interface to allow for visualization of various pathfinding algorithms.

Current Algorithms included:

Breadth-first, Depth-first, Uniform-cost, Greedy Best-first, and A* search.

Draw on screen with mouse

Click to add/remove a cell, or drag to keep drawing walls or weights. All cells are animated.

Draw

Searching

When searching a animation showing the current cell that is being visited is shown. BFS

Clearing the Grid

You can clear walls and/or the previous search to run a new one

DFS

About

This program is a visualizer of different pathfinding algorithms. It will show how the algorithms search by visualzing each iteration and shows the shortest path to the end cell once found. You can also add obstacles like walls to see how it affects the search.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published