文件名称:MinimumspanningtreePrim
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
Dandn文件给出了输入参数的名称及格式
即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn file name given input parameters and format that is called prim before Input adjacency matrix D and node numbers n input prim are two lines of the matrix T, the number of up and down two lines can be connected to the corresponding node
即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn file name given input parameters and format that is called prim before Input adjacency matrix D and node numbers n input prim are two lines of the matrix T, the number of up and down two lines can be connected to the corresponding node
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最小生成树Prim算法
..................\Dandn.m
..................\prim.m
..................\说明.txt
..................\Dandn.m
..................\prim.m
..................\说明.txt