资源列表
findsjjg
- 实验目的：掌握静态查找表的基本操作，并实现一个简单的信息管理问题。 实验要求：1、上机运行程序。 2、分析代码。 3、重写代码。 -experiment : static lookup table grasp the basic operation and the realization of a simple message management issues. Experimental requirements : one, operational procedures
AntLadybug
- 蚂蚁与瓢虫的算法．．． 一个算法题目的解答-ants and ladybugs algorithm. . . An algorithm to answer topics
BANK_er
- Banker.c 课程设计所需者请下 操作系统避免死锁算法-Banker.c courses necessary for the design of the floor to the next operating system to avoid deadlock algorithm
sloveandy
- 具体题目在rar文件里，内容和走迷宫类似，可以得到最短路径-specific topics in rar document, content and similar Maze can be Shortest Path
Kill_head
- 同济大学 1013 高精度整数去位去最小问题.用VC编写.-Tongji University in 1013 to high-precision integer-to the smallest issues. VC prepared.
GB-unicode
- 中文，UNICODE码互换程序，方便网页编程人员查看例如：天；地；沙；鸥；这样的字符-Chinese, UNICODE code swaps in order to facilitate web programmers see for example :
my8num.RAR
- 八数码问题的深度优先算法，优秀的显示效果。-eight digital depth of the priority algorithm, showed excellent results.
Soft20060207143420214
- 快速排序和冒泡排序数据结构里学的，做了船上来-Bubble rapid sequencing and scheduling data structure, the study done to the ship
nqueensc
- Ｎ皇后问题，我们的算法实验题目，非常重要的一个算法．-N Queen's problems, our algorithm experimental subject, it is very important that an algorithm.
mcolor+maxtree
- 这个代码包括求图的最大生成树和Ｍ着色问题．-this code includes plans for the biggest tree and M coloring problem.
dijkstrahop
- 修改ＤＩＪＫＳＴＲＡ算法，输出其过程中经过结点的个数．-revised algorithm, the process of its output after the number of nodes.
graphbfs
- 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees,