资源列表
EdmondsKarp
- 使用EdmondsKarp算法，求网络的最大流-EdmondsKarp maximum flow algorithm
njdqy
- 由java实现的分子量分解算法,可对一个给定的整数-By the molecular weight of the Java implementation decomposition algorithm, it can be for a given integer
data-construction
- 数据结构 浙江大学 陈越 何钦铭的代码集-Data structure Zhejiang University Chen Yue Ho Ming Chin code set
temp
- c8051f340单片机用10K热敏电阻检测温度，并在终端显示-C8051f340 single-chip 10K thermistor with the detection temperature, and the terminal display
CPPds
- C++列，顺序表，散列表，图，树，等常见的数据结构，可以下载去用。-C++ columns, sequential tables, hash tables, graphs, trees, and other common data structures that can be downloaded and used.
Multiplication-of-the-matrix
- Multiplication of Matrix
Diagonal-Matrix
- Make a diagonal matrix
Circle-Area-a-Circumference
- Calculate circle area and Circumference-Calculate circle area and Circumference
cpp
- 严蔚敏数据与结构第三章学生习题，关于堆栈和队列-Yan Wei-min data structure and the third chapter student exercises on stacks and queues
KMP
- KMP优化后算法，传统字符串检索复杂度大高，KMP算法虽然大大缩短时间仍存在缺陷，在于其NEXT数组，优化后解决了此问题-KMP algorithm optimized, big high complexity of traditional string retri , although KMP algorithm greatly reduces the time there are still defects, after its NEXT array, optimized to solve
superqueue
- 优先队列，区别于传统队列队首出队，而是按照优先级出队，比如键值的大小-Priority queue, the queue is different traditional first team out of the team, but in accordance with the priority of the team, such as the size of the keys
Bittree
- 二叉树遍历，包括了二叉树的建立，二叉树的层序遍历，先序遍历（递归非递归），中序遍历（递归非递归），后序遍历（递归非递归）-Traversing the binary tree, a binary tree comprising, the binary tree traversal sequence, first traversal (recursive non-recursive), inorder traversal (recursive non-recursive), postorder t