Prim's algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph.
確定! 回上一頁