资源列表
c++powerflow
- 潮流计算程序介绍，读者可以据此独立编制潮流计算程序。-flow calculation procedures, independent readers will be prepared accordingly flow calculation procedures.
linkqueue
- 数据结构中，链栈的实现。用C++实现，在DEV-C++上通过。-data structure, the chain stack realized. C realized, the DEV-C adopted.
AVL_Lib
- Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory
shuju
- 一些常用的数据结构源代码，是C语言版本的-some commonly used data structures source code, C language version of the
MSTVisual
- 最小生成树的算法演示，可自由添加结点和移动结点，边的权重也可自由更改-minimum spanning tree algorithm demonstration of the freedom to add nodes and mobile nodes, while the weights are free to change
LQueue
- 个人做的,也许有人需要,有错希望能给你们带来帮助-individuals do, some people may need a mistake, I hope you can help bring !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
nearpiont
- 最接近点对问题是求二维坐标中的点对问题，该算法是为了将平面上点集S线性分割为大小大致相等的2个子集S1和S2，我们选取一垂直线l:x=m来作为分割直线。其中m为S中各点x坐标的中位数。由此将S分割为S1={p∈S|px≤m}和S2={p∈S|px>m}。从而使S1和S2分别位于直线l的左侧和右侧，且S=S1∪S2 。由于m是S中各点x坐标值的中位数，因此S1和S2中的点数大致相等。 递归地在S1和S2上解最接近点对问题，我们分别得到S1和S2中的最小距离δ1和δ2。现设δ=min(δ
wolfstack
- 用类实现的栈的结构。在VC++6里编译通过。希望对初学者有点帮助。高手就不用看了。 -Class Implementation of the stack structure. The VC 6 Lane compile. Want a little help for beginners. Masters do not need to read.
smallTobig
- 这个程序是用C++来实现阿拉伯数字转为大写汉字.-the procedure is used to achieve C Arabic Chinese characters to uppercase.
Binary_search
- 简单的一个Binary_search查找-a simple search Binary_search
MultiPoly0427
- 一个多重链表的演示，包括如何创建，删除，插入等等。-a multiple Chain demonstration, including how to create, delete, insert and so on.
jizhiwenti
- 数学分析,高等代数中一些极值问题的计算机描述(C语言)-mathematical analysis, advanced algebra some extreme descr iption of the computer (C language)