搜索资源列表
dfs
- 数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non- recursive. Prepared with vc6.0
hannuota
- 汉诺塔非递归程序，包含详细的解析、代码、结果及心得-Tower of Hanoi non-recursive procedures, contains a detailed analysis, code, results and experiences
HANOI
- 很多朋友都久等了,这是我做了很久的程序!一个非递归的汗诺塔代码,很好的!-Many of my friends are waiting, this is my procedure to do for a long time! A non-recursive Khan, Tower of code, very good!
HANOI_I
- 著名的世界末日问题-河内之塔(Towers of Hanoi) 的递归算法很容易实现,但效率不过,但非递归算法会写的人却很少,这个非递归算法不但高效,并且简短-The end of the world well-known problem- Hanoi Tower (Towers of Hanoi) of the recursive algorithm is very easy to realize, but efficiency, h
games
- 数据结构算法中一些经典的小游戏的算法，如魔法矩阵，八皇后问题，骑士游历问题，环游世界问题，一笔画问题，非递归的汉诺塔问题等-Data structure algorithm some classic game of algorithms, such as magic matrix, 8 Queen s problem, the issue of Cavalier traveled, round-the-world problem, th
sixsortmethods
- 数据结构中的排序方法，包括：希尔排序，非递归的快速排序，递归的快速排序，堆排序，归并排序，基数排序-Sort of data structure, including: Hill sorted, non-recursive quicksort, recursive Quick Sort, Heap Sort, Merge Sort, Radix Sort
sudoku
- 用C++编写的数独游戏，采用回溯法，非递归，计算超快，代码精炼，注解详细-Using C++ Game Sudoku prepared using retrospective law, non-recursive calculation of ultrafast, code refining, detailed comments
quicksort
- 用非递归实现快速排序 主要思想： 利用栈来消除递归-Non-recursive quicksort implementation the main idea: to eliminate the use of recursive stack
Hanoi
- 利用栈编的汉诺塔程序，c语言实现，有两个，一个有图形界面。记住是用栈的原理编的哦，汉诺塔程序常有，而用栈原理编的不常有！对于栈的理解很有帮助！-Stack for use of the Tower of Hanoi program, c language, there is both, a graphical interface. Keep in mind the principle of stack are used for the
NON
- 实现二叉树三种遍历（先序遍历、中序遍历、后序遍历）的非递归算法。-The realization of the three binary tree traversal(PreOrderTraverse,In OrderTraverse,PostOrderTraversal)of the non-recursive algorithm.
pudn
- 将马随即放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,……,64依次填入一个8×8的方阵，输出之。 测试数据：由读者指定。可自行指定一个马的初始位置(i,j),0<=i,j<=7。 -Ma was on the chess board 8 × 8 of the Bo
MY_DFS
- DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. The
Tree-Non-recursive-traversal
- 二叉树的中序与先序的非递归遍历算法的实现 用VS2010编写的-Binary tree in order and first order non-recursive traversal algorithm implementations written using VS2010
Non-recursive-traversal
- 二叉树的非递归遍历完整源代码，对初学数据结构的人非常有用-Non-recursive binary tree traversal complete source code, useful for beginner data structure
Tower-of-Hanoi-non-recursive
- 非递归汉诺塔算法，并带有一片武汉大学的算法描述。-Non-recursive Tower of Hanoi algorithm, and the algorithm is described with a Wuhan University.
Non-recursive-
- 无向图的先序和中序后序的递归和非递归算法-Non-recursive algorithm recursive undirected graph
Non-recursive-algorithm-binary
- 二叉树先序、中序、后序三种遍历的非递归算法-Non-recursive algorithm binary first order, in sequence, after three traversal
non-recursive-of-binary-tree
- 二叉树的非递归遍历，运用栈的思想实现二叉树非递归遍历-Non-recursive binary tree traversal, using stacks of thinking non-recursive binary tree traversal
First-root-traversal-non-recursive
- 二叉树的非递归先根遍历遍历 二叉树的非递归先根遍历 -Two fork tree of non recursive traversal traversal Two fork tree of non recursive traversal traversal
Non-recursive-traversal-of-a-tree
- 树的非递归遍历中序，C++ 数据结构，非常适合初学者-Non recursive traversal of the tree in the order, C++ data structure, very suitable for beginners