十字链表，可实现插入，删除，保存，恢复等功能

数据结构课程实验中所编的判断哈夫曼编码.参考可用-experimental data structure courses, which include the judgment Huffman coding. Reference available

MATLAB queen常见的来到过程有定长输入、泊松(Poisson)输入、埃尔朗(A. K. Erlang)输入等-MATLAB queen

数据结构的一些简单编程题,二叉树结构，遍历的递归于非递归算法-data structure that some simple programming, binary tree structure, traverse the non- recursive recursive algorithm

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

// kmeans.c//伊桑·布罗德斯基2011年//月#include#include#include＃定义SQR（X）（（X）*（X））＃定义MAX_CLUSTERS16＃定义MAX_ITERATIONS100＃定义BIG_double（INFINITY）无效失败（字符*海峡）{的printf（STR）;出口（-1）;}双calc_distance（INT暗淡，双* P1，双* P2）{双distance_sq_sum= 0;对于（INT II=0;二

北大在线题库3468题标程代码，经典数据结构“线段树”的完美运用-Beijing 3468 title online questions marked-way code, data structure of the classic

用c做的图的数据结构的作业,建立有向图,深度广度搜索,分为递归和非递归方式.-C to do with the map data structure operations, the establishment has to map the depth of breadth of search, is divided into recursive and non-recursive way.

根据图书管理的功能要求，结合学校图书管理的实际情况，系统分成以下若干模块：编目、典藏、流通、读者、查询、系统维护。-According to the functional requirements of library management, combined with the actual situation of the school library management, the system divided into several modules: cataloging, collection, circulation, reader, search, system maintenance.

；；；；！[endif]-->；；；！[endif]-->；；；！[endif]-->；；；！[endif]-->；；-->；

货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35