Data structure course first experiment requirements: 1. Base class and derived c...

无向网生成最小树，基于VISUAL C++开发，数据结构-Undirected network generate minimum spanning tree, based on the VISUAL C++ Development, data structure

发送短信模块源代码！PCON &= 0x7F; //波特率不倍速 SCON = 0x50; //8位数据,可变波特率 AUXR &= 0xBF; //定时器1时钟为Fosc/12,即12T AUXR &= 0xFE; //串口1选择定时器1为波特率发生器 TMOD &= 0x0F; //清除定时器1模式位 TMOD |= 0x20; //设定定时器1为8位自动重装方式 TL1 = 0xFD;  //设定定时初值 TH1 = 0xFD;  //设定定时器重装值 ET1 = 0;    //禁止定时器1中断 TR1 = 1;    //启动定时器1   ES=1;  //开串口中断

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

求最短路径，基于VISUAL C++开发的源代码 属于数据结构-Seek the shortest path, based on the VISUAL C++ Developed source code belonging to the data structure

数据库监视备份软件te:应用程序例子(te.exe)-Bowl beat pacing视tong-de-sac glass figurines 软 te: Beckmannia email using the most序bird

计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial

本程序是实现二叉树跟树的常用算法，都是尽量用非递归来编写的。关于二叉树的都可以从键盘动态输入，关于树的就不可以，原因是树的结构问题，在程序中，树的建立用到动态左孩子/右孩子建立-this program is a binary tree with the tree is commonly used algorithm, as possible, to use non- recursive prepared. On the binary tree can be dynamic input from the keyboard, on the tree will not be able to because of the tree structure, in the process, the tree is used to establish dynamic children left/right to establish child

在java中链接数据库，代码量不多，但是麻雀虽小，五脏俱全！-in which links database, code volume is small, sparrow is small, perfectly formed!

一个关于数据结构哈夫曼编/译码的程序-Another Huffman tree coding Algorithm for Data Structure.

此程序包括三部分，通讯，数据库，和界面设计。是一个常用的工业测控用的程序。-This procedure consists of three parts, communications, databases, and interface design. Is a commonly used in industrial monitoring and control proceedings.