搜索资源列表
TREE
- 树的基本操作实现。内容包括先序、中序、后序、层次遍历，树的深度等。-Tree to achieve the basic operation. Including first order, in sequence, after the order, the level of ergodicity, the depth of the tree.
C++BuilderDepthAdventure
- C++ Builder深度历险 台湾人写的-C++ Builder depth Adventures of Taiwan, written by
tu_bianli
- 利用C语言实现数据结构中的图的建立,根据边的数目建立图,并用深度遍历法遍历图等-The use of C language data structure diagram of the establishment, in accordance with the number of edge-building plans, and the depth of traversal method traverse map
yuio
- * 函数功能: 深度优先遍历邻接链表表示的图 * 输入参数: Graph_A G 邻接链表表示的图 -* Function: depth-first traversal of the graph adjacency list that* input parameters: Graph_A G said adjacency list of graph
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
tu
- 图的深度优先遍历包括图的建立，分有向图和无向图-Graph depth-first traversal, including the establishment of plans, sub-directed graph and undirected graph
Fullarc_mill2
- 目的: 全圆铣削过程(有刀径补正 进退刀圆弧等径 中心下刀) 输入： NC文件号incfileNum 输入： 备注strNote, 安全高度Millinitial_z, 铣深milldepth, Z进给高度millFdepth , 啄铣深度millzstpdepth,圆直径strDiamill, 圆心点集strCptsxy，刀号Tcur，刀径Diacur，转速Scur， 进给Fcur，刀长补正H，半径补正Dcur，铣削方向blnFangxXiang，[下一刀号]Tnxt
graph1
- 图的运算，有全图的无权图的广度深度优先遍历-Figure computing, there is no right to map the entire map of the breadth of depth-first traversal
graph
- c++实现的有向图的临界矩阵构造，深度广度的遍历。-c++ achieved critical digraph matrix structure, depth, breadth Ergodic.
binarytree
- 二叉树的递归（先序，中序，后序）遍历，创建叶子结点数，二叉树深度-Recursive binary tree (first order, in sequence, after the order) traversal, create leaf nodes, tree depth
graph
- 图的遍历 能实现深度 广度遍历 还有文挡-Graph traversal to realize the depth of breadth traversal also text block
C++Distilled
- c++精粹，一本很好的C++书，很详细，而且有一定的深度，是学习C++的必不可少的好资料-c++ essence of a good C++ book, in great detail, but also have a certain depth, is to learn from C++ indispensable good information
Graph
- 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
712
- 编写一个算法程序实现： 1、 用邻接表存储下图： 2、完成对以上图的深度优先搜索，设出发顶点是V1。 -Procedures for the preparation of an algorithm to achieve: 1, with adjacent storage under the map table: 2, completion of the above graph depth-first search, set the start
aa
- 九宫问题的深度和广度优先算法-Nine-palace the issue of the depth and breadth of the priority algorithm
H263BianMa
- 关于网络视频会议的VC附书源码~~~~~~ 很好的东西，够深度-Video conferencing on the network attached to the book source VC ~~~~~~ good things, enough depth
trojan_analysis
- 疱丁解马-木马查杀深度剖析,帮助深受木马毒害的朋友们了解木马是什么，又如何查杀-Cronartium Ding Xie Ma- Trojan killing depth analysis to help the Trojans poisoned by friends who understand what is the Trojan horse, how killing
C_TREE
- 本例题将介绍一种建立二叉树的算法。同时介绍对“遍历算法”灵活应用：将二叉树中每个结点的左右子树进行交换。介绍求二叉树深度的算法。 二叉树的建立是一个递归方法，与二叉树先序遍历思路有点相似。数据的组织是先序遍历的顺序，但是当某结点的某孩子为空时以数据0来充当，也要输入。结合右图的二叉树，其数据的输入顺序应该是： 1 2 4 0 0 0 3 5 0 7 0 0 6 8 0 0 9 0 0。 若当前数据不为0，则申请一个结点存入当前数据。如果输入0表明是空（NULL），不分配结点。递归调用
DELPHIjishuCHM
- 高手整理的比较全面又有深度的DELPHI技术文档，里面有许多实际应用的代码，可以让大家深入掌握编程技术。-Finishing a master more comprehensive depth and breadth DELPHI technical documentation, which has many practical applications of the code , so that everyone can grasp of programming.
qiangLT
- 在强连通分支算法中，选择任何顶点做起始点来执行深度优先搜索遍历，得到的强连通分支的解相同。-In the strongly connected branching algorithm, choose any vertex make a starting point to implement the depth-first search traversal obtained strongly connected branch of the same solution.