华宝器具和比色计

编译原理中在自下而上分析和优先分析方法中使用的Washall算法-Compilation Principle of priority in the bottom-up analysis and analytical methods used in Washall algorithm

数据结构电子书,清华大学出版社,严蔚敏老师-Data Structure e-books, Tsinghua University Press, YAN Wei-min Teachers

数据结构，经典算法，C语言和BASIC语言双重代码动态演示程序-Data structure, the classical algorithm, C language and double-source dynamic language BASIC demo program

kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.

jdbc连接db2范例,非常完整,我找了很久,供学习参考-jdbc connecting db2 example, the very integrity, I look for a long time for study reference

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

determinnant coding in spaning tr-determinnant coding in spaning tree

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

该数据库的源代码是本人自己开发，主要对于刚学习数据库的初学者有很多大的帮助，能够很好的帮助你理解数据库的用法。

采用EVEN方法实现排列 生成{1，2，3，4,……n}的全排列，每个排列只出现一次-EVEN method used to generate array (1,2,3,4, ... ... n) of the entire array, each with only one