综合
Maze generation algorithm
A maze generation algorithm carves passages through a walled grid so every cell connects with no loops and one route between any two cells, forming a spanning tree.
综合
Minimum spanning tree
A minimum spanning tree is a subset of edges that connects all vertices of a weighted, undirected graph with no cycles and the least total weight; Kruskal's and Prim's algorithms compute it.
综合
Prim's algorithm
Prim's algorithm, also known as the Jarník algorithm, is a greedy algorithm that computes a minimum spanning tree by growing a tree from a starting vertex.