资源列表
mst
- 构造可以使n个城市连接的最小生成树，《数据结构》课程设计，VC++编写，VS2008环境。-Construction can make n city is connected to the minimum spanning tree," data structure" course design, VC++, VS2008environment.
process
- 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。 “最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。 静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等。 -there are no english,
prim
- 最小生成树的Prim算法，利用Prim算法求解不带约束条件的连通图的最小生成树。-The minimum spanning tree Prim algorithm
DouLinList
- 关于循环双链表的使用，如插入、删除、链表长度、链表内容等。-On the use of a doubly linked list of the cycle, such as insert, delete, linked list length, linked lists and content.
Floyd_OMP
- this all pair shortest path algorithm implementation -this is all pair shortest path algorithm implementation
gold
- 用贪心算法处理的金块问题，欢迎各位下载-Greedy algorithm processing of gold bullion, welcome you to download! ! !
maze
- 根据图的广度优先搜索算法，用数组模拟队列处理的迷宫问题。-According to the graph breadth-first search algorithm queue processing using an array of simulated maze.
huff
- 哈夫曼编译码系统，有简单的编码、译码、打印哈夫曼树等功能。-Huffman encoding and decoding systems, encoding, decoding, and printing features such as the Huffman tree.
sort
- 各类简单排序算法的移动次数，和比较次数的比较-The number of moves of the types of simple sorting algorithm, and compare the number of comparison! !
contest1
- uestc暑期集训第一次比赛，AC了的水题，希望对入门的朋友们有帮助。-4 AC codes for uestc contest 1,which can help you to hackle the "waterful" problems
suanfa
- 各种基础算法，二叉树、遍历、哈弗曼编码。 VC环境下实现的各类算法-All kinds of basic algorithm, the binary tree, traverse, hover tempting mann coding
Push_Pop
- Push and pop functions