data clustering

猴子选大王，c语言，有源码，有注释，可供使用交流。-election monkey king, c language, the source code, notes, the availability of the exchange.

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

用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree

大学的每个专业都要编制教学计划。假设任何专业都有固定的学习年限，每学年含两学期，每学期的时间长度和学分上限都相等。每个专业开设的课程都是确定的，而且课程的开设时间的安排必须满足先修关系。每个课程的先修关系都是确定的，可以有任意多门，也可以没有。每一门课程恰好一个学期。试在这样的情况下设置一个教学计划编制程序。三、基本要求：（1）：输入参数：学期总数，一学期的学分上限，每门课的课程号，学分，直接先修关系的课程号。（2）：课程号尽可能的集中在前几个学期中。（3）：若无解，则报告错误信息；否则见教学计划输入到指定的文件中。计划的表格格式自行设计-University of each professional should prepare teaching plans. The assumption that any professional have fixed the length of each school year with two semesters each semester and the length of time equal to the credit limit are. Every professional courses are opened to determine, and the creation of curriculum time arrangements must meet pre relations. Each course is the pre-established relationship, can have any more doors, there will be no. Each course just one semester. Tests in the circumstances set up a teaching program procedures. Three basic requirements : (1) : input parameters : total semester, a semester"s credit ceiling for each class courses, credits, direct relationship prevocational courses,. (2) : N

数据结构和算法中文第二版源代码程序打包下载-Data structures and algorithms second edition of the Chinese package download the source code program

最小生成树的prim算法 是求图中的最短路径的一个重要算法 但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm

这是一个关于acccess的数据库的一点技巧，希望对大家有帮助-This is a database on the acccess point techniques, we hope to help

B-树的创建、插入、删除等一系列操作！-B-tree creation, insert, delete a series of manipulations!

first simple MCF exercise

几种数据结构算法的C程序实现-several data structure algorithm C Programming