Skip to content

Visualize how graph traversal algorithms differ from each other

Notifications You must be signed in to change notification settings

gleni1/maze-solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Maze Solver

This is a Python-based maze solver project that generates and displays a maze with a configurable number of cells. The maze can be solved using two different algorithms: Depth First Search (DFS) or Breadth First Search (BFS).

Features

  • Configurable Maze Size: You can specify the number of rows and columns to generate the maze.
  • Solve with DFS or BFS: The program allows you to choose between DFS and BFS to find the path from the start to the finish.
  • Interactive Visualization: The maze is visually displayed using a simple graphical interface, with cells representing walls and paths, and the algorithm's solving path highlighted.

Visualization

BFS Animation

BFS Animation

DFS Animation

DFS Animation

About

Visualize how graph traversal algorithms differ from each other

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages