资源列表
Circular-queue
- 数据结构 循环队列 用C语言实现,在VC6.0下实现-Circular queue data structure using C language, to achieve in the VC6.0
StackItemandQueue
- 这是栈和队列的各种算法，除了一些基本用法外，还包括表达式求值等等一系列的算法-This is the stack and queue the various algorithms, except for some basic usage, but also includes a series of expression evaluation algorithm, etc.
stone
- 动态规划-最小代价子母树源码，主要提供参考。-Dynamic Programming- PIP minimum cost tree source, the main reference.
860869658wqijp
- 家谱管理系统数据结构课程设计 vc++ -Genealogy Management System Data Structure Course Design vc++
sort_exp
- 搜索算法源码：合并排序，快速排序，shell排序，插入排序，堆排序，冒泡排序，桶排序-sort： merge sort、quick sort、 shell sort、insert sort、heap sort、 bubble sort
FF
- ford-fulkerson算法的具体实现。实现了最大流算法。编程语言c-ford-fulkerson algorithm implementation. To achieve the maximum flow algorithm. C++ programming language
Data-structures
- 数据结构-用面向对象方法与C++描述-源程序 清华大学 殷人昆 vc6-Data structures- Object-oriented methods and C++ descr iption- source Tsinghua University, Yan Renkun
knapdynamicprogram
- 0-1背包问题的动态规划算法实现。包含1维及2维0-1背包问题。-0-1 knapsack problem dynamic programming algorithm. Contains 1-D and 2-dimensional 0-1 knapsack problem.
SIRT
- 此程序为井间层析成像sirt算法，该算法能保证反演过程的稳定性，并提高迭代的收敛速度-This program sirt hole tomography algorithm can guarantee the stability of inversion and improve the convergence rate of iteration
block
- 利用折半查找确定记录所在块的分块查找算法. 读入各记录建立主表,按L个记录/块建立索引表, 对给定关键字k进行查找-Use binary search to determine where the block record block search algorithm. Read into the record to establish the main menu, press L record/block index table, k for a given keyword searc
graph-search-algorithm
- 图搜索的非启发式和启发式算法, 着重分析了它们各自的复杂性、优缺点及 其相互关系, 提出了改进要点. 这对于如何选用一个合适的搜索算法是十分有益的.-Figure of non-heuristic and heuristic search algorithm, analyzes the complexity of their respective advantages and disadvantages and their relationship, an improved points.
memory--recycling-experiments
- 熟悉主存的分配与回收。理解在不同的存储管理方式下，如何实现主存空间的分配与回收。掌握动态分区分配方式中的数据结构和分配算法及动态分区存储管理方式及其实现过程-Familiar with the main memory allocation and recovery. Understanding of storage management in a different way, how to achieve the main memory space allocation and recyclin