Real-Time Visualization and Comparative Performance Analysis of Maze Generation and Pathfinding Algorithms

Abstract

Algorithm visualization remains a critical challenge
in computer science education, particularly for spatial algorithms
such as maze generation and pathfinding. This paper presents an
interactive educational platform that provides real-time visualiza
tion of three maze generation algorithms (Recursive Backtrack
ing, Prim’s, and Kruskal’s) and three pathfinding algorithms
(DFS, BFS, and A*). The system features a modular architecture
with comprehensive performance analysis capabilities, achieving
consistent 60 FPS visualization while maintaining memory usage
below 0.15 MB. Empirical evaluation demonstrates that A*
pathfinding reduces node exploration by approximately 75%
compared to BFS and 67% compared to DFS, while maintaining
optimal path guarantees.