最短路径 迪杰斯特拉 最短路径 迪杰斯特拉

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来自bi), 第4行存放0或１（０代表作业序号未进入最优调度方案；１代表作业序号已进入最优调度方案） （２） 排序完后，按课本所述方法求一种最优调度方案，存放在S中。 -(1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.

邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations

666

删除ORACLE数据库记录，条件选择，多表选择，删除结果显示，显示删除表数据的条码，对应每一个表多少记录，数据库多表可选择删除，结果多条显示

数据结构中的魔王语言解释算法-data structure of fiendish language to explain the algorithm

实现Haffman算法,有输入的接口,需输入字符及其权重,能自动生成Haffman编码-achieve Haffman algorithm, the input interface, the need to import characters and weights, can automatically generate code Haffman

得到中文的汉语拼音-be Chinese pinyin system

经典八数码问题,回溯法的解决-eight digital classic, backtracking solution

初学者学习c语言数据结构的编码，-Beginners to learn c language data structure encoding,

清华大学严蔚敏数据结构题集与答案（Ｃ语言版）-Tsinghua University, Yan Wei-min data structure set and answer questions (C language version)