资源列表
1
- 1. 建立二叉树方法1 2. 建立二叉树方法2\" 3. 中序递归遍历二叉树 4. 计算树中结点个数 5. 结束程序运行\")
NumIdenti
- 用BP神经网络实现对十六进制数字的识别。-Using BP neural network to achieve the identification of hexadecimal digits.
beibei
- 机器人沿边运动，机器人可以在一个有阻碍的空间沿着边沿*。-Robot border movement, a robot can have impeded the space along the edge of the Freedom Movement.
binary-tree
- c语言描述的数据结构，二叉树的数据结构的抽象数据类型-c language to describe the data structure, binary tree data structure of the abstract data types
huffman_coding
- 本程序建立了哈夫曼树并求出了各字符哈夫曼编码，但不能对需要编码的文件进行分析，作出最优或 近似最优的决策 建树的时间复杂度:O(nlogn) 求解编码的平均时间复杂度:O(n*d) d为哈夫曼树叶子的深度的期望，最坏情况的d=(n^2+n-2)/2n. 编码的最坏时间复杂度为O(n^2)-This procedure established a Huffman tree and calculated the various characters in Huffman c
fastdown-and-jacobi
- 最速下降法和雅可比法经典迭代matlab程序-Steepest descent method and Jacobi method classic iteration matlab program
Nqueen-(2)
- 三百万皇后在一分钟内生成并算出最优解。随机爬山算法。速记生成初始状态。-Three million Queen generate and calculate the optimal solution in a minute. Random hiking algorithm. The shorthand generated initial state.
Gauss-elimination-method
- 基于高斯消去法的基本原理，实现对于一个方程组的高斯消去求解，并检验其稳定性。-Gaussian elimination method based on the basic principles to achieve the Gaussian elimination for solving a system of equations, and test its stability.
R_K_Waspalloy
- Creep abaqus subroutine for Robotov Kachanov, using WASPALOY
prim
- 最小生成树prim算法实现 实现数据结构中的最小生成树算法prim，获得一棵最小生成树-Prim minimum spanning tree algorithm data structure to achieve the minimum spanning tree algorithm prim, obtain a minimum spanning tree
C_A-topological-sort
- 用C写的，输入一张图的顶点和入度，得出顶点的拓扑排序-Written in C, the degree of input into the vertex and a graph, draw the vertices of topological sorting
Adaptive-Huffman
- 自适应哈夫曼编解码源代码。 生成的可执行文件可以对txt文件进行压缩和解压缩。-Adaptive Huffman coding source code. The generated executable file can compress and decompress the txt file.