Path-Finding algorithm

Pathfinding visualizer is an interactive tool built in Unity, showcasing three popular algorithms: Breadth-First Search (BFS), Depth-First Search (DFS), and Dijkstra's Algorithm. Users can see how each algorithm navigates through a complex 3D environment to find the shortest path between two points.

• BFS explores all possible paths level by level, ensuring the shortest path in unweighted graphs.
• DFS dives deep into each path before backtracking, often yielding a more winding route.
• Dijkstra's Algorithm guarantees the shortest path in weighted graphs, accounting for varying travel costs between nodes.

The visualizer highlights each algorithm's process in real-time, showing how nodes are explored and paths are constructed. The 3D environment adds an extra layer of depth and immersion, making it a great tool for educational purposes or algorithm enthusiasts.