Insert

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

数据结构相关代码，源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))

从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)

设计一个表达式求值的程序。该程序必须可以接受包含（，），+，-，*，/的中缀表达式，并求出结果。如果表达式正确，则输出表达式的结果；如果表达式非法，则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)

实现汉诺塔的操作步骤输出，可以设置1，2，3三个塔柱，输出结果为用1，2，3表示的操作(Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3)

参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目，项目编号分别为 和 。由于各项目参加人数差别较大，有些项目取前五名，得分顺序为7，5，3，2，1；还有些项目只取前三名，得分顺序为5，3，2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单，内容包括各校所取得的每项成绩的项目号、名次（成绩）、姓名和得分；产生团体总分报表，内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据：对于 ， ， ，编号为奇数的项目取前五名，编号为偶数的项目取前三名，设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)

开括号和比括号的匹配，数据结构内容，很不错(More than brackets and brackets to open the match, the contents of data structure)

这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)

说明：  马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)

具有数据插入、修改、删除、显示、和查询功能的电话簿管理程序。 数据包括：人名、工作单位、电话号码、和E-mail地址。 可对记录中的姓名和电话号码进行修改。 可增加或删除记录。 可显示所有保存的记录。 可按人名或电话号码进行查询。 附加功能： 可修改单个记录的各项内容。 可重新建立电话簿。 可按人名或号码进行排序。 可统计名片数目及可再添加数目。 可插入单个名片并不破坏原有顺序(With the data to insert, modify, delete, display, and query functions of the phone book management program. The data include: the names, work units, phone number, and E-mail address. Can be modified to record the name and phone number. Increase or delete records. You can display all the records kept. According to the names or telephone number for queries. Additional features: you can modify the content of a single record. Can re-establish a Phonebook. According to the names or numbers to be sorted. Statistical card number and add the number. Insert a single card does not destroy the original order)