Introduction - If you have any usage issues, please Google them yourself
Prim minimum spanning tree algorithm. The file of Dandn up and down two rows of numbers corresponding node connected to the name and format of the input parameters that prim is called before the first two rows of the matrix T n input prim input adjacency matrix D and the number of nodes.