登录
首页 » 电子书 » 10 e

10 e

于 2023-07-17 发布 文件大小:27.66 MB
0 35
下载积分: 2 下载次数: 1

代码说明:

10部算法的经典电子书合集,chm格式。-10 e-book collection of classic algorithms, chm format.

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

发表评论

0 个回复

  • C++数据结构算法的籍综合分析,网络游戏的发展。
    一本全面剖析C++数据结构算法的书籍,网络游戏开发必看手册!-A comprehensive analysis of C++ data structure algorithms books, online games development handbook a must-see!
    2022-02-05 11:53:53下载
    积分:1
  • guide book for linux programming
    guide book for linux programming-embed linux for embed application
    2022-05-09 06:35:45下载
    积分:1
  • 吃豆的游戏.非常好玩,截面精美
    吃豆子的游戏.非常好玩,截面精美-eat beans game. Very fun, exquisite section.
    2022-07-03 21:30:22下载
    积分:1
  • The realization of the development of J2ME mobile phone games, cell phone games...
    实现J2ME的手机游戏开发,帮助初学者了解手机游戏开发与设计的架构。-The realization of the development of J2ME mobile phone games, cell phone games to help beginners understand the structure and design of development.
    2022-02-05 05:58:00下载
    积分:1
  • 一本精通java swing的
    一本精通java swing的书籍-a proficient swing java books
    2022-08-03 02:11:51下载
    积分:1
  • Java编程语言lt;lt;gt;gt;3
    < java编程语言>>part3-lt; Lt; Java programming language gt; Gt; Part3
    2022-07-10 02:58:18下载
    积分:1
  • 分形源程序集合,很有价值! 国外代码!
    分形源程序集合,很有价值! 国外代码!-Fractal source pool of great value! Foreign code!
    2022-05-23 05:04:36下载
    积分:1
  • java的api的介绍,对java的api进行了全面系统的介绍,并给出了很多例...
    java的api的介绍,对java的api进行了全面系统的介绍,并给出了很多例子-of the api, the right java api for a comprehensive system, and gives many examples
    2022-06-16 07:20:46下载
    积分: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
  • With vc++ Development Usb programming interface documentation detailing
    用vc++开发Usb接口编程的详细文档
    2023-05-26 15:30:02下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载