资源列表
TopologicalSort
- 采用递归调用的方法打印输出一个非循环图的所有拓扑排序-output all the topological sorts of an acyclic graph
BSTree
- 从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法，即新插入的节点均为改二叉树的叶子节点，且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as bin
Tree
- 主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree g
nQueen
- 一个关于N皇后问题的小程序，输出结果为一个n行n列的矩阵-nQueenProblem
Sim
- 单纯形法，可以用于进行线性规划解的求取。在数学上有一定的应用价值，但速度上可能不太优化，如果对速度有要求的，可参考MATLAB-Simplex method, linear programming solution can be used to carry out the strike. In mathematics there is a certain value, but the speed may not be optimized for speed if required, can re
Huffman
- 霍夫曼编码，根据给定权值创建赫夫曼编码，显示每一步如何进行及所得编码-Huffman coding, according to the weight given to create Huffman codes, showing how each step and the resultant code
migong
- 随机生成一个有外墙的迷宫，找出迷宫通路并在迷宫图中显示出，给出具体路径-Randomly generated with the external walls of a maze of pathways in the maze of the maze to find the figure shows that given a specific path
shujujiegou
- 有关计算机基础中数据结构的详细的PPT。内容详细。-About computer-based data structure detailed in the PPT. Content in detail.
fangcheng
- 解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-Solution of N-linear equation, reading from a file into an integer N, and then read into the N* (N+1) matrix obtained solution and the output to a file.
Trie
- trie树的一个实现 trie树是在字符串匹配中常用的一种高效数据结构-trie tree trie tree is a realization of the string matching used in an efficient data structure
dijkstra_z
- 单源dijkstra邻接阵形式 单源最短路径,dijkstra算法,邻接阵形式,复杂度O(n^2)-Dijkstra adjacency matrix form of single-source single-source shortest path, dijkstra algorithm, adjacency matrix form, the complexity of O (n ^ 2)
dijkstra_b
- 单源最短路径,用于路权相等的情况,dijkstra优化为bfs,邻接表形式,复杂度O(m)-Single-source shortest path for the right of way case of a tie, dijkstra optimization bfs, adjacency list form, complexity of O (m)