搜索资源列表
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
erchashubianli
- 数据结构中二叉树遍历算法，用C++写的，我们的作业，老师验收通过。-Binary tree data structure traversal algorithm, using C++ Written, our operations, acceptance, through the teacher.
TEST
- 数据结构试验 实验一 线性表的顺序表示与实现 实验二 线性表的链式表示与实现 实验三 栈与队列及其应用 实验四 二叉树的应用 实验五 图的遍历与应用 实验六 查找技术 实验七 内部排序 全部源码-Experimental test data structure form a linear sequence of that experiment and realization of the Second linear chain form and realizati
hfm
- 【数据结构】二叉树遍历及赫夫曼编码表完整版-[] Binary tree data structure traversal and Huffman coding table full version
DirectoryTree
- 利用Visual c++实现自动遍历文件夹生成成目录树-The use of Visual c++ Traverse Folder automatically generated into a directory tree
file
- 该源码是遍历文件夹并生成树状目录的源码,-The source folder are ergodic and generate the source tree,
BinaryTree
- 这是用C语言实现的二叉树的遍历算法，包括递归和非递归算法的实现。-This is to use C language implementation of the binary tree traversal algorithms, including recursive and non-recursive algorithm implementation.
datastruct_example
- 本人讲授数据结构课程时的所写的示例程序，结构清晰规范，有注释，全部可编译运行，包括如下代码： 长整数：ch0_bigint2.c 顺序表的实现：ch2_stable.c 链表的实现ch2_ltable.c 合并两个有序表：ch2_stable_merge.c 表达式计算：ch3_express.c 队列的链式实现：ch3_lqueue.c 栈的链式实现：ch3_lstack.c 迷宫求解：ch3_maze.c 队列的顺序实现：ch3_squeue.c
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
FolderInfo
- 文件删减器 可以对计算机进行遍历、对文件进行删除管理-File deletion can traverse on the computer, delete the file management
Treetraversalfolderrecursivealgorithm
- MFC实现，树型递归算法遍历文件夹。列出文件的大小，类型等属性-MFC implementation, recursive algorithm for tree traversal folder. Documents listed in the size, type and other property
breadth_first_search
- 通过广度优先算法，遍历网络中的每个结点，得到遍历结点的时间-Through breadth-first algorithm, network traversal each node, the node traversal time
depth_first_search
- 通过深度优先算法，遍历网络中的每个结点，得到遍历网络节点的时间-Through the depth-first algorithm, network traversal each node, the network node traversal time
filefind
- delphi 的文件查找和遍历，基本文件操作-delphi find and traverse the document, the basic file operations
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
LAB_4
- 树的遍历，采用非递归的方法对树进行中序遍历-Tree traversal, the use of non-recursive methods of tree traversal
shuju6
- 熟悉二叉树的各种存储结构的特点及适用范围；掌握建立二叉树的存储结构的方法；熟练掌握二叉树的前序、中序、后序遍历的递归及非递归算法；灵活运用递归的遍历算法实现二叉树的其它各种运算-Familiar with the binary tree structure of a variety of storage features and the scope of application acquire storage to establish the structure of binary tree
FsoExcam
- 遍历文件夹及目录，读取文件夹、文件夹里的文件、列出本地磁盘，包括USB移动设备等，完全是基于FSO的一个文件操作示例程序，比较简单，容易看懂。-Traverse Folder and directory, read file folder, folders, documents, lists of local disk, including mobile devices such as USB, is a file-based operation of the FSO sample proced
Broad-First-Search(AdjLGraph)
- 此代码为“图的广度优先遍历”的源代码，图的存储形式为邻接表，里面有图的邻接表存储的代码，还有广度优先遍历的算法，还有验证的主函数。-This code is " breadth-first traversal map" of the source code, Figure storage form of adjacency list, there are plans stored in the adjacent table code, as well as breadth-fi
matlab_bgl-2.1
- 图论必用，有关图论的求最短路径，遍历等的各种函数。-Graph theory will be used, the graph theory for the shortest path, traverse a variety of functions, etc..