Algorithm Visualization

Interactive visualizations for classic algorithms in Pathfinding and Searching.

Features

• Pathfinding Algorithms: Visualize how different algorithms explore and find paths on a grid.
• Searching Algorithms: See step-by-step how search algorithms locate elements in arrays.
• Maze Generation: Generate random and recursive division mazes for pathfinding.
• Modern UI: Responsive, easy-to-use interface.
• Educational: Great for students and educators to learn and teach algorithms visually.

Visualized Algorithms

Pathfinding

• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Best-First Search
• Dijkstra's Algorithm
• A (A-star) Algorithm*

Maze Generation

• Random Maze
• Recursive Division Maze

Searching

• Linear Search
• Jump Search
• Binary Search
• Exponential Search

Getting Started

1. Clone the repository:

   git clone https://github.com/ankitmwd/Algorithm_Visualization.git
   cd Algorithm_Visualization

2. Open index.html in your browser.

   • No build step or server required; all logic is client-side JavaScript.

Project Structure

Algorithm_Visualization/
  ├── css/                # Stylesheets
  ├── docs/               # Documentation files
  ├── img/                # Images and GIFs for UI and README
  ├── js/                 # JavaScript source code
  │   ├── pathfinding/    # Pathfinding algorithms and logic
  │   └── searching/      # Searching algorithms
  ├── templates/          # HTML templates for each algorithm category
  └── index.html          # Main landing page

Contributing

Pull requests are welcome! For major changes, please open an issue first to discuss what you would like to change.