搜索资源列表
ds grafh
- 一个关于图的遍历的操作实现-a map of the operation to achieve the ergodicity
ds grafh
- 一个关于图的遍历的操作实现-a map of the operation to achieve the ergodicity
bintree
- 二叉树的建立,遍历(两种方法),以及用txt文件存储二叉树的方式,还包括队列 堆栈的操作-Tree establishment, ergodicity (two methods), as well as txt file storage by way of binary tree, but also the operation of queue stack
tree
- 完成二叉树的初始化、遍历以及相应的操作-Complete binary tree initialization, ergodicity and the corresponding operation
kkkk
- 创建邻接表, 采用 广度遍历非递归 或 深度优先搜索-The creation of the adjacent table, using the breadth of ergodicity or non-recursive depth-first search
RBTree
- bfs是宽度遍历，在acm中占着很大的作用，这份课件包含了大部分内容-BFS is the width of ergodicity, in the acm plays a significant role in, the software contains most of the contents of
chengxu3
- 混沌遍历性的Matlab实现 No3.m函数是一个通用的logistic蛛网图函数 生成的蛛网图. -Chaos ergodicity No3.m realize the Matlab function is a generic logistic map function generated cobweb cobweb diagram.
2
- 用回溯解背包问题 假设有n件物品，定义一个结构体a[]来存储，结构体有两个成员weight和value(weight表示重量，value表示价值)先定义一个数组col[]表示每个物品当前状态（为1表示被选，为0表示未被选），其初值全为1，从下标为0开始遍历，当前所选物品总重和总价值分别设为tw和tv（初值均为0），背包的限重设为limit，若第i个物品满足tw+a[i].weight<=limit且col[i]==1 就将a[i]
ModemInfo
- 通过调用第3方的VC++类,实现具有遍历MODEM名字,COM口和初始化字符串等功能的一个实例-By calling the No. 3 party VC++ Category, achieving ergodicity MODEM name, COM port and initialization string functions such as an instance of
reactive_optimization
- 变尺度混沌优化(MSCOA)是一种改进的混沌优化方法(COA)，利用混沌运动的内在随机性、遍历性和规律性进行全局寻优。-Mutative scale chaos optimization (MSCOA) is an improved chaos optimization algorithm (COA), the use of chaotic motion of the inherent randomness, ergodicity an
castle
- castle 给出一个城堡的地图，求其中的连通房间数，最大房间的面积，拆除某个墙壁连通两间屋子后可形成的最大房屋面积。前面求面积还比较简单，用种子填充法即可，后面的找连通两房间的实在是有很多可能。后来想到用遍历，压栈弹栈的过程要考虑清楚，不要重复压栈。也不要在边界上犯错。-castle to give a castle map, and number of rooms in which the connectivity, the l
2
- 2叉树建立以及遍历 2叉树建立以及遍历-2-tree-building as well as the 2-tree traversal, as well as the establishment of ergodicity
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishm
TREE
- 树的基本操作实现。内容包括先序、中序、后序、层次遍历，树的深度等。-Tree to achieve the basic operation. Including first order, in sequence, after the order, the level of ergodicity, the depth of the tree.
masterlist
- 完美世界怪物列表遍历VB源代码。怪物列表主要运用了内存地址遍历原理。-Perfect World Monster list traversal VB source code. Monster List of main memory addresses using the principle of ergodicity.
ADODataControl
- 使用ADO Data和DataGrid控件实现遍历、修改、删除、添加 VC++6.0 很到得示例代码.-The use of ADO Data Control and DataGrid to achieve ergodicity, modify, delete, add to the VC++6.0 is a sample code.
3
- C语言版，C/C++开发环境均可用，如VC。可学习借鉴 问题算法 骑士遍历 万年历,N皇后问题回溯算法.c 货郎担限界算法.c-C language, C/C++ development environment can be used, such as VC. Algorithm can learn from the question of ergodicity calendar Knight, N Queen'
SHUDU
- 自己写了个数独程序，很简单，主要是遍历的思想-Himself wrote a number of independent procedures, is very simple, mainly the idea of ergodicity
na2
- 数据结构中串的实验，可实现求叶子数，求结点数，按层次遍历，求二叉树的深度等功能-Data structure in the experimental series can be realized for a few leaves, and nodes, according to the level of ergodicity, and the functions of the depth of binary tree
ergodicity-of-Logistic-map
- 简单混沌映射logistic映射的遍历性-the ergodicity of the logistic map