本程序实现了用数据结构中的图形知识编写一个求无循环有向帯权图（即通常所说的AOE网）中从起点到终点所有路径，经分析、比较求出长度最大路径，从而求出关键路径。-This code is used to calculate the every path from the starting piont to the ending piont of an AOE Figure,then carry out the maximum path

after analysizing and comparing,and then calculate the critical path.