SearchAlgoViz-v1.0.0

Search Algorithm Visualization UI

An interactive educational tool for visualizing popular search algorithms in computer science. The application provides a graphical interface to demonstrate both uninformed and informed search strategies. The application serves as both a learning tool and a demonstration platform for understanding how different search algorithms explore and find paths in various graph structures.

Supported Algorithms

Uninformed Search Algorithms:

• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Depth-Limited Search (DLS)
• Iterative Deepening Search (IDS)
• Uniform Cost Search (UCS)

Informed Search Algorithms:

• Greedy Best-First Search (GBFS)
• A* Search Algorithm

Features

• Interactive visualization of search processes
• Color-coded nodes showing search progress:
  • Green: Start node
  • Red: Goal node
  • Blue: Path node
  • Orange: Visited node
  • Dark Orange: Currently visiting node
  • White: Unvisited node
• Real-time path visualization
• Cost display for weighted searches (UCS)
• Built-in graph structures:
  • Binary tree for basic demonstrations
  • Surigao del Norte map for A* pathfinding
• Node information display including:
  • Place names
  • Travel costs
  • Distance information
• Step-by-step execution with visual feedback
• Reset functionality for multiple runs

Technical Details

• Built with Python and CustomTkinter
• Modular architecture with separate logic for each algorithm
• Canvas-based visualization
• Event-driven interface
• Configurable animation speed
• Support for both weighted and unweighted graphs

Use Cases

• Educational demonstrations
• Algorithm comparison
• Path planning visualization
• Teaching tool for computer science courses
• Understanding search algorithm behavior