孙鑫老师VC++的视频教学!(第一章,已转化为多个FLASH文件,高质量)VC++入门必须了解的内容,Windows程序运行原理及程序编写流程，窗口产生过程，句...
孙鑫老师VC++的视频教学!(第一章,已转化为多个FLASH文件,高质量)VC++入门必须了解的内容,Windows程序运行原理及程序编写流程，窗口产生过程，句柄原理，消息队列，回调函数，窗口关闭与应用程序退出的工作关系，使用VC++的若干小技巧，stdcall与cdecl调用规范的比较，初学者常犯错误及注意事项.-Xin Sun Video VC teachers teaching! (The first chapter, has been translated into more than FLASH document, high quality) VC entry must understand the content, procedures Windows operating principle and procedure of the preparation process, window selection process, handle principle, Message Queue, a callback function, the window is closed and application procedures to withdraw from the working relationship The use of a number of small VC skills stdcall and cdecl calling norms, Beginners often make mistakes and tips.
- 2023-08-02 18:50:16下载
- 积分：1
图论中最小生成树Kruskal算法 及画图程序 M
图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
- 2022-01-30 21:32:39下载
- 积分：1
