使用汇编写的二叉树遍历，我用的是按层存储算法，容易理解...

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.

一共建6个表： 1) 购物表Trade_List（Trade_ID，Product） 2) 频繁一项集Apri

C++经典大整数实现,加减乘除.输入输出-C classic large integer, the arithmetic. Input and Output

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of

用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing

oledb的例子，在pda上好用-connectivity example, pda on Easy

按层遍历二叉树的算法设计探讨-layer by the binary tree traversal algorithm design

超市进销存管理系统源码，采用的是Visual Basic 语言和ACCESS数据库的综合-Purchase, Sales and Inventory management system stores source code, are used in Visual Basic language and ACCESS Database General

xbcnv提示：你将获得积分（0-20）的基础上，你的产品质量