求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径-according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart

用邻接表存储有向图并建立AOE网； 用图形的形式输出有向图； 输出关键路径和关键活动。-Adjacency table is stored AOE directed graph and the establishment of networks In the form of graphics output directed graph Output critical path and critical activities.