资源列表
AVL-tree
- AVL树的左旋、右旋和左右选，便于将一棵树转化成平衡二叉树-AVL tree of L, D and about the election, facilitate a balanced binary tree is converted to
bracelet-matching
- 关于算式中小括号、中括号和花括号的匹配检查算法-Match checking algorithm on small formula parentheses, brackets and braces
Basic-function-of-stack
- 包括了栈的进栈、出栈、查找栈顶元素等基本操作-Including the stack into the stack, the stack, look for the top element and other basic operations
Basic-function-of-graph
- 图的基本操作，包括建立邻接矩阵，图的广度和深度优先搜索-The basic operation pattern, including the establishment of the adjacency matrix, the breadth and depth map of priority search
List
- 关于链式表的操作，包括插入删除，统计个数等-Operation of chain table, including insertion and deletion, and other statistical number
Gale-Shapley
- 稳定匹配问题是算法理论中的典型问题之一,稳定婚姻匹配问题则是一种解决二部图匹配问题的模型。对稳定婚姻匹配问题进行了简单的阐述,并介绍了求解典型稳定婚姻问题的Gale-Shapley算法-Stable marriage matching problem is a model to solve the problem of the two graph matching. The problem of stable marriage matching is described briefly, and
Erchashushiyan
- visual studio编程，数据结构中的二叉树实验，测试新建5个节点，以及新节点的插入，之后完成遍历。-insert visual studio programming, data structures binary experiments, test new five nodes, and the new node, then complete traversal.
juzhenlianxiangcheng
- 此代码为实现矩阵链相乘算法的c++代码，希望能给大家带来帮助。-This code for the realization of the matrix chain multiplication algorithm c++ code, hoping to bring help.
gouzaojuzhen
- 这个源代码是为了实现矩阵链相乘算法的构造矩阵的完整代码。-This source code is in order to realize the structure of the matrix chain multiplication algorithm of matrix complete code.
shucukuohaofangshi
- 这个源代码是实现矩阵链相乘算法的一段代码，可以正确输出加括号的方式。-This source code is to achieve a piece of code matrix chain multiplication algorithm, can correct output bracketing mode.
huisu
- 这个源代码是为了解决旅行商问题算法的一段代码，是用回溯法解决的。-This source code is a piece of code in order to solve the traveling salesman problem algorithm, is overcome with backtracking method.
Cpp1
- 这段代码是实现寻找最大最小数算法的一段代码，可正确输出一组数据的最大最小数。-This code is to realize the algorithm for maximum minimum number of a piece of code, which can output the maximum number of minimum a set of data.