该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计...

数据结构示例

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

* 本文件是 LTE Sim 的一部分* LTE Sim 是免费软件 ；你可以将它重新分发和/或修改* 根据 GNU 通用公共许可证版本 3 作为它由自由软件基金会 ； 的出版 ；* LTE Sim 被分布在希望它会有用的* 但不提供任何保证 ；没有甚至隐含的担保* 适销性或适合特定目的。请参见* GNU 通用公共许可证有关更多详细信息。*

工资管理系统用PB和SQL开发的，包含一个代码SQL文件和3个代码PB文件-wage management system with PB and SQL development, including an SQL code documents and three PB code documents

利用随机函数产生30000个随机整数，利用插入排序、起泡排序、选择排序、快速排序、堆排序、归并排序等排序方法进行排序，并统计每一种排序上机所花费的时间-Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort and other sorting methods to sort and sort each type of statistics on the time machine

数据结构中堆栈的具体应用，实现表达式的化简、求值等功能，可以自由确定变量，并且可以给变量赋值。Vc开发，包括了用户操作界面，输入输出清晰。-stack data structures to the specific applications, simplification of the expression, evaluates functions and the freedom to determine variables, as well as to assign values to variables. Vc development, including the user interface, input and output clear.

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

货郎担限界算法 c语言-traveling salesman Bound algorithm language c

在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。 给定作业序列，要求一种作业排序算法，使获得的总效益值最大。 -On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits. For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.

利用OLEDB以数据库的方式打开Excell文件，SQL语句同样适用-using OLEDB databases to open Excel documents, SQL statements apply equally