Location:
Search - ergodicity
Search list
Description: 一个关于图的遍历的操作实现-a map of the operation to achieve the ergodicity
Platform: |
Size: 204339 |
Author: zyj |
Hits:
Description: 一个关于图的遍历的操作实现-a map of the operation to achieve the ergodicity
Platform: |
Size: 203776 |
Author: zyj |
Hits:
Description: 二叉树的建立,遍历(两种方法),以及用txt文件存储二叉树的方式,还包括队列 堆栈的操作-Tree establishment, ergodicity (two methods), as well as txt file storage by way of binary tree, but also the operation of queue stack
Platform: |
Size: 6144 |
Author: 王家 |
Hits:
Description: 完成二叉树的初始化、遍历以及相应的操作-Complete binary tree initialization, ergodicity and the corresponding operation
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 创建邻接表, 采用 广度遍历非递归 或 深度优先搜索-The creation of the adjacent table, using the breadth of ergodicity or non-recursive depth-first search
Platform: |
Size: 1024 |
Author: kl007 |
Hits:
Description: bfs是宽度遍历，在acm中占着很大的作用，这份课件包含了大部分内容-BFS is the width of ergodicity, in the acm plays a significant role in, the software contains most of the contents of
Platform: |
Size: 89088 |
Author: 阿宝 |
Hits:
Description: 混沌遍历性的Matlab实现
No3.m函数是一个通用的logistic蛛网图函数
生成的蛛网图.
-Chaos ergodicity No3.m realize the Matlab function is a generic logistic map function generated cobweb cobweb diagram.
Platform: |
Size: 3072 |
Author: 何任飞 |
Hits:
Description: 用回溯解背包问题 假设有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].weight和value加入tw和tv，否则col[i]设为0。-Knapsack problem using backtracking solution assumption has n items, the definition of a structure a [] to store, structure, body weight and has two members value (weight, said weight, value, said value) before the definition of an array col [] mean that each and every item current status (as one said to be elected, not selected to express to 0), all of its initial value 1, from the beginning subscript 0 ergodicity, the currently selected items and the total value of gross weight, respectively, as tw and tv (early values are 0), backpack weight limit is set to limit, if paragraph i of goods to meet tw+ a [i]. weight
Platform: |
Size: 180224 |
Author: STartBoy |
Hits:
Description: 通过调用第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
Platform: |
Size: 1981440 |
Author: sun |
Hits:
Description: 变尺度混沌优化(MSCOA)是一种改进的混沌优化方法(COA)，利用混沌运动的内在随机性、遍历性和规律性进行全局寻优。-Mutative scale chaos optimization (MSCOA) is an improved chaos optimization algorithm (COA), the use of chaotic motion of the inherent randomness, ergodicity and regularity for global optimization.
Platform: |
Size: 297984 |
Author: xiaofang |
Hits:
Description: castle
给出一个城堡的地图，求其中的连通房间数，最大房间的面积，拆除某个墙壁连通两间屋子后可形成的最大房屋面积。前面求面积还比较简单，用种子填充法即可，后面的找连通两房间的实在是有很多可能。后来想到用遍历，压栈弹栈的过程要考虑清楚，不要重复压栈。也不要在边界上犯错。-castle to give a castle map, and number of rooms in which the connectivity, the largest room size, removal of walls connected to a house after 2 the formation of the largest housing area. Area in front of demand is still relatively simple method can be filled with seeds, to find the back of two connected rooms is a lot of potential. Was thought by ergodicity, the process stack push shells must consider very carefully, do not repeat the push. Do not make mistakes at the border.
Platform: |
Size: 1024 |
Author: 求索 |
Hits:
Description: 2叉树建立以及遍历 2叉树建立以及遍历-2-tree-building as well as the 2-tree traversal, as well as the establishment of ergodicity
Platform: |
Size: 1024 |
Author: danny |
Hits:
Description: 题目1：图的建立与遍历；连通网的最小生成树生成实现。
内容：
1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。
2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。
3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。
-Title 1: Map of the establishment and ergodicity connectivity network to achieve minimum spanning tree generated. Content: 1) that the methods used to establish the adjacent table shown in Figure 1 Figure storage structure, said depositors with adjacency matrix method as shown in Figure 2 network storage structure. 2) In Figure 1 storage structure (adjacency list) to achieve depth-first search traversal and breadth-first search traversal, and gives Ergodic results (sequence). 3) in accordance with the prim algorithm, as shown in Figure 2-connected network storage structure (adjacency matrix) to achieve this network, minimum spanning tree and spanning tree output.
Platform: |
Size: 11264 |
Author: sad |
Hits:
Description: 树的基本操作实现。内容包括先序、中序、后序、层次遍历，树的深度等。-Tree to achieve the basic operation. Including first order, in sequence, after the order, the level of ergodicity, the depth of the tree.
Platform: |
Size: 1024 |
Author: duhongye |
Hits:
Description: 完美世界怪物列表遍历VB源代码。怪物列表主要运用了内存地址遍历原理。-Perfect World Monster list traversal VB source code. Monster List of main memory addresses using the principle of ergodicity.
Platform: |
Size: 4096 |
Author: adetion |
Hits:
Description: 使用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.
Platform: |
Size: 98304 |
Author: hsc |
Hits:
Description: 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' s problem backward algorithm. C-Bound Algorithm for Traveling Salesman. C
Platform: |
Size: 23552 |
Author: 李小虎 |
Hits:
Description: 自己写了个数独程序，很简单，主要是遍历的思想-Himself wrote a number of independent procedures, is very simple, mainly the idea of ergodicity
Platform: |
Size: 1024 |
Author: MR_WANG |
Hits:
Description: 数据结构中串的实验，可实现求叶子数，求结点数，按层次遍历，求二叉树的深度等功能-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
Platform: |
Size: 1024 |
Author: 王瑞卿 |
Hits:
Description: 简单混沌映射logistic映射的遍历性-the ergodicity of the logistic map
Platform: |
Size: 110592 |
Author: lanlin |
Hits: