-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreduce.js
More file actions
executable file
·107 lines (86 loc) · 2.15 KB
/
Copy pathreduce.js
File metadata and controls
executable file
·107 lines (86 loc) · 2.15 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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
// Reduce unified signaling network by disabling unwanted nodes/links
function reduceNetwork()
{
removeUnobserableNodes();
recomputeDegrees();
identifyPrimaryInputsAndOutputs();
resetGraphics();
VisualizeKeggFloating(gNodes, gLinks);
}
// Disable isolated nodes (no input and outpus)
function removeIsolatedNodes()
{
for (var i = 0; i < gNodes.length; i++) {
var n = gNodes[i];
if (n.inDegree == 0 && n.outDegree == 0) {
n.isDisabled = true;
}
}
}
// Disable all compound nodes and associated links
function disableCompoundsAndAssociatedLinks()
{
for (var i = 0; i < gNodes.length; i++) {
var n = gNodes[i];
if (n.type == "compound") {
for (var k = 0; k < n.linkin.length; k++) {
var l = n.linkin[k];
l.isDisabled = true;
}
for (var k = 0; k < n.linkout.length; k++) {
var l = n.linkout[k];
l.isDisabled = true;
}
n.isDisabled = true;
}
}
}
// Disable nodes and links NOT on a path to a transcription factor (TF)
function removeUnobserableNodes()
{
clearFlags();
// Mark Backwards from TF nodes
for (var i = 0; i < gNodes.length; i++) {
var n = gNodes[i];
if (n.isTF == true) {
markBackwards(n, null);
}
}
for (var i = 0; i < gNodes.length; i++) {
var n = gNodes[i];
if (n.visited == false) n.isDisabled = true;
}
for (var i = 0; i < gLinks.length; i++) {
var l = gLinks[i];
if (l.visited == false) l.isDisabled = true;
}
}
function markBackwards(n, l)
{
if (l != null) {
if (l.isDisabled == true) return;
if (l.visited == true) return;
l.visited = true;
}
if (n.visited == true) return;
n.visited = true;
for (var i = 0; i < n.linkin.length; i++) {
var inlink = n.linkin[i];
var sourceNode = inlink.source;
markBackwards(sourceNode, inlink);
}
}
function markForwards(n, l)
{
if (l != null) {
if (l.isDisabled == true) return;
if (l.visited == true) return;
l.visited = true;
}
n.visited = true;
for (var i = 0; i < n.linkout.length; i++) {
var outlink = n.linkout[i];
var targetNode = outlink.target;
markForwards(targetNode, outlink);
}
}