猴子摘香蕉问题使用C++语言描述，写的不好请大家多提意见！...

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

对学数据结构的朋友很帮助-Data on the structure of a friend is to help

汉诺塔演示程序，用VB做成的图形界面，能够实现汉诺塔问题，也即是把N个盘子从一根棍上移到另一根上面，通过中转的棍，但是必须保证在每根棍上都是下面的盘子大于上面的盘子。-HANOR demo program using VB create graphical interface to HANOR problems, that is, N dishes from one club to another on the above-through the interchange stick, but it must be guaranteed in each stick-on the following dishes are greater than the above dishes.

马周游问题代码，走日字形的马在 一个棋盘-Ma tour problem code

仓库源码。自己制作的。希望大家可以来信息指教-Warehouse source. Their own. I hope everyone can come to information index

Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL- Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search.

c语言实现的八皇后问题的解法-c language of the Queen"s eight Solution

一套完整的人力资源管理系统 包括员工信息管理等诸多模块 对C++范围SQL数据库进行了函数封装 可靠性高 包括增删改查等模块 可直接用于项目开发和学习 

AVL tree display format in two dimensional

C、C++语言实现的数据结构重要算法和程序 比较全。-C, C language data structures and algorithms important procedure is all.