-
Notifications
You must be signed in to change notification settings - Fork 0
/
bfsSnapshotC.cpp
125 lines (114 loc) · 3.96 KB
/
bfsSnapshotC.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
#include <iostream>
#include <stdlib.h>
#include <fstream>
#include <string>
#include <string.h>
#include <vector>
#include <math.h>
#include "TemporalGraph.h"
/*Adds the interval (startTime, endTime) to bfsIntervals, removes redundant timepoints -
merges adjoining or overlapping intervals*/
void addInterval(std::vector<Interval*> &bfsIntervals, int startTime, int endTime){
Interval dummy;
for (int i = 0; i < bfsIntervals.size(); i++){
if (endTime < bfsIntervals[i]->getStartTime()){
bfsIntervals.insert(bfsIntervals.begin()+i, new Interval(startTime, endTime));
return;
}
if ((startTime <= bfsIntervals[i]->getEndTime())){
int minStartTime = dummy.min(startTime, bfsIntervals[i]->getStartTime());
int j = i + 1;
while ((j < bfsIntervals.size()) && (endTime >= bfsIntervals[j]->getStartTime()))
j++;
int maxEndTime = dummy.max(endTime, bfsIntervals[j-1]->getEndTime());
for (int k = i; k < j; k++) free(bfsIntervals[k]);
bfsIntervals.erase(bfsIntervals.begin()+i, bfsIntervals.begin()+j);
bfsIntervals.insert(bfsIntervals.begin()+i, new Interval(minStartTime, maxEndTime));
return;
}
if ((startTime <= bfsIntervals[i]->getStartTime()) && (endTime >= bfsIntervals[i]->getStartTime())){
int minStartTime = startTime;
int j = i + 1;
while ((j < bfsIntervals.size()) && (endTime >= bfsIntervals[j]->getStartTime()))
j++;
int maxEndTime = dummy.max(endTime, bfsIntervals[j-1]->getEndTime());
for (int k = i; k < j; k++) free(bfsIntervals[k]);
bfsIntervals.erase(bfsIntervals.begin()+i, bfsIntervals.begin()+j);
bfsIntervals.insert(bfsIntervals.begin()+i, new Interval(minStartTime, maxEndTime));
return;
}
}
bfsIntervals.push_back(new Interval(startTime, endTime));
}
void TemporalGraph::addEdgeToIndex(int src, int dst, int startTime){
}
void TemporalGraph::removeEdgeFromIndex(int src, int dst, int startTime, int endTime){
}
int TemporalGraph::isReachable(int src, int dst, int startTime, int endTime, int c, bool fractional){
/*reset all Nodes*/
bool isInQueue[numNodes];
std::vector<Interval*> *bfsIntervals = new vector<Interval*>[numNodes];
std::vector<int> queue;
for (int i = 0; i < numNodes; i++) isInQueue[i] = false;
int u = src;
addInterval(bfsIntervals[u], startTime, endTime);
isInQueue[u] = true;
queue.push_back(u);
while (queue.size() > 0){
u = queue[0];
queue.erase(queue.begin());
isInQueue[u] = false;
//for each edge from u
TemporalNode *n = nodes[u];
for (int i = 0; i < n->getNumEdges(true); i++){
TemporalEdge *e = n->getEdgeAt(i,true);
int v = e->getDestId();
Interval *x = new Interval(e->getStartTime(),e->getEndTime());
for (int j = 0; j < bfsIntervals[u].size(); j++){
Interval *z = x->intersection(bfsIntervals[u][j]);
if (z == NULL) continue;
bool subFlag = false;
for (int k = 0; k < bfsIntervals[v].size(); k++){
Interval *w = bfsIntervals[v][k];
bool isSub = w->isSubInterval(z);
if (isSub) subFlag = true;
}
if (!subFlag){
addInterval(bfsIntervals[v], z->getStartTime(), z->getEndTime());
if (isInQueue[v] == false){
queue.push_back(v);
isInQueue[v] = true;
}
}
free(z);
}
free(x);
}
}
int answer = 0;
if (fractional){
int tlength = 0;
for (int i = 0; i < bfsIntervals[dst].size(); i++){
tlength += bfsIntervals[dst][i]->getEndTime() - bfsIntervals[dst][i]->getStartTime() + 1;
}
if (tlength >= c) answer = 1;
}
else{
for (int i = 0; i < bfsIntervals[dst].size(); i++){
int tlength = bfsIntervals[dst][i]->getEndTime() - bfsIntervals[dst][i]->getStartTime() + 1;
if (tlength >= c){
answer = 1;
break;
}
}
}
/*free all bfsIntervals*/
for (int i = 0; i < numNodes; i++){
for (int j = 0; j < bfsIntervals[i].size(); j++){
delete bfsIntervals[i][j];
}
bfsIntervals[i].clear();
}
delete[] bfsIntervals;
return answer;
}