能够输入节点 然后完成图的广度优先遍历

环形链表结点出排-circular linked list node wait-

在各种各样的搜索算法中，AVL树的搜索算法可以将其最短的搜索时间做一个保证，本程序就是实现了AVL搜索算法-in a wide variety of search algorithm, AVL tree search algorithms can be the shortest time to do a search that The procedure is to achieve the AVL Search Algorithm

用C++写的链表操作，可以作为一个简易的文本编辑器-list

如何备份和还原 MYSQL 数据基地 PROGRAMATICALY 与 VB 6.0 使用 MYSQL 转储程序来备份和还原到 MYSQL.exe。

最短路径查询,用的是ESRI公司arcobject组件开发的,已经作成dll,用起来非常的方便-Shortest Path inquiries, the company is ESRI arcobject development of the components, make dll with it is very convenient

将Canon相机拍照后自动存放到本地机器的照片，按照学工号重新命名后，保存到DB2数据库中，-Canon cameras will take pictures automatically deposited to the local machine photographs, according Xuegong, re-named after the preservation of the DB2 database,

二叉树遍历的递归算法,帮助理解程序设计过程中的递归思想,以及二叉树遍历的基本思想-Recursive binary tree traversal algorithm, to help understand the program design in the process of recursive thinking, as well as the basic idea of binary tree traversal

最小生成树问题 若要在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.

超市或杂货店，自助服务商店提供种类繁多的食品和家用商品，组织到各部门。

北京邮电大学软件工程研究生的课程---数据库设计开发-0-1.1.ppt ... 北京邮电大学软件工程研究生的课程---数据库设计开发-5.2.ppt-Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-0-1.1.ppt ... Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-5.2.ppt