资源列表
poj2031
- 【poj】【2031】最小生成树堆优化~Accepted 760 KB 32 ms C++ 1720 B -Minimum spanning tree heap optimization poj2031
2011210133tree
- 二叉树的所有操作 大二数据结构专用 北邮的-All operations of the binary tree sophomore data structures dedicated
shu
- 二叉树的遍历,先序,中序,后序,层序遍历-Binary tree traversal, preorder, inorder, postorder sequence traversal
Buck-Boost-Converter--
- 此文档为无刷直流电机控制前期学习文档，很详细地介绍了控制及其方法-This document is a brushless DC motor control early learning document, a very detailed descr iption of the control and its methods
Data-compacting
- 这是几篇关于数据精简的比较好的文献，主要包括八叉树和K邻近法等精简算法-This is a few article about data compacting better literature, mainly including octree and K adjacent method simplified algorithm
Projects
- Tree，STACK，Queue，Heap及CIR_LK_LIST等数据结构的实现与实例。-Realization of the Tree, STACK, Queue, Heap and CIR_LK_LIST data structure instance.
01tanxin
- 0-1背包问题的贪心算法，算法分析与设计-0-1 knapsack problem of the greedy algorithm, algorithm analysis and design
tu
- 数据结构,哈工大数据结构第三次实验,图求最小单元路径。-Data structure HIT data structure of the third experiment, Figure Find the smallest unit path .
01dongtaiguihua
- 0-1背包问题的动态规划算法，算法分析与设计-0-1 knapsack problem dynamic programming algorithm, algorithm analysis and design
checkcharscorrect
- 2、 设计算法判断一个算术表达式的圆括号是否正确配对。 第一个式子： 1*(2+3*(4*(2-1)*(3+x)+5)-6) 能够正确匹配 第二个式子： 1*(2+3*4*(2-1)*(3+x)+5)-6) 不能够正确匹配 -Design algorithm to determine an arithmetic expression in parentheses is correct pairing. The first equation: 1* (2+3* (4* (2-1)*
xml
- 将输入的xml代码格式化输出。比如<html></html> 输出 <html> </html>-The input xml code formatting output. For example <html> </ html> Output <html> </ html>
PT-01---Packet-Tracer-Activity-(.pka)-Files---Acc
- Convenience class to deal with audio focus. This class deals with everything related to audio * focus: it can request and abandon focus, and will intercept focus change events and deliver * them to a MusicFocusable interface (which, in our case