A video showing the generation of a maze through the application of Prim's algorithm to a randomly weighted grid graph. This greedy algorithm, named for Robert C. Prim, finds a minimum spanning tree for a connected, weighted, undirected graph.Animation: Dllu