资源列表
queen
- 在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互“攻击”的现象，即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。-In an 8 × 8 chess set, there' s eight, each accounting for one' s cell request will not be mutual between Queen' s " attack" phenomenon, that shoul
bianli
- 遍历二叉树 是指以一定的次序访问二叉树中的每个结点，并且每个结点仅被访问一次见图-Binary tree traversal refers to a certain tree in order to visit each node and each node has been visited only once see Figure
suanfa
- 算法实现单元点最短路径问题，算法实现单元点最短路径问题-Algorithm unit point shortest path problem algorithm unit point shortest path problem
queue
- 提供队列数据结构的相关操作，用C语言实现，效率较高！-Queue data structure to provide the relevant operation, using C language, and more efficient!
Disucz
- disucz数据结构，详细介绍disucz的数据结构，是学习disucz的必备电子书-disucz data structure, a detailed introduction disucz data structure is an essential study disucz eBook
binarytree
- 实现二叉树的各种操作,包括建立,遍历,查找等具体的内容-Bintree realize the various operations, including the establishment, traverse, search, such as specific content
qsort
- 快速排序算法，支持自定义快速排序算法和c++库排序算法。-Quick Sort algorithm, support for custom quick sort algorithm and c++ library sorting algorithm.
dongtaiGH
- 该算法主要是为了在图中找到强连通分支，请看源码注释。-The algorithm is mainly for the map to find strongly connected branch, see the source notes.
binary_tree
- 二叉树三种遍历的非递归算法 给出二叉树先序、中序、后序三种遍历的非递归算法，此三个算法可视为标准算法，直接用于考研答题。-Binary Tree Traversal three non-recursive algorithm
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.
tanxin
- 在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的仅是在某种意义上的局部最优解。-In problem solving always made in the current appears to be the best option. In other words, do not be optimal from an overall consideration, made by him are in a sense only the local opti
RLS_LMS_beamforming
- 基于MMSE的波束形成器，采用RLS和LMS两种算法。-Based on MMSE，RLS and LMS algerithm is adopted !