Introduction - If you have any usage issues, please Google them yourself
Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and the node number n input prim to be two lines of the matrix T, the upper and lower figures correspond to two lines of nodes connected to can