资源列表
Queens
- 皇后问题:计算各种情况下的棋盘上皇后的摆放位置-Queen s problems: calculation of a variety of situations on the board the location of Queen s
nQueen
- n皇后问题:计算各种情况下的棋盘上皇后的摆放位置-n Queen s problems: the calculation of a variety of situations on board the location of Queen s
fenzhi
- 通过分支限界的方法，求解1到n的最短路径。设数组a保存图的邻接矩阵，0-9号，共10个节点。节点1为源点，n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target
Dijkstra
- Dijkstra算法源码，图论中求解最短路径-Dijkstra algorithm source, graph theory for solving the shortest path
Scheme-r5rs
- 算法语言Scheme的详细语法和分析论述报告，适合作为参考-ALGOL Scheme detailed analysis of grammar and discussed the report, suitable as a reference
Prim
- Prim算法，包括详细的容错机制，且可对非连通情况做处理。-Prim algorithm, including detailed fault-tolerant mechanism, and can be done to deal with the situation of non-connectivity.
shujujiegouxitijieda
- 数据结构习题解答全套系列，答案详细，值得一下-A full set of data structures to answer series of exercises, the answer in detail, it is worth about
Cpp1
- 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
paixu
- 数据结构中几种排序方法的比较包括冒泡算法 希尔算法等 并完整的给出了报告-Data structure of several methods, including sorting algorithm bubble Hill algorithm and given a complete report
Huffman
- 哈夫曼方面的编程实例，可以充分了解哈夫曼树的功能，以及对其结构的充分把握！-Huffman aspects of programming examples, can not fully understand the function of Huffman tree, as well as take full advantage of its structure!
ecs
- 这是一个关于数据结构实验二叉树的实验代码非常好大家可以利用-This is an experiment on the binary tree data structure of the experimental code very good we can make use of
ex3
- 算法分析中的辛甫生公式和梯形公式，首先， 找到表达式中的共同点----一个函数。编写该函数。然后，分别编写两公式的表达式。-Algorithm analysis辛甫Health formula and trapezoid formula, first of all, to find expression in common---- a function. The preparation of the function. Then, the two were prepared formula ex