Generating and Solving Mazes Using Parallel Minimum Spanning Tree Algorithms

This paper proposes a method for generating and solving mazes using minimum spanning tree algorithms and parallelizing them using OpenMP. The approach involves generating a random maze using Prim's and Kruskal's algorithms, which constructs a minimum-spanning tree from a set of edges. The maze is then solved using Dijkstra's algorithm, which finds the minimum spanning tree from a given starting point. To optimize the algorithms' performance, the parallel processing capabilities of OpenMP are utilized to distribute the workload across multiple processors. The results of the experiments demonstrate the effectiveness of the proposed method in generating and solving mazes efficiently, with significant reductions in computation time achieved through parallelization.