Skip to content

README.md

Latest commit

 

History

History
42 lines (25 loc) · 1.02 KB

README.md

File metadata and controls

42 lines (25 loc) · 1.02 KB

Search Algorithm Visualization in Python

This project provides visualizations for various search algorithms implemented in Python. You can see how algorithms like Depth-First Search (DFS), Breadth-First Search (BFS), Greedy Best-First Search (GBFS), and A* work in real-time.

Algorithms Implemented

  • Depth-First Search (DFS)
  • Breadth-First Search (BFS)
  • Greedy Best-First Search (GBFS)
  • A* Search Algorithm (ASTAR)

Getting Started

  1. Clone the repository:

    git clone https://github.com/tharushaudana/search-algorithm-visualization-python.git

  2. Run the visualization script:

    python main.py

Screenshots

Screenshot 1

Screenshot 2

Screenshot 3

Screenshot 4

Contributing

Contributions are welcome! Please feel free to open a pull request.

License

This project is licensed under the MIT License - see the LICENSE file for details.