资源列表
paixuBC
- 数据结构中的建立排序二叉树算法,很经典,非常容易看懂,适合初学者.-data structure of the establishment of a binary tree sorting algorithm, very classic, very easy to understand, for beginners.
QUANTIZATION
- 基于MATLAB实现图像线性量化的源码，通过输入量化参数实现不同等级量化-Based on MATLAB to achieve linear quantitative image source, by entering the quantization parameters to achieve different levels of quantization
fc
- 用matlab开发的一个简单的预测双色球源码-Using matlab to develop a simple prediction Loans Source
binarytree
- 可以进行建立二叉树，递归先序、中序、后序遍历，非递归中序遍历等操作-build binary tree
newt
- 实现拓扑排序，用到了堆栈，存储结构采用邻接表。-To achieve topological sorting, use the stack, storage structure using adjacency list.
Matrics
- 算法实验之矩阵相乘，对比普通算法和strassen算法的运行时间差异-just as it s sald above!
add
- 实现两个多项式的相加，用线性表实现，亦即用链表实现-Realize the sum of two polynomials, linear table implementation, which is achieved with the list
adjacency-table-to-stor
- 用c语言来实现邻接表存储有向图，计算顶点的出度和入度-C language to implement a directed graph adjacency table to store, calculate the out-degree and vertex-degree
xianxingguihua
- 基于hopfield神经网络解决线性约束优化问题，效果不错，运算精度高 -Based on the hopfield neural network to solve linear constrained optimization problem, the effect is good, operation precision is high
Rainflow
- Rainflow counting algorithm
Dinic java algorithm
- Dinic java algorithm max flow
sgu261
- sgu261：Discrete Roots(原根+离散对数+扩展欧几里得) 题目大意： 给你两个质数p,k，和整数a(0≤a<p)，求解所有满足x^k≡a(mod p)的x。-261. Discrete Roots time limit per test: 1 sec. memory limit per test: 65536 KB input: standard output: standard There are a lot of