Description: 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
To Search:
File list (Check if you may need any files):
最小生成树Prim算法\Dandn.m
..................\prim.m
..................\_desktop.ini
..................\说明.txt
最小生成树Prim算法