code1

克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )

该程序分析eit表的数据结构，病输出相应内容信息(parse eit table and output content info)

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)

数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)

本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)

说明：  在给定的字母中，用c++来实现字母的排序(In a given letter, the use of c++ to implement the letter of the sort)

总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)

c++数据结构中的二分查找树，是比较基本的数据查找结构，查找效率比较高(c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

实现了多项式的创建，实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)