-
Notifications
You must be signed in to change notification settings - Fork 1
/
ContactTracing.cpp
458 lines (393 loc) · 12.1 KB
/
ContactTracing.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
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
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
#include <iostream>
#include <list>
#include "ContactTree.h"
using namespace std;
//We decided to choose a queue as our linear data structure for our Contract Tracing system.
//With a queue we can add new contacts at the end of the queue as well as retrieve one from the front.
//Both enqueue and dequeue operations in Queue have O(1) complexity, this means that our traversal will be efficent
//no matter how many contacts there are. Using a queue also allows us to use the Breadth first Search Traversal
//algorithm, this helps us move through the contact tree from top to bottom, and a queue pairs perfectly with this
//since it follows the first in first out rule, thus making it the most suitable choice for this data structure.
///////////////////////////////////////////////////////////////
// Constructor
template <typename T>
ContactTree<T>::ContactTree() : root(nullptr) {}
// Destructor
template <typename T>
ContactTree<T>::~ContactTree()
{
if (root != nullptr) {
DeleteSubtree(root);
}
}
//check if the tree is empty
template <typename T>
bool ContactTree<T>::IsEmpty()
{
return root == nullptr;
}
//get the size of the tree
template <typename T>
int ContactTree<T>::GetSize()
{
return root->totalCases;
}
////get the size of the tree
//template <typename T>
//int ContactTree<T>::GetSize()
// {
// int size = 0;
// Queue<TreeNode<T>*> nodesQueue;
//
// //check if not empty
// if (root != nullptr) {
// nodesQueue.Enqueue(root);
// }
//
// // keep looping until queue empty (breadth-first search) traversal
// while (!nodesQueue.IsEmpty()) {
//
// // first node gets dequeued and assigned to a pointer (current)
// TreeNode<T>* current = nodesQueue.Front();
// nodesQueue.Dequeue();
// //update
// size++;
//
// // each child node (pointers in directContactsPtrList) of current are added to nodesQueue
// for (TreeNode<T>* child : current->directContactsPtrList) {
// nodesQueue.Enqueue(child);
// }
// }
//
// return size;
//}
//add patient zero
template <typename T>
void ContactTree<T>::AddPatient0(const T& medId)
{
//check if exist already
if (root != nullptr) {
cout << "Patient 0 already exists." << endl;
return;
}
//create new treenode
root = new TreeNode<T>(medId);
}
//add contact between two nodes
template <typename T>
void ContactTree<T>::AddContact(const T& parentMedId, const T& childMedId)
{
//find parent node in the tree
TreeNode<T>* parentNode = LookUpContact(parentMedId);
if (parentNode == nullptr) {
cout << "Parent with medicare ID " << parentMedId << " not found." << endl;
return;
}
//create new node(child) and add to parent's list of direct contacts
TreeNode<T>* childNode = new TreeNode<T>(parentNode, childMedId);
parentNode->directContactsPtrList.push_back(childNode);
//update contacts/cases
parentNode->directContacts++;
UpdateTotalCases(parentNode);
}
//look up a contact by medicare ID
template <typename T>
TreeNode<T>* ContactTree<T>::LookUpContact(const T& medId)
{
//check if tree empty
if (root == nullptr)
return nullptr;
//using queue
Queue<TreeNode<T>*> nodesQueue;
nodesQueue.Enqueue(root);
//traverse the lists (breadth first search traversal) until all nodes are checked
while (!nodesQueue.IsEmpty()) {
TreeNode<T>* current = nodesQueue.Front();
nodesQueue.Dequeue();
if (current->medicareId == medId) {
return current; // found node
}
//add all direct contacts of the curent node to the queue
for (TreeNode<T>* child : current->directContactsPtrList) {
nodesQueue.Enqueue(child);
}
}
return nullptr; // no match
}
////delete a contact and its subtree
//template <typename T>
//void ContactTree<T>::DeleteContact(const T& medId)
// {
// //find node to delete
// TreeNode<T>* nodeToDelete = findNode(medId);
// if (nodeToDelete == nullptr) {
// cout << "Contact with medicare ID " << medId << " not found." << endl;
// return;
// }
//
// // If the node to delete is the root
// if (nodeToDelete == root) {
// DeleteSubtree(root);
// root = nullptr; // update pointer to indicate empty tree
// return;
// }
//
// // node has a parent node?, if yes store the pointer(parent) to the parent node of the nodeToDelete
// TreeNode<T>* parent = nodeToDelete->parentPtr;
// if (parent != nullptr) {
//
// //iterate tru the list of nodes(child) of the parent
// for (TreeNode<T>* child : parent->directContactsPtrList) {
// if (child == nodeToDelete) {
// parent->directContactsPtrList.remove(nodeToDelete);
// // Update
// parent->directContacts--;
// UpdateTotalCases(parent);
// break; // Stop searching once found
// }
// }
// }
//
// DeleteSubtree(nodeToDelete);
//}
template <typename T>
void ContactTree<T>::DeleteContact(const T& medId)
{
//find node to delete
TreeNode<T>* nodeToDelete = LookUpContact(medId);
if (nodeToDelete == nullptr) {
cout << "Contact with medicare ID " << medId << " not found." << endl;
return;
}
if (nodeToDelete == root) {
DeleteSubtree(root);
root = nullptr; // Update root pointer to indicate an empty tree
return;
}
// node has a parent node?, if yes store the pointer(parent) to the parent node of the nodeToDelete
TreeNode<T>* parent = nodeToDelete->parentPtr;
DeleteSubtree(nodeToDelete);
parent->directContactsPtrList.remove(nodeToDelete);
parent->directContacts--;
UpdateTotalCases(parent);
}
//display contact information by medicare ID
template <typename T>
void ContactTree<T>::DisplayContact(const T& medId)
{
TreeNode<T>* node = LookUpContact(medId);
if (node == nullptr) {
cout << "Contact with medicare ID " << medId << " not found." << endl;
return;
}
DisplayContact(node);
}
//display contact information by TreeNode pointer
template <typename T>
void ContactTree<T>::DisplayContact(TreeNode<T>* node)
{
cout << "Medicare ID: " << node->medicareId << endl;
cout << "Direct Contacts: " << node->directContacts << endl;
cout << "Total Cases: " << node->totalCases << endl;
}
//trace the source of infection given a medicare ID
template <typename T>
void ContactTree<T>::TraceSource(const T& medId)
{
TreeNode<T>* node = LookUpContact(medId);
if (node == nullptr) {
cout << "Contact with medicare ID " << medId << " not found." << endl;
return;
}
//if node found, initialize pointer for node
TreeNode<T>* current = node;
//keep going until it reaches the root/parent
while (current != nullptr) {
DisplayContact(current);
current = current->parentPtr;
}
}
//print contact cases given a medicare ID
template <typename T>
void ContactTree<T>::PrintContactCases(const T& medId)
{
TreeNode<T>* node = LookUpContact(medId);
if (node == nullptr) {
cout << "Contact with medicare ID " << medId << " not found." << endl;
return;
}
for (TreeNode<T>* contact : node->directContactsPtrList) {
DisplayContact(contact);
}
}
//print the entire contact tree using BFS
template <typename T>
void ContactTree<T>::PrintContactTree()
{
//make a queue
Queue<TreeNode<T>*> nodesQueue;
if (root != nullptr) {
nodesQueue.Enqueue(root);
}
while (!nodesQueue.IsEmpty()) {
//dequeue the first node and store it in pointer current
TreeNode<T>* current = nodesQueue.Front();
nodesQueue.Dequeue();
DisplayContact(current);
//then keep looping through each child node of current and add it to the queue
for (TreeNode<T>* child : current->directContactsPtrList) {
nodesQueue.Enqueue(child);
}
}
}
////print hierarchical tree
//template <typename T>
//void ContactTree<T>::PrintHierarchicalTree()
// {
// if (root == nullptr) {
// cout << "Tree is empty." << endl;
// return;
// }
//
// Queue<TreeNode<T>*> nodesQueue;
// nodesQueue.Enqueue(root);
//
// while (!nodesQueue.IsEmpty()) {
// // Get the front node from the queue
// TreeNode<T>* current = nodesQueue.Front();
// nodesQueue.Dequeue();
// cout << "Medicare ID: " << current->medicareId << endl;
//
// // Enqueue all child nodes of the current node
// for (TreeNode<T>* child : current->directContactsPtrList) {
// nodesQueue.Enqueue(child);
// }
// }
//}
template <typename T>
void ContactTree<T>::DeleteSubtree(TreeNode<T>* node)
{
if (node == nullptr) return;
// initialize queue
Queue<TreeNode<T>*> nodesQueue;
//node(root of subtree)
nodesQueue.Enqueue(node);
// keep looping until queue empty (breadth-first search) traversal
while (!nodesQueue.IsEmpty()) {
// first node gets dequeued and assigned to a pointer (current)
TreeNode<T>* current = nodesQueue.Front();
nodesQueue.Dequeue();
// each child node (pointers in directContactsPtrList) of current are added to nodesQueue
for (TreeNode<T>* child : current->directContactsPtrList) {
//nodesQueue.Dequeue(child);
nodesQueue.Enqueue(child);
}
delete current;
}
}
template <typename T>
void ContactTree<T>::PrintHierarchicalTree()
{
if (root == nullptr) {
cout << "Tree is empty." << endl;
return;
}
PrintTreeRecursive(root, 0);
}
template <typename T>
void ContactTree<T>::PrintTreeRecursive(TreeNode<T>* node, int i)
{
if (node == nullptr) {
return;
}
for (int j = 0; j < i; j++)
cout << "\t";
cout << "Medicare ID: " << node->medicareId << endl;
for (TreeNode<T>* child : node->directContactsPtrList) {
PrintTreeRecursive(child, i + 1);
}
}
//function to update totalCases up the tree
template <typename T>
void ContactTree<T>::UpdateTotalCases(TreeNode<T>* node)
{
while (node != nullptr) {
node->totalCases++;
node = node->parentPtr;
}
}
//
//int main()
// {
// // Testing the ContactTree class with string values
// ContactTree<string> tree;
//
// // add patient zero
// tree.AddPatient0("A");
//
// // add contacts
// tree.AddContact("A", "B");
// tree.AddContact("A", "C");
// tree.AddContact("B", "D");
// tree.AddContact("B", "E");
// tree.AddContact("C", "F");
//
// // contact information
// tree.DisplayContact("B");
//
// // trace source of infection
// tree.TraceSource("D");
//
// // hierarchical tree
// tree.PrintHierarchicalTree();
//
// return 0;
//}
int main()
{
// Testing the ContactTree class with int values
ContactTree<int> tree;
// add patient zero
tree.AddPatient0(1);
// add contacts
tree.AddContact(1, 2);
tree.AddContact(1, 3);
tree.AddContact(2, 4);
tree.AddContact(2, 5);
tree.AddContact(3, 6);
cout << "Contact Info:\n";
// contact information
tree.DisplayContact(2);
cout << "\nHierarchchical Tree:\n ";
// hierarchical tree
tree.PrintHierarchicalTree();
cout << "\nPatients in Contact Tree:\n ";
// contact tree
tree.PrintContactTree();
cout << "\nContact cases of patient:\n ";
// contact cases of a given patient
tree.PrintContactCases(3);
cout << "\nTrace source of contact:\n ";
// trace source
tree.TraceSource(4);
cout << "\n\nDeleting contact with the ID of 2...\n ";
tree.DeleteContact(2);
cout << "\nContact Info:\n";
// contact information
tree.DisplayContact(2);
cout << "\nHierarchchical Tree:\n ";
// hierarchical tree
tree.PrintHierarchicalTree();
cout << "\nPatients in Contact Tree:\n ";
// contact tree
tree.PrintContactTree();
cout << "\nContact cases of patient:\n ";
// contact cases of a given patient
tree.PrintContactCases(3);
cout << "\nTrace source of contact:\n ";
// trace source
tree.TraceSource(4);
//so the console doesn't close immediately
system("pause");
return 0;
}