Made a cool site with AI as a newbie

The website offers interactive visualizations of various algorithms such as Breadth-First Search (BFS) pathfinding, heap operations, A* pathfinding, and Dijkstra's Shortest Path algorithm. Users can set obstacles, start and end points in a network, and observe the algorithms in action. The BFS pathfinding visualization demonstrates how the algorithm finds the shortest path, while the heap visualization illustrates insertions and deletions dynamically. The A* pathfinding visualization showcases another pathfinding algorithm, allowing users to understand its process. Additionally, the Dijkstra Shortest Path algorithm enables users to set weights between nodes and calculate the shortest path from a selected starting point. These interactive tools provide a hands-on way for users to learn and comprehend the principles behind these algorithms.