DFS and BFS finder + Graph connectivity

DSA using C

C++ Maze Solver using BFS (shortest path) & DFS (explores all paths). Modular, OOP-based, and easy-to-understand.

Maze generator and solver

Maze Pathfinder is a dynamic visualizer that brings maze-solving algorithms to life. Watch as DFS, BFS, A*, and Dijkstra's algorithm work their way through randomly generated mazes, finding the shortest paths step-by-step in real time.