-
xianxinglianbiao
c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
- 2013-11-09 14:30:30下载
- 积分：1
-
test
矩阵运算器，c语言编程，数据结构，免费下载(Matrix calculator, c language programming, data structures, free download)
- 2008-05-04 09:32:59下载
- 积分：1
-
有序链表的合并
将两个有序的链表合并，分别有A、B两个链表。通过比较A、B是否有相同的元素，从而对链表进行合并(Merge the two ordered linked lists, A and B respectively. Merge linked lists by comparing whether A and B have the same elements)
- 2019-01-08 09:59:00下载
- 积分：1
-
C++
说明： 标准答案习题1
1.1 简述C++语言程序的结构特点。
答：
（1）C++程序由一个或多个函数组成，其中至少有一个主函数main()，程序从主函数开始执行，由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
- 2008-11-25 16:16:27下载
- 积分：1
-
Library
数据结构课程设计 数据结构B+树
B+ tree Library(B+ tree Library)
- 2009-05-18 14:07:25下载
- 积分：1
-
Dijkstra
主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
- 2010-09-25 17:37:40下载
- 积分：1
-
Kruskal
Kruskal in Data structure
- 2013-10-02 21:20:46下载
- 积分：1
-
heap
说明： Heap Data structure PPT
- 2020-11-22 17:24:41下载
- 积分：1
-
数据结构(C语言版)
说明： 该书籍详细讲述了C语言的数据结构部分，不断提高你的编程能力。(This book describes the data structure of C language in detail, and constantly improves your programming ability.)
- 2020-06-22 07:00:01下载
- 积分：1
-
the-average-path-length
问题描述：平均路径长度是网络中另一个重要的特征度量，他是网络中所有节点对之间的平均最短距离。这里节点间的距离指的是从一个节点要经历的边的最小数目，其中所有节点之间的最大距离称为网络的直径。平均路径长度和直径衡量的是网络的传输性能与效率。平均路径长度的公式为
，其中dij表示点i和j之间的最短距离（若dij不存在时，dij就不能加入，且分母要相应减1）
要求：输入邻接矩阵表示的图，计算其平均路径长度(Description of the problem: the average path length is another important network characteristics measure between all pairs of nodes in the network, the average shortest distance. Here the distance between nodes refers to the minimum number from one node to be subjected to the edge, wherein the maximum distance is referred to as the diameter of the network between all nodes. The average path length and diameter measurement of the performance and efficiency of the network' s transmission. The formula of the average path length, where dij indicates the shortest distance between points i and j (if dij is not present, dij can not join, and the denominator accordingly minus 1) requirements: Input adjacency matrix shows, to calculate its average path length)
- 2021-04-21 14:58:49下载
- 积分：1
