-
tudebianli
图的遍历问题 数据结构 C C++ 源码 课程设计
严蔚敏版的书(yrteryryer)
- 2010-05-08 09:24:06下载
- 积分：1
-
Map-four-staining
用不多于四种颜色为地图染色，使相邻的行政区不重色，是计算机科学中著名的“四染色”的典型应用，应用这个思想，是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)
- 2012-12-05 13:20:37下载
- 积分：1
-
paixu
简单选择排序，这是个解决排序问题的一个算法模型之一。(Sort simple choice, this is a solution to a scheduling problem, one algorithm model.)
- 2008-06-24 00:40:18下载
- 积分：1
-
ysph
约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)
- 2009-03-14 00:16:15下载
- 积分：1
-
KD-tree
kd-树（k维搜索树）是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
- 2013-05-10 11:03:53下载
- 积分：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
-
data-structure-paper
本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
- 2013-09-18 08:16:24下载
- 积分：1
-
maze
迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分：1
-
prim
普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
- 2012-05-17 09:11:15下载
- 积分：1
-
process_schedule
演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo
)
- 2011-12-24 10:52:17下载
- 积分：1
