-
Notifications
You must be signed in to change notification settings - Fork 0
/
CriticalPath.cpp
149 lines (143 loc) · 2.67 KB
/
CriticalPath.cpp
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
#include<stdio.h>
#include<stdlib.h>
//typedef int Vertex;
typedef int DistType;
#define NotAVertex -1
#define MaxVertexNum 100
#define Infinity 10000
typedef struct TableEntry{
int Known;
DistType Dist;
int Path;
}Table[MaxVertexNum];
Table T;
void InitializeTable()
{
int i;
for (i = 0; i < MaxVertexNum; i++)
{
T[i].Known = T[i].Path = 0;
T[i].Dist = 0;
}
T[0].Known = 1;
T[0].Path = -1;
T[0].Dist = 0;
return;
}
int AdjacentMatrix[MaxVertexNum][MaxVertexNum] = {};
int Indegree[MaxVertexNum];
int TopNum[MaxVertexNum] = {};
int TopOrder[MaxVertexNum] = {};
void InitializeMatrix()
{
int i, j;
for ( i = 0; i < MaxVertexNum; i++)
{
for ( j = 0; j < MaxVertexNum; j++)
{
/*if (i != j)*/AdjacentMatrix[i][j] = Infinity;
}
}
return;
}
void InputEdge(int EdgeNum)
{
int i;
int From;
int To;
int Weight;
for ( i = 0; i < EdgeNum; i++)
{
scanf("%d %d %d", &From, &To, &Weight);
//if (!Weight)continue;
AdjacentMatrix[From][To] = Weight;
Indegree[To]++;
}
}
int TopSort(int VertexNum)
{
int Q[MaxVertexNum] = {};
int front = 0;
int rear = 0;
int Counter = 0;
int i, j;
for (i = 0; i < VertexNum; i++)
{
if (Indegree[i] == 0)
{
Q[rear++] = i;
}
}
while (front != rear)
{
TopNum[Q[front]] = Counter++;
for (i = 0; i < VertexNum; i++)
{
if (/*AdjacentMatrix[Q[front]][i] > 0&& */AdjacentMatrix[Q[front]][i] != Infinity)
{
if (!--Indegree[i])
{
Q[rear++] = i;
}
}
}
front++;
}
if (Counter != VertexNum)
{
printf("Impossible\n");
return 0;
}
else
{
for (i = 0; i < VertexNum; i++)
{
TopOrder[TopNum[i]] = i;
}
return 1;
}
}
int CriticalPath(int VertexNum)
{
int i, j;
for (i = 0; i < VertexNum; i++)
{
for (j = 0; j < VertexNum; j++)
{
if (/*AdjacentMatrix[TopOrder[i]][j] &&*/ AdjacentMatrix[TopOrder[i]][j] != Infinity)
{
T[j].Dist = T[j].Dist > (T[TopOrder[i]].Dist + AdjacentMatrix[TopOrder[i]][j] )? T[j].Dist : (T[TopOrder[i]].Dist + AdjacentMatrix[TopOrder[i]][j]);
}
}
}
/*for (i = 0; i < VertexNum; i++)
{
printf("dist[%d]=%d\n", i, T[i].Dist);
}*/
return(T[TopOrder[VertexNum-1]].Dist);
}
int main()
{
InitializeMatrix();
InitializeTable();
int Vertexs;
int Edges;
scanf("%d %d", &Vertexs, &Edges);
InputEdge(Edges);
int i, j;
for (i = 0; i < Vertexs; i++)
{
for (j = 0; j < Vertexs; j++)
{
if (AdjacentMatrix[i][j] != Infinity)printf("%d ", AdjacentMatrix[i][j]);
else
{
printf(" ");
}
}
printf("\n");
}
if(TopSort(Vertexs))printf("%d", CriticalPath(Vertexs));
system("pause");
return 0;
}