搜索资源列表
jianshanfei
- 该程序实现图的建立与先深和先广遍历，图采用矩阵存储，在遍历过程中用栈实现，但若改用队列，将会实现得更自然流畅-the program plans to establish the first and the first deep-Traversal, map storage matrix, Traversing in the process of making Stack, but switch queue, there will be more natural and fluid
sweepline
- 著名的Voronoi Diagram结构fortun算法经典C描述，各位搞算法的仁兄可千万别错过，要看懂该算法，需要搞清楚Voronoi Diagram结构，还有非常深厚的C语言功底。-famous structure fortun Voronoi Diagram C classical algorithm descr iption, to engage algorithm should not miss the chance to be dear friends, to understand
LCA_LRJ
- 最近写的一个最近公共祖先问题的代码，原理很简单基于递归深搜，具体请见LRJ书-recently wrote of a recent public ancestors of the code, the principle is very simple search based on recursive deep, See LRJ specific book
ParkingLotSimulation
- Parking Lot Simulation： Parking lot attendants often park cars bumper-to-bumper, several cars deep. This maximizes the number of cars they can fit into a parking lot at the expense of complicating the process of retrieving someone s car when they w
GraphTrace.rar
- 用标准C++完成对图的深/广度优先搜索,使用邻接多重表的存储结构,Using standard C++ Completion of the map deep/breadth-first search, the use of the adjacent multi-table storage structure
src
- PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, colle
find_all_loops
- 找出有向图中所有简单回路，深搜DFS+标记-Directed graph to find all the simple loop, deep search DFS+ Tags
deepLook
- 深度遍历一个二叉树，以读取结点的有关信息-read the data the connection of the two tree in a deep looking way
deep_foundations
- this is a zip file contain a program for design of deep foundation with excel.
Depth-First-Traverse
- 此代码为“图的深度优先遍历”的源代码，图的存储形式为邻接矩阵，里面有图的邻接矩阵存储的代码，有深度优先遍历的算法，还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traver
DFS-BFS
- BEST FIRST SEARCH AND DEEP FIRST SEARCH
tree
- 给定一组值，建立一棵二叉树，求二叉数的树深。-Given a set of values, the establishment of a binary tree, and the number of binary trees deep.
poj2488
- 回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题-Backtracking template, the key is back process, as well as in the course of the deep question of the direction search
DeepConstraintBinaryTree
- Deep Constraint Binary Tree 是一种新的二叉平衡树。改源码同时包含了传统的AVL二叉平衡树的实现-Deep Constraint Binary Tree is a new binary balanced tree. To change source code also includes the traditional AVL balanced binary tree implementation of
Qlink3
- 很牛逼的链表结果和操作。只有对数据结构理解很深的人才能写出来的优秀代码-The list is very牛逼results and operations. Only a deep understanding of data structures out of people who can write good code
Adjacencylist
- 邻接表表示的深优.zip 邻接表表示的广优.zip-Adjacency table that the deep superior. Zip adjacency list that wide priority. Zip
tu
- 图的操作 1.邻接法创建图 2.输出建立的图 3.求各顶点的度 4.深度遍历图 5.广度遍历图 6.退出程序-Figure 1 operation. Neighbor joining to create Figure 2. Output created Figure 3. Seek the vertices of degree 4. Deep traversal Figure 5. Breadth traversal Figure 6. Exit
Application_of_binary_tree_traversal_algorithm
- 二叉树遍历算法的应用 作者：李锐歆 建立二叉树 统计叶子结点个数 求二叉树的树深-Application of binary tree traversal algorithm: Li Ruixin Statistics leaf nodes to establish the number of binary tree binary tree seeking deep
Figure-deep-traversal
- 图的深度遍历，数据结构的一个小程序。有助于初学者学习与实践-Deep traversal of the graph, the data structure of a small program. Help beginners to learn and practice
deep-copy
- 该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。-A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.