-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathNode.cpp
More file actions
137 lines (118 loc) · 2.97 KB
/
Copy pathNode.cpp
File metadata and controls
137 lines (118 loc) · 2.97 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
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
/*
* Author: Seung-Hee Bae (shbae@cs.washington.edu)
* Date: Mar. 2014
* Copyright (C) since 2013, Seung-Hee Bae, Bill Howe, Database Group at the University of Washington
*/
#include <iostream>
#include "Node.h"
using namespace std;
Node::Node()
:id(0),
size(0.0),
exitPr(0.0),
nodeWeight(1.0),
modIdx(0),
isModule(false),
isSuper(false),
orig_module(NULL),
teleportWeight(0.0),
danglingSize(0.0),
isDangling(false)
{}
Node::Node(int id)
:id(id),
size(0.0),
exitPr(0.0),
nodeWeight(1.0),
modIdx(0),
isModule(false),
isSuper(false),
orig_module(NULL),
teleportWeight(0.0),
danglingSize(0.0),
isDangling(false)
{}
Node::Node(int id, double size)
:id(id),
size(size),
exitPr(0.0),
nodeWeight(1.0),
modIdx(0),
isModule(false),
isSuper(false),
orig_module(NULL),
teleportWeight(0.0),
danglingSize(0.0),
isDangling(false)
{}
Node::Node(int id, double size, int module, bool isModule, Module *original_module)
:id(id),
size(size),
exitPr(0.0),
nodeWeight(1.0),
modIdx(module),
isModule(isModule),
isSuper(false),
orig_module(original_module),
teleportWeight(0.0),
danglingSize(0.0),
isDangling(false)
{}
// Constructor of SuperNode class which is a derived class of Node.
SuperNode::SuperNode() {
}
SuperNode::SuperNode(Module module, int newID)
{
// initialize member variables w.r.t. the given Module object 'module.'
id = newID;
name = "SuperNode";
size = module.SumPr();
exitPr = module.ExitPr();
nodeWeight = 0.0; // later adding nodeWeight of each member node.
modIdx = module.Index();
isModule = false;
isSuper = true;
orig_module = NULL;
teleportWeight = module.SumTPWeight();
danglingSize = module.SumDangling();
isDangling = false; // NEED TO BE CONFIRMED !!!
int numMembers = module.members.size();
if (numMembers > 0) {
for (int i = 0; i < numMembers; i++) {
//module.members[i]->setModIdx(newID);
members.push_back(module.members[i]);
nodeWeight += module.members[i]->NodeWeight();
}
}
if (numMembers != module.NumMembers())
cout << "SuperNode[" << id << "] members.size() != numMembers" << endl;
if (members.size() != module.members.size())
cout << "SuperNode[" << id << "] members.size() != module.members.size()" << endl;
}
SuperNode::SuperNode(SubModule* subMod, int newID, Network& network)
{
id = newID;
name = "SuperNode";
size = subMod->sumPr;
exitPr = 0.0;
nodeWeight = 0.0;
modIdx = subMod->modIdx;
isModule = false;
isSuper = true;
orig_module = NULL;
teleportWeight = subMod->sumTPWeight;
danglingSize = subMod->sumDangling;
isDangling = false;
//size = 0.0;
//teleportWeight = 0.0;
//danglingSize = 0.0;
int numMembers = subMod->members.size(); // numMembers > 0 always.
for (int i = 0; i < numMembers; i++) {
members.push_back( &(network.nodes[subMod->members[i]]) );
nodeWeight += members[i]->NodeWeight();
//size += members[i]->Size();
//teleportWeight += members[i]->TeleportWeight();
//danglingSize += members[i]->DanglingSize();
}
// outLinks and inLinks vectors will be added later...
}