Overview

Currently, the program visualizes the completed pathfinding process as shown below:

While this provides a basic view of the result, there is significant potential to enhance the visualization for better understanding of how the algorithms operate step by step. This issue proposes a set of features to make the visualization clearer, more informative, and interactive.

Proposed Visualization Features

• Step-by-step animation of the algorithm's progress
• Distinct color coding for open set, closed set, and final path
• Display of node costs (g, h, f for A*) directly on the grid
• Option to pause, play, or step through the algorithm
• Highlight start and end nodes more clearly
• Show visited nodes order, e.g., with fading or numbering
• Visualization of the frontier expansion
• Support for different color themes/modes
• Dynamic speed adjustment for animation
• Option to switch between A* and Dijkstra modes and compare visually
• Tooltip or info display when hovering over a node (showing costs, parent, etc.)
• Export visualization as an image or video/gif
• Display statistics such as number of visited nodes, total path length, computation time

Sub-issues will be created to break down the implementation of these features.