组合问题，从M个不同字符中任取N个字符的所有组合

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

任意长整数相加问题 任意输入两个任意长的整数进行相加 可以得出正确结果，-arbitrary sum of long integer problem indiscriminate importation of two arbitrarily long integer can be drawn together for the right result,

我写的数据结构小程序是关于排序算法的，功能比较全-The little procedure of data structure that I wrote is about arranging in an order the algorithm, the function is more complete

多种排序方法的c实现和查找。入门看看还可以-various methods of sorting and searching c achieve. Portal can also see

公交车查询系统-Bus Inquiry System

图书管理系统源代码及报告分析，图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of

安徽工程科技学院 2009年计算机07级数据结构课程设计题目及要求-Anhui Institute of Engineering and Technology in 2009 a computer 07 data structure and requirements of the subject curriculum design

判别算得到 定界符 所进肺腑 军费发 费用打击法打击法 夫君诶非 夫君诶发-discriminant obtained delimiters are made into the heart of military combat costs combat goes wherever eh eh-fat

寻呼台用户管理系统(vb6.0编写)-paging subscriber management system (vb6.0 preparation)

资源描述本代码比较适合初学者，刚接触过C++语言的童鞋，对代码不是怎么懂，可以参考学习。