-
Notifications
You must be signed in to change notification settings - Fork 0
/
hashlist.c
155 lines (130 loc) · 3.85 KB
/
hashlist.c
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
#include "hashlist.h"
/* Calculates the late start for task, taking in account the project
duration pDuration. */
void calculateLateStart(Task task, unsigned long pDuration);
/* Calculates the late start for task recursively. Returns the
value of late start.*/
unsigned long recursLateStart(Task task);
int hasCriticalPath(HashList hList)
{
return hList->validCriticalP;
}
HashList initHashList(int M)
{
HashList newHList = (HashList) malloc(sizeof(struct hashlist));
newHList->validCriticalP = 0;
newHList->duration = 0;
newHList->table = initHashTable(M);
newHList->list = initItemList();
return newHList;
}
void addItemToHL(HashList hList, Task task)
{
ItemLink link = addItemToList(hList->list, task);
addLinkToHash(hList->table, link);
hList->validCriticalP = 0;
}
void freeHLLink(HashList hList, PointerLink pointerLink)
{
ItemLink itemLink = getItemLink(pointerLink);
hList->validCriticalP = 0;
freeLinkHashTable(hList->table, pointerLink);
freeItemLink(hList->list, itemLink);
}
PointerLink findLinkInHL(HashList hList, unsigned long searchValue)
{
return findLinkInHash(hList->table, searchValue);
}
void freeHashList(HashList hList)
{
freeHashTable(hList->table);
free(hList->list);
free(hList);
}
ItemLink getFirstItemLinkHL(HashList hList)
{
return getFirstLinkIL(hList->list);
}
int isEmptyHL(HashList hList)
{
return isEmptyIL(hList->list);
}
void calculateProjectDuration(HashList hList)
{
ItemLink itemLink;
Task task;
unsigned long duration;
itemLink = getFirstLinkIL(hList->list);
while (itemLink != NULL) {
task = getItem(itemLink);
/* Find final tasks */
if (isEmptyIL(getDependants(task))) {
duration = task->duration + getEarlyStart(task);
if (duration > hList->duration) {
hList->duration = duration;
}
}
itemLink = getNextItemLink(itemLink);
}
}
void calculateCriticalPath(HashList hList)
{
ItemLink itemLink;
Task task;
if (!hList->validCriticalP) {
hList->duration = 0;
calculateProjectDuration(hList);
itemLink = getFirstLinkIL(hList->list);
while (itemLink != NULL) {
task = getItem(itemLink);
resetLate(task);
itemLink = getNextItemLink(itemLink);
}
itemLink = getLastLinkIL(hList->list);
while (itemLink != NULL) {
task = getItem(itemLink);
calculateLateStart(task, hList->duration);
itemLink = getPrevItemLink(itemLink);
}
}
/* Print Critical Path. */
hList->validCriticalP = 1;
itemLink = getFirstLinkIL(hList->list);
while (itemLink != NULL) {
task = getItem(itemLink);
if (getEarlyStart(task) == getLateStart(task)) {
printTask(task, hList->validCriticalP);
}
itemLink = getNextItemLink(itemLink);
}
printf("project duration = %lu\n", hList->duration);
}
void calculateLateStart(Task task, unsigned long pDuration)
{
if (isEmptyIL(getDependants(task))) {
setLateStart(task, pDuration - getDuration(task));
} else {
setLateStart(task, recursLateStart(task));
}
}
unsigned long recursLateStart(Task task)
{
ItemLink dependantLink;
Task dependantTask;
unsigned long min = ULONG_MAX;
unsigned long lateStart;
dependantLink = getFirstLinkIL(getDependants(task));
while (dependantLink != NULL) {
dependantTask = getItem(dependantLink);
if (getLateStart(dependantTask) == ULONG_MAX) {
return recursLateStart(task);
} else {
lateStart = getLateStart(dependantTask) - getDuration(task);
if (lateStart < min) {
min = lateStart;
}
}
dependantLink = getNextItemLink(dependantLink);
}
return min;
}