常用算法的C语言描述。里边算法非常详尽。解压即可使用。

如果发现有提示控件未注册,请运行"控件注册.bat"注册控件.-If it is found that the control has prompted unregistered, please run

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

能够输入节点 然后完成图的广度优先遍历-Able to enter the node and then complete the graph breadth-first traversal

匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.

冒泡法排序C++实现的简便运算，可直接应用-Bubble sort C++ method to achieve an easy operation, can be applied directly

用C++制作家谱-C production records

源代码，是java实现的，比较清晰，具体自己看-Source code, is a java implementation, a more explicit and specific look at their own

对文本文件进行huffman编码，并显示huffman树-to the text document for Huffman coding, and that Huffman tree

db2建库代码和开发文档 帮助初学者更好的学习db2-db2 database code and the development of documentation to help beginners better learning db2

fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ；fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog；fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ；