资源列表
Deque
- 一个完善的数据结构中队列的实现，包括队列的各个基本功能，应用-A perfect realization of the queue data structure, including all the basic functions of the queue, the application
DataPStructuresPandPAlgorithmPAnalysisPinPCP-PMar
- Data Structure Algorithm
用CS结构求解矩阵乘法问题
- 用C/S结构求解矩阵乘法问题。假定有多台电脑互联网中并使用TCP/IP进行通信。我们要使用一个客户和几个服务器求解N×N的矩阵乘法问题。客户通过srvcfg.txt文件所获取所有的服务器程序必要的信息，如服务器的个数，IP地址或主机名。例如，一个“srvcfg.txt”文件的内容为： 3 149.150.167.123 149.150.162.182 149.150.169.250 表示有3个服务器及相应的IP地址。 然后，建立于所有服务的Socket连接和I/O流。客户从c
bagsolutions
- 多种不同背包问题的解释和解答思路，适合初学者理解实现-Many different explanations and answers knapsack problem ideas for beginners to understand
light
- Ural 1464 Light 解法：计算几何+线段树-Ural 1464 Light Solution: Computational Geometry with segment tree
mimo
- 能够展示不同调制格式的用与不用mimo技术误码率的曲线图-Able to show different modulation formats mimo technology with and without a graph of bit error rate
StoneMerge
- 石子合并问题的简单解决方法，代码简单，和大家一起学习-Stones combined simple solution to the problem, the code is simple, and we will study together
Warshall
- 离散数学中warshall算法的简单实现，可以帮助理解该算法-Discrete Mathematics warshall simple implementation of the algorithm, the algorithm can help to understand
bagsolution
- C#实现的01背包问题，里面使用了接口，适合初学者使用-C# implementation of the 01 knapsack problem, which uses the interface, suitable for beginners to use
MatrixMultiply
- 使用C#实现的矩阵连乘程序，里面有接口的相关使用，可以参考-Use C# to achieve matrixcontinuallymultiply program, which has interfaces related to use, you can refer
rebuildTree
- 使用前序和中序构建二叉树，之后根绝二叉树的结构打印出其后续的遍历结果-Using pre-order and in order to build a binary tree, and then eradicate the binary tree structure to print out the results of its subsequent traversal
BST_Arithemic
- 自己在学习数据结构过程中，优化总结的数据结构经典查找算法-二叉排序树操作算法源码，附带详细注释行-Own data structure in the learning process, summarize data structure classical optimization search algorithm- binary sort tree operation algorithm source code, with detailed comment line