forked from algorithm-visualizer/algorithm-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcode.js
More file actions
90 lines (70 loc) · 2.24 KB
/
code.js
File metadata and controls
90 lines (70 loc) · 2.24 KB
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
function SCCVertex(u, disc, low, st, stackMember, carry)
{
graphTracer._visit(u)._wait();
disc[u] = ++carry.time;
discTracer._notify(u, carry.time)._wait();
low[u] = carry.time;
lowTracer._notify(u, carry.time)._wait();
st.push(u);
stTracer._setData(st)._wait();
stackMember[u] = true;
stackMemberTracer._notify(u, true)._wait();
// Go through all vertices adjacent to this
for (var v = 0; v < G[u].length; v++) {
if (G[u][v]) {
// If v is not visited yet, then recur for it
if (disc[v] == -1) {
SCCVertex(v, disc, low, st, stackMember, carry);
// Check if the subtree rooted with 'v' has a
// connection to one of the ancestors of 'u'
low[u] = Math.min(low[u], low[v]);
lowTracer._notify(u, low[u]);
}
// Update low value of 'u' only of 'v' is still in stack
// (i.e. it's a back edge, not cross edge).
else if (stackMember[v] == true) {
low[u] = Math.min(low[u], disc[v]);
lowTracer._notify(u, low[u])._wait();
}
}
}
// head node found, pop the stack and print an SCC
var w = 0; // To store stack extracted vertices
if (low[u] == disc[u]) {
while (st[st.length-1] != u) {
w = st.pop();
stTracer._setData(st)._wait();
logger._print(w)._wait();
stackMember[w] = false;
stackMemberTracer._notify(w, false)._wait();
}
w = st.pop();
stTracer._setData(st)._wait();
logger._print(w)._wait();
logger._print('------');
stackMember[w] = false;
stackMemberTracer._notify(w, false)._wait();
}
}
function SCC()
{
var disc = new Array(G.length);
var low = new Array(G.length);
var stackMember = new Array(G.length);
var st = [];
var carry = { time: 0 };
for (var i = 0; i < G.length; i++) {
disc[i] = -1;
low[i] = -1;
stackMember[i] = false;
}
discTracer._setData(disc);
lowTracer._setData(low);
stackMemberTracer._setData(stackMember);
stTracer._setData(st);
for (var i = 0; i < G.length; i++) {
if (disc[i] == -1) {
SCCVertex(i, disc, low, st, stackMember, carry);
}
}
}