登录
首页 » 电子书 » reprinted : for the study of computers in particular Java perhaps help others fe...

reprinted : for the study of computers in particular Java perhaps help others fe...

于 2022-08-12 发布 文件大小:1.75 MB
0 138
下载积分: 2 下载次数: 1

代码说明:

转载的:本文对于学习计算机尤其是Java或许有点帮助,好好体会人家感受吧-reprinted : for the study of computers in particular Java perhaps help others feel good experience it

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • MATLAB Simulations for Radar Systems DesignAB_Simulations_for_Radar_Systems_Desi...
    MATLAB Simulations for Radar Systems DesignAB_Simulations_for_Radar_Systems_Design
    2023-02-03 08:05:05下载
    积分:1
  • MSP430 C语言编程的程序堆栈溢出分析
    MSP430 C语言编程的程序堆栈溢出分析-MSP430 C language programming procedures stack overflow analysis
    2023-02-14 12:55:03下载
    积分:1
  • On a neural network matlab good books,
    一本关于matlab神经网络不错的书籍, -On a neural network matlab good books,
    2022-01-25 18:58:43下载
    积分:1
  • 通讯类的标准。对要开发SS7的朋友有很大帮助的。(通讯协议)...
    通讯类的标准。对要开发SS7的朋友有很大帮助的。(通讯协议)-Communications standards. On to develop SS7 friends are very helpful. (Communication protocols)
    2022-06-20 08:52:52下载
    积分: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
  • 这是一本写遗传算法解决问题的 对初学者是很有用的
    这是一本写遗传算法解决问题的书 对初学者是很有用的-it is a book to resolve problems in GA. It is very useful for primer learners.
    2023-01-15 04:05:04下载
    积分:1
  • 个人认为是Fortran最权威的一本,呵呵,这可是我一直用的宝典...
    个人认为是Fortran最权威的一本书,呵呵,这可是我一直用的宝典-Fortran individuals considered to be one of the most authoritative book, huh, huh, this is the book I have been used
    2023-08-31 23:35:04下载
    积分:1
  • VisualC++实践与提高
    VisualC++实践与提高-ActiveX篇源码-VisualC++ Practice and improve source-ActiveX articles
    2022-07-26 19:56:39下载
    积分:1
  • C++参考,很经典
    C++参考书,很经典-C reference books, classic
    2022-01-21 00:16:40下载
    积分:1
  • 汽车构造FLASH。汽车构造FLASH 汽车构造FLASH 。汽车构造FLASH
    汽车构造FLASH。汽车构造FLASH 汽车构造FLASH 。汽车构造FLASH-Automotive Construction FLASH. FLASH automotive car tectonic structure FLASH. Automotive Construction FLASH
    2022-10-10 11:20:03下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载