C 拓扑排序+求总工期时长 08-图8 How Long Does It Take (25分)

08-图8 How Long Does It Take (25分)

Given the relations of all the activities of a project, you are supposed to find the earliest completion time of the project.

Input Specification:
Each input file contains one test case. Each case starts with a line containing two positive integers N (≤100), the number of activity check points (hence it is assumed that the check points are numbered from 0 to N−1), and M, the number of activities. Then M lines follow, each gives the description of an activity. For the i-th activity, three non-negative numbers are given: S[i], E[i], and L[i], where S[i] is the index of the starting check point, E[i] of the ending check point, and L[i] the lasting time of the activity. The numbers in a line are separated by a space.

Output Specification:
For each test case, if the scheduling is possible, print in a line its earliest completion time; or simply output “Impossible”.

Sample Input 1:

9 12
0 1 6
0 2 4
0 3 5
1 4 1
2 4 1
3 5 2
5 4 0
4 6 9
4 7 7
5 7 4
6 8 2
7 8 4

Sample Output 1:

18

Sample Input 2:

4 5
0 1 1
0 2 2
2 1 3
1 3 4
3 2 5

Sample Output 2:

Impossible

解题
给定拓扑图的结点数，边数，边权重，求该拓扑图的最短总工期时常；
注意点
拓扑图的边为单向边，插入边时注意方向；
拓扑排序
每次找入度为0的结点，将该节点加入工序表，删除该结点，更新与该节点相邻的结点的入度；
若需要计算总工时，要维护一个数组，存放每个结点结束的最短工时，即该结点所有入度结点的最短工时加该工序的工时，得到的最大值；

因为拓扑排序边较少，邻接表存放即可
1.将输入数据存放进邻接表

#include<iostream> 
#include<queue> 
#include<vector>
#define MAXN 101
using namespace std;

//邻接表储存
//要获得每个点的入度，当入度变为0时入队， 
typedef int Vertex;
typedef int WeightType;

typedef struct ENode *ptrtoENode;
struct ENode{
   
	Vertex V1