网站首页

图论的英文书，是学习图论的基本资料，包括图，随机图，树等定义和课后练习...

于 2022-01-26 发布文件大小:4.39 MB

 0  224

下载积分: 2 下载次数: 1

我要下载

代码说明：

图论的英文书，是学习图论的基本资料，包括图，随机图，树等定义和课后练习 -Graph Theory of the English books, is to learn graph theory, basic information, including maps, random maps, trees and other definitions and after-school practice

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

UML和模式应用和教程，应用内容比较全面。
UML和模式应用和教程，应用内容比较全面。-UML和模式应用

2023-04-30 18:00:04下载

积分：1
计算机网络的PPT，实用性很强，初学者适用
计算机网络的PPT，实用性很强，初学者适用-Computer Networks PPT, very practical, for beginners

2022-01-26 15:55:32下载

积分：1
基于曲线拟合的笔迹存储和绘制方法的研究.
基于曲线拟合的笔迹存储和绘制方法的研究.-Curve fitting based on the handwriting and drawing method storage research.

2022-08-03 18:48:00下载

积分：1
关于VC中MFC应用的书籍，讲解非常清楚，对初学者很有用
关于VC中MFC应用的书籍，讲解非常清楚，对初学者很有用-On MFC application in VC books, on very clear and very useful for beginners

2022-07-27 09:05:52下载

积分：1
控制系统的matlab,非常有用
控制系统的matlab,非常有用-control system of Matlab, very useful

2022-03-30 08:40:35下载

积分：1
FPGA design instruction manual PDF version of the design they simply consider th...
FPGA设计指导手册PDF版将如何设计fpga的,考虑了一些FGPA的关键问题可以参考一下对初学者有帮助的-FPGA design instruction manual PDF version of the design they simply consider the FGPA some of the key issues for reference to help beginners

2022-04-08 04:56:07下载

积分：1
很经典的书籍，学习C++必看的书，学会了思考，才学会了编程，书里有还有部分代码，...
很经典的书籍，学习C++必看的书，学会了思考，才学会了编程，书里有还有部分代码，-classic books, learning C Watchable book, and learn to think before they learn how to program, the book is also part of code

2022-04-17 08:52:53下载

积分：1
C++ Primer Third Edition 第三版
C++ Primer Third Edition 第三版-C++ Primer Third Edition The third edition

2022-01-22 17:23:05下载

积分：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
多
Multi-block Methods for Exploratory Data Mining in Food Technology

2022-08-20 18:02:55下载

积分：1

696516资源总数
106428会员总数
7今日下载

图论的英文书，是学习图论的基本资料，包括图，随机图，树等定义和课后练习...

0 个回复

热门标签

热门下载