搜索资源列表
5个c程序源代码
- 五个c源代码 矩阵的运算方法 邻接矩阵求解最短路径 全屏幕模拟时钟 先序遍历非递归算法 字符串查找-5 c source code matrix arithmetic method adjacency matrix for the Shortest Path full-screen analog clock preorder non - recursive algorithm to search string
遍历二叉树的4个非递归算法
- 二叉树的4个非递归算法,中序先序后序和层次遍历,算法都有注释而且很详细,适合数据结构学习者使用-binary tree four non - recursive algorithm, the first sequence after sequence and the sequence level traversal algorithm Notes but have very detailed data structure suitable for use Learners
DFS※Prim
- 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
非递归遍历一
- 本文用Ｃ语言实现了双链表结构树的前中后序非递归遍历-Using C language of the Double Chain structure tree before, during and after non - recursive traversal sequence
汉诺塔的演示程序
- 初学MFC时的拙作，一个汉诺塔的演示程序，采用非递归、非堆栈的算法，直接根据当前步数推算出汉诺塔的状态。界面用GDI实现，伪3D的风格。-beginners at the exposition, a HANOR the demo program, the use of non - recursive and non-stack algorithm, directly under the current steps are projected HANOR state. GDI interface
BTREE2006
- 一个非递归建立二差树的算法!输入先序带结束符号的序列建立二叉树!原创-establish two poor tree algorithm! First imported symbols sequence ended with the establishment of the sequence binary tree! Originality
PostOrderTraverse
- 后序遍历非递归二叉树源代码 很简洁，很简洁，很简洁-non - recursive binary tree source code is very simple, very simple, very simple
erchashubianlisuanfa
- 遍历二叉树的非递归算法，其中有先序遍历，中序遍历和后序遍历。-traversal of a binary tree non - recursive algorithm, which preorder, preorder and after preorder.
非递归前序,中序,后序遍历二叉树(优化算法)
- 非递归前序,中序,后序遍历二叉树(优化算法)-before non - recursive sequence, sequence after sequence binary tree traversal (optimization algorithm)
迷宫问题的非递归算法(栈实现
- 迷宫问题的非递归算法-maze of non - recursive algorithm
中序遍历的非递归算法
- 二叉树中序遍历的非递归算法-Binary preorder non - recursive algorithm
HANOI非递归算法(带动画演示)
- HANOI非递归算法(带动画演示)-HANOI non - recursive algorithm (with the animation demo)
先序非递归遍历
- 用非递归的方法先序遍历二叉树-non - recursive method preorder Binary Tree
非递归
- 数据结构 迷宫问题 迷宫非递归算法.rar-data structures, maze problem, non-recursive algorithm for maze problem
quicksort
- 用非递归实现快速排序 主要思想： 利用栈来消除递归-Non-recursive quicksort implementation the main idea: to eliminate the use of recursive stack
CFileFindExt
- CFileFind的扩展类CFileFindExt。加强了CFileFind类的功能，直接做成类CFileFind的继承类，非递归化时（为加快搜索速度，减少开销）将先深遍历改为层次遍历，用户根据需要可增加返回所有子目录名函数以及其它多参数处理函数。-CFileFind the expansion of category CFileFindExt. Strengthened CFileFind functions directly into the category of succession C
abcd
- 这个非递归预测分析器可以自动分析一段代码，并且保存到文件里面！-The non-recursive prediction section of the analyzer can automatically analyze the code, and saved to a file inside!
算法设计
- 问题描述：以一个m×n的长方形表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。 基本要求：首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组（i,j,d）的形式输出，其中：（i,j）指示迷宫中的一个坐标，d表示走到下一坐标的方向。(Problem Descr iption: a m * n rectangle represents the maze, and 0 and 1 i
1160300803_樊静_实验二
- 森林和树的基本操作 ，森林的存储，森林转化成二叉树，二叉树的先序中序后序非递归遍历，以及区间编码(The basic operations of forests and trees, the storage of forests, the conversion of forests into two forked trees, the preorder and the post order of the two forked trees, and the interval encoding,
Recursive Program
- 递归程序分析方法初探，C++实现尾递归，递归，和非递归实现斐波拉契数列(A First Study of the Analysing Methods of Recursive Program)