List控件的使用,具有可编辑功能,方便的界面配置方法

数据结构 链表 按顺序合并两链表。 pa =1 2 4 7 9 11 16 pb= 1 6 9 23 24 36 1 1 2 4 6 7 9 11 16 23 24 36-link

中国文章系统数据库设计, 数据库设计.-China article system database design, database design.

一个简单的通讯录，是暑期的课程实践期间找的，感觉很好用，有查找，删除等功能1-A simple address book, is a summer practice during the course looking for, feel good, and has search, delete and other functions one

最小生成树，我自己做的小程序，很好用，希望和大家分享-Minimum spanning tree, my own little program, very good, and would like to share with

功能实现：1).输入，显示各个学生信息 2)．根据学号，姓名查找某个学生的成绩 3)．修改学生信息 4).删除学生信息 5） 清空数据库6）选择范围的输出学生成绩排名。-Function achieve: 1). Input, display individual student information 2). According to Student ID, name to find a student" s achievement 3). Modified Student Information 4). Remove Student Information 5) Clear the database 6) Select the output range of student achievement rankings.

堆栈的基本功能实现,数组方式实现-stack to achieve the basic functions, arrays means

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

数据结构基本算法实现 用C++实现理发馆防真功能-basic data structure algorithm in C-achieving barber"s shop really function

这是关于图论算法里面的一些代码,图论基本的思想代码的实现-This is on the graph theory algorithm inside some code, graph theory, the idea of the basic code realize

里面介绍的是严蔚敏《数据结构(c语言版)习题集》第二章答案-introduced inside the Yan Wei Min "data structure (c language version) Exercise Book," the second chapter answer