Graph Algorithms Visualizer

Graph Algorithms Visualizer is a project that visualizes different types of graph algorithms on an MxN grid.

Path-finding Algorithms

• Depth-First-Search
• Breadth-First-Search
• A* using Manhattan Distance h(n)
• Dijkstra (Uniform-Cost-Search variant)
• Greedy-Best-First Search using Manhattan Distance
• Bidirectional Search
  • A*
  • BFS
  • Greedy-BFS
  • Dijsktra (UCS)

Random Maze Generation Algorithms (Random Spanning Trees)

• Prim's Algorithm
• Recursive Backtracker

Minimum Spanning Tree Algorithms

• Prim's Algorithm

Topological Sorting

• Kahn's Algorithm

How To Run

To run this project locally, follow these steps:

1. Clone the repository:

   git clone https://github.com/ShaanManchanda/Graph-Algorithms-Visualizer.git

2. Navigate to the project directory:

   cd Graph-Algorithms-Visualizer

3. Run the application:

• Locate the index.html file in the project directory.
• Right-click on index.html and choose "Open with" your preferred web browser.
• Alternatively, you can directly open the file using your browser by double-clicking on it.