资源列表
ShortPth
- 图论：最短路径算法实现 Graph.gph GraphBFS.h GraphM.h GraphOpr.h Queue.h sample.gph ShortPth.cpp ShortPth.dsp ShortPth.dsw ShortPth.ncb ShortPth.opt ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Gra
template123
- 讲述C++模板template的用法，对初学者很有帮助，推荐下载。-about C template template to use, helpful for beginners, to download.
aodv-uu-0.9.tar
- 路有算法aodv的linux下的版本，基本上可以在ns上运行。国外的好例子-road algorithm aodv under the Linux version, basically running on the ns. A good example abroad
search_optimize
- 本文将常见的设计剪枝判断的思路分成可行性剪枝和最优性剪枝两大类，并结合上述三个原则分别以一道竞赛题为例作了说明，最后对剪枝方法作了一些总结。-this paper the design of common pruning judgment ideas into pruning feasibility and optimality pruning two categories, and the combination of these three principles were in a cont
key_sort_system
- 多关键字的排序是有一定的实用范围。例如：在进行高考分数处理时，除了对总分进行排序外，不同的专业对单科分数的要求不同，因此尚需在总分相同的情况下，按用户提出的单科分数的次序要求排出考生录取的次序。(1)假如代排序的记录数不超10000，表中记录的关键字数不超过5，各个关键字的范围均为0至100。按用户给定的排序的关键字的优先关系，输出排序的结果。(2)约定按LSD方法进行多关键字的排序。在对各个关键字进行排序时采用两种策略：其一是利用稳定的内部排序方法，其二是利用“分配”和“收集”的方法。并综合比
caculation
- 电力系统潮流算法,内含多个子程序,可工大家学习参考-power flow algorithm, containing more than subroutine, we can learn from the Public Reference
C-Alg
- c算法在众多的编程思想中应用频率很高的 能够掌握并加以强化练习，对程序员来说是极为有利的＿-c algorithm in a number of application programming thinking of the high frequency to be able to master and strengthening exercises, the programmer is highly favorable _
Calgorithms
- c algorithm source code for gerneral data structure-c algorithm source code for gerneral data s ingScienceandEngineeringthroughCyberinfrastructure
erchatree
- 根据数据文件内的数据对二叉树进行操作。分别完成：二叉树节点数据的插入、删除、查找和打印输出等功能。-basis of the data within the data file to binary tree operate. Completed : binary tree node data insert, delete, search and print capabilities.
datastructnote
- 数据结构笔记,类c语言版本，我自觉很不错，大家可以-data structure, type c language version, I do feel quite well, and we can s
FIFOandLRUarithmetic
- 最佳页面置换算法，FIFO，LRU的仿真。页面调用和置换过程有动态显示。内存分配页面数目和页面引用串的长度可以进行人工交互输入。 -best pages replacement algorithm, FIFO, the LRU simulation. Page calls and replacement process is dynamic display. Memory allocation of the number of pages and pages cited the lengt
BBST1.5
- 数据库课程设计的题目，二叉树的基本功能都实现了，包括查找、删除、排序等-database design courses subject to the basic binary tree in all the functions, including search, delete, sort etc.