Description: The Dandn file gives the name and format of the input parameter
That is, before entering prim, the adjacency matrix D and the number of nodes n are input
Input prim
Get the matrix T of the two row, and connect the nodes corresponding to the two lines of the upper and lower rows
To Search:
File list (Check if you may need any files):
最小生成树Prim算法\Dandn.m
最小生成树Prim算法\prim.m
最小生成树Prim算法\说明.txt
最小生成树Prim算法