NeoRoute: A Pathfinding Algorithm Visualizer

NeoRoute is a pathfinding algorithm visualizer tool that can help visualize complex pathfinding algorithms in an interactive and enjoyable way. Pathfinding algorithms are used in computer science and engineering to find the shortest or most efficient path between two points in a network or graph. Gaming, robotics, transportation, education, etc are some use cases of pathfinding algorithms. For example, Google Maps uses Dijkstra’s and A* algorithms to find the shortest path. Along with the algorithms used by Google Maps, NeoRoute also provides a Bidirectional algorithm, BFS, and DFS algorithms for visualization. The user is represented with a grid including a start node and target node that can be relocated easily. Users can add blocks or a bomb that act as dynamic inputs or use provided pattern generators to save time. Later the users can select pathfinding algorithms from the list of implementable algorithms. The grid is then filled with some interesting animations further showing the shortest path between the start and target nodes. This tool can be used by students, teachers, and beginners in programming to understand how pathing algorithms work. This tool can also help users differentiate between various pathing algorithms and choose the right one for their future projects.