-
LINK
建立链表的算法：
新节点链入表尾建立链表：
动态分配第一个节点变量；
用指针head 妥善保存链表第一个节点的地址值；
依次动态分配一个新节点变量；
将上一个节点的指针域指向新生成的节点；
循环3),4)步骤，直到所有节点均连入链表；
将最后一个节点的指针域赋值为0；
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分：1
-
ALGO3-9
用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)
- 2008-07-02 02:41:08下载
- 积分：1
-
Fund6-StringViewer
字符串，实现了文件中查找想要的字符串，并将其标记出来
- 2010-12-26 20:51:45下载
- 积分：1
-
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
- 2013-11-28 10:53:29下载
- 积分：1
-
BeiDa_ACM1702
北大ACM1702题 转换为3进制
很经典(NULL)
- 2009-12-08 11:31:40下载
- 积分：1
-
edge-betweenness
计算边介数,复杂网络，中心性计算，介数也可以计算，运用了数据结构，计算大量数据(edge betweenness，complex network， centrality)
- 2021-05-15 01:30:03下载
- 积分：1
-
huffman
使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
- 2013-07-15 23:59:47下载
- 积分：1
-
yongzhanshixianleicaozuo
自己做的一个用用栈实现类的操作，是课内作业，希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
- 2007-12-25 22:28:05下载
- 积分：1
-
fiterVC051002116
用VC++编写中值滤波的算法，具有图形界面(The algorithm of Filter ，which use VC++)
- 2009-09-09 21:40:43下载
- 积分：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
