关键路径

最近在准备复试，虽然关键路径机试从没考过，以防万一，自己实现一下。理论书上基本都有，就不写了。

#include<iostream>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
const int maxn = 1000;
struct node {
	int v;//邻接点
	int w;//边长
};
vector<node>graph[maxn];//用邻接表存储图
int n, m;//顶点数、边数
int inDegree[maxn],ve[maxn],vl[maxn];//入度、最早开始时间，最迟开始时间
stack<int>topoSort;//拓扑排序

vector<node>critPath[maxn];//用于存储关键路径
vector<int>temp;//用于输出关键路径
void topo() {//拓扑排序同时生成ve
	int pos = -1;
	queue<int>q;
	for (int i = 0; i < n; i++) {
		if (inDegree[i] == 0) {
			pos = i;
			break;
		}
	}
	q.push(pos);
	while (!q.empty()) {
		pos = q.front();
		q.pop();
		topoSort.push(pos);
		for (int i = 0; i < graph[pos].size(); i++) {
			int v = graph[pos][i].v;
			inDegree[v]--;
			if (inDegree[v] == 0)q.push(v);
			if (ve[v] < ve[pos] + graph[pos][i].w) {
				ve[v] = ve[pos] + graph[pos][i].w;
			}
		}
	}
}

int critical_path() {//逆拓扑序列从后往前计算vl
	int maxL = 0, end = 0;
	for (int i = 0; i < n; i++) {//寻找汇点（终点）
		if (ve[i] > maxL) {
			maxL = ve[i];
			end = i;
		}
	}
	cout << "length: " << maxL << endl;
	fill(vl, vl + n, maxL);//*******重要*******
	while (!topoSort.empty()) {
		int pos = topoSort.top();
		topoSort.pop();
		for (int i = 0; i < graph[pos].size(); i++) {
			int v = graph[pos][i].v;
			if (vl[v] - graph[pos][i].w < vl[pos]) {
				vl[pos] = vl[v] - graph[pos][i].w;
			}
		}
	}				
	//比较各活动的最早和最迟开始时间，判断是否为关键活动
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < graph[i].size(); j++) {
			int v = graph[i][j].v, w = graph[i][j].w;
			int e = ve[i], l = vl[v] - w;
			if (e == l) {
				cout << i << " " << v << endl;
				critPath[i].push_back({ v,graph[i][j].w });
			}
		}
	}
	return end;
}
//如果只需要求关键活动就不需要dfs来输出关键路径
void dfs(int start,int end) {
	temp.push_back(start);
	if (start == end) {
		for (int i = 0; i < temp.size(); i++) {
			cout << temp[i];
			if (i != temp.size() - 1)cout << " ";
			else
				cout << endl;
		}
		return;
	}
	for (int j = 0; j < critPath[start].size(); j++) {
		int v = critPath[start][j].v;
		//temp.push_back()也可以写在这里，不过这样temp里就不包含起点
		dfs(v, end);
		temp.pop_back();
	}
}
int main() {
	cin >> n >> m;
	fill(inDegree, inDegree + n, 0);
	fill(ve, ve + n, 0);
	for (int i = 0; i < m; i++) {
		int s, e, l;
		cin >> s >> e >> l;
		graph[s].push_back({ e,l });
		inDegree[e]++;
	}
	topo();
	cout << "关键活动：" << endl;
	int end = critical_path();
	cout << "关键路径：" << endl;
	dfs(0, end);
	return 0;
}