-
lab07
本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
- 2013-05-12 22:01:58下载
- 积分：1
-
B_Tree
B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)
- 2020-10-18 18:17:26下载
- 积分：1
-
StringClass
这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
- 2006-05-17 17:46:58下载
- 积分：1
-
DLinkedList
双链表的定义和插入算法，双链表的定义，删除，插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
- 2013-07-17 15:38:38下载
- 积分：1
-
DIJKSTRA算法实现的最短路径程序linjiebiaoshortpath
用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)
- 2020-07-16 10:48:49下载
- 积分：1
-
fiterVC051002116
用VC++编写中值滤波的算法，具有图形界面(The algorithm of Filter ，which use VC++)
- 2009-09-09 21:40:43下载
- 积分：1
-
sort
归并排序,复习排序算法，在不同环境下，寻找时间复杂度最少的排序算法(
Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
- 2013-11-05 22:15:57下载
- 积分：1
-
communication
VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
- 2012-09-02 17:11:12下载
- 积分：1
-
Prim
编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分：1
-
length
利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
- 2011-09-01 11:13:51下载
- 积分：1
