This Python project utilizes Pygame to visualize various sorting algorithms and graph traversal algorithms. It provides a graphical representation of how these algorithms operate on arrays and graphs, allowing users to observe their behavior step-by-step.
-> Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, Heap Sort.
-> Ascending and descending order options.
-> Customizable speed control for animation.
-> Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms.
-> Visualization of traversal path and visited nodes.
-> Customizable speed control for animation.
-> Interactive UI with keyboard controls.
-> Switch between sorting algorithms and graph traversal algorithms.
-> Reset functionality to regenerate arrays and graph structures.
-> Home screen for easy navigation.
-> Detailed instructions and controls displayed during runtime.
-> Color-coded visualization for better understanding.