C++实现AOE网中的关键路径算法及机动时间计算算法(邻接表存储)_求关键路径和机动路径

代码如下:

#include <iostream>
#include <stack>
using namespace std;
const int N = 100;

typedef struct Node
{
	int adj;
	int w;
	Node *next;

}Node;

typedef struct VNode
{
	int in;
	int v;
	Node *first;

	VNode()
	{
		first = nullptr;
	}
}VNode;


class AOE
{
private:

	VNode adjList[N];
	int vn;
	int en;
	int tpord[N];
	int ve[N];
	int vl[N];
	bool coll[N];
	int path[N];
	bool vis[N];
public:

	AOE()
	{
		memset(ve, 0, sizeof(ve));
		memset(vl, 0, sizeof(vl));
	}


	void buildAOE()
	{
		int n, m;
		cin >> n >> m;
		vn = n;
		en = m;

		for (int i = 0; i < vn; i++)
		{
			cin>>adjList[i].v;
		}

		for (int i = 0; i < en; i++)
		{
			int x, y, w;
			cin >> x >> y >> w;
			Node *s = new Node;
			s->adj = y;
			s->w = w;
			s->next = adjList[x].first;
			adjList[x].first = s;
		}
	}

	void findIn()
	{


		for (int i = 0; i < vn; i++)
		{
			adjList[i].in = 0;
		}
		for (int i = 0; i < vn; i++)
		{
			for (Node *p = adjList[i].first; p; p = p->next)
			{
				adjList[p->adj].in++;
			}
		}
	}

	bool toptpord()
	{
		stack<int>s;
		findIn();
		for (int i = 0; i < vn; i++)
		{
			if (adjList[i].in == 0)
			{
				s.push(i);
			}
		}

		int n = vn;
		int cnt = 0;
		while (!s.empty())
		{
			int xx = s.top();
			s.pop();
			tpord[cnt++] = xx;
			n--;
			for (Node *p = adjList[xx].first; p; p = p->next)
			{
				int yy = p->adj;
				adjList[yy].in--;
				if (adjList[yy].in == 0)
				{
					s.push(yy);
				}

				if (ve[xx] + p->w > ve[yy])
				{
					ve[yy] = ve[xx] + p->w;
				}

			}

		}
		if (!n)
		{
			return true;
		}
		else
		{
			return false;
		}
	}

	bool criticPath()
	{
		if (!toptpord()) return false;
		for (int i = 0; i < vn; i++)
		{
			vl[i] = ve[vn - 1];
		}

		for (int i = vn - 1; i >= 0; i--)
		{
			int xx = tpord[i];

			for (Node *p = adjList[xx].first; p; p = p->next)
			{
				int yy = p->adj;
				if (vl[yy] - p->w < vl[xx])
				{
					vl[xx] = vl[yy] - p->w;

				}
			}
			int e = 0;
			int l = 0;
			for (int i = 0; i < vn; i++) coll[i] = false;
			for (int i = 0; i < vn; i++)
			{
				for (Node *p = adjList[i].first; p; p = p->next)
				{
					int k = p->adj;
					e = ve[i];
					l = vl[k] - p->w;
					if (e == l)
					{
						coll[i] = coll[k] = true;
					}
				}
			}
		}
		return true;
	}

	void freeTime()//求机动时间
	{

		for (int i = 0; i < vn; i++)
		{
			int xx = i;
			for (Node *p = adjList[i].first; p; p = p->next)
			{
				int yy = p->adj;
				if (vl[yy] - ve[xx] - p->w > 0)
				{
					cout << "yy = "<<yy<<" vl[yy] = " << vl[yy] <<" xx = "<<xx<< " ve[xx] = " << ve[xx] << " p->w = " << p->w << endl;
					cout << xx << " " << yy <<" "<< vl[yy] - ve[xx] - p->w<< endl;
				}
			}
		}
		cout << endl;
	}

	void dfs(int v, int cnt, int ans)
	{
		path[cnt++] = v;
		if (v == vn - 1)
		{
			cout << "value = " << ans << endl;
			for (int i = 0; i < cnt; i++)
			{
				cout << path[i] << " ";
			}
			cout << endl;
			return;
		}

		for (Node *p = adjList[v].first; p; p = p->next)
		{
			int k = p->adj;
			if (!vis[k] && coll[k])
			{
				vis[k] = true;
				dfs(k, cnt, ans + p->w);
				vis[k] = false;
			}
		}
	}

	void printPath()
	{
		for (int i = 0; i < vn; i++) vis[i] = false;
		vis[0] = true;
		dfs(0, 0, 0);
	}
	



};


int main()
{
	AOE g;
	g.buildAOE();
	g.criticPath();
	g.printPath();
	g.freeTime();
	return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245

测试如下: