哈弗曼编码/译码系统

此书详细的介绍了各种流行和重要的图算法 识货的就下咯-book detailed account of a popular and important map know the quality of the algorithm on the basis of 1,10

离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive integer n and k, calculated (n, k) 01 series of numbers.

本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.

VC + SQL数据库编程 人事、工资、部门管理 包含SQL备份文件及部分源码注释-VC+ SQL Database Programming personnel, wages, management SQL backup file contains the source code and some notes

界面效果，用ACCESS编写的程序界面

数据结构中的八皇后问题-data structure of the eight Queen"s problems

通过对数据进行必要加工后的结果判断数据的存储方式，即，CPU的大端，小端-Through the data necessary to determine the results of processed data is stored, that is, CPU s big-endian, little-endian

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read

罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research

这是在VC下本人编写的解决八皇后问题的程序 ，92种解会直接输出在C：SIGN。H文件中。是用来测试一款C编译器而写的。-This the VC I prepared by the Queen"s problem to solve eight procedures, 92 kinds of solutions will be directly output in the C : SIGN. H files. It is used to test new C compiler written.