Prim's and Kruskal's algorithms are greedy methods used to find a Minimum Spanning Tree (MST) in a weighted graph.

Here I've used them to generate mazes. The resulting mazes have noticeably different characteristics.

While Kruskal's algorithm produces mazes that look very natural and uniform with many short dead ends. Prim's algorithm tends to produce mazes with more straight lines and a slightly "radial" pattern growing outward from the starting point. It generates fewer, but longer, dead ends compared to Kruskal's.

At the end, BFS was used to find the shortest path for solving mazes.

#algorithms #datastructures #datastructuresandalgorithms #computerscience #programming #python #cplusplus #javascript #algorithmvisualization #competitiveprogramming #leetcode #linkedlists #coding #binarytree #softwareengineering #graphalgorithm #graphtheory #spanningtree #minimumspanningtree #primsalgorithm #kruskalsalgorithm #bfs #dijkstra

Prim's Algorithm vs Kruskal's Algorithm for Maze Generation