-
reverse
本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)
- 2013-05-29 14:25:34下载
- 积分：1
-
Kruskal
采用Kruskal算法求最小生成树主要数据结构
edgeset GE 存放图中的所有边
int n,int e 存放图中的顶点数与边数
edgeset C 存放生成树中的边
vexlist gv 图中结点的顶点值
adjmatrix s 用来处理图中结点的查找与合并
int m1,m2 一条边上两顶点所属集合的序号
int k 最小生成树中的边数
int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
- 2011-05-17 10:22:56下载
- 积分：1
-
Josephus(data_struct)
数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
- 2013-11-17 11:30:24下载
- 积分：1
-
qiongju
八皇后算法，用的是最简单的穷举法，在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
- 2013-08-14 22:21:28下载
- 积分：1
-
deep-copy
该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分：1
-
nuaa1507_DancingLink_trackback.cpp
高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
- 2010-03-07 10:54:32下载
- 积分：1
-
point
用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
- 2012-12-16 13:14:04下载
- 积分：1
-
structure-array-code
根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
- 2013-10-09 14:35:43下载
- 积分：1
-
5-source--code-of-DS--PRO
数据结构课上老师布置的5个小项目的源代码，分别是汽车过河，一元多项式，迷宫，日历，BFS_DFS(failed to translate)
- 2011-05-18 17:01:17下载
- 积分：1
-
b
说明： 定义一个类SortArray继承自MyArray，在该类中定义函数sort实现排序功能。
定义一个类ReArray继承自MyArray，在该类中定义函数reverse实现逆转功能。
定义一个类AverArray继承自MyArray，在该类中定义函数Aver实现求解整数的平均值。
定义NewArray类，同时继承了SortArray、ReArray和AverArray，使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类，体会虚基类在解决二义性问题中的作用。
(Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)
- 2010-06-02 02:13:03下载
- 积分：1
