55using namespace CONNECTIVITYLIB;
84 QList<QSharedPointer<NetworkEdge> > edgeList;
86 for(
int i = 0; i<
m_lEdges.size(); i++) {
99 QList<QSharedPointer<NetworkEdge> > edgeList;
101 for(
int i = 0; i<
m_lEdges.size(); i++) {
102 if(
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
114 QList<QSharedPointer<NetworkEdge> > edgeList;
116 for(
int i = 0; i<
m_lEdges.size(); i++) {
117 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
129 QList<QSharedPointer<NetworkEdge> > edgeList;
131 for(
int i = 0; i<
m_lEdges.size(); i++) {
132 if(
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
144 QList<QSharedPointer<NetworkEdge> > edgeList;
146 for(
int i = 0; i<
m_lEdges.size(); i++) {
147 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
182 for(
int i = 0; i <
m_lEdges.size(); i++) {
197 for(
int i = 0; i<
m_lEdges.size(); i++) {
198 if(
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
212 for(
int i = 0; i<
m_lEdges.size(); i++) {
213 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
227 for(
int i = 0; i<
m_lEdges.size(); i++) {
228 if(
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
242 for(
int i = 0; i<
m_lEdges.size(); i++) {
243 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
255 double dStrength = 0.0;
257 for(
int i = 0; i <
m_lEdges.size(); ++i) {
258 dStrength +=
m_lEdges.at(i)->getWeight();
268 double dStrength = 0.0;
270 for(
int i = 0; i <
m_lEdges.size(); ++i) {
272 dStrength +=
m_lEdges.at(i)->getWeight();
283 double dStrength = 0.0;
285 for(
int i = 0; i <
m_lEdges.size(); ++i) {
286 if(
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
287 dStrength +=
m_lEdges.at(i)->getWeight();
298 double dStrength = 0.0;
300 for(
int i = 0; i <
m_lEdges.size(); ++i) {
301 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
302 dStrength +=
m_lEdges.at(i)->getWeight();
313 double dStrength = 0.0;
315 for(
int i = 0; i <
m_lEdges.size(); ++i) {
316 if(
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
317 dStrength +=
m_lEdges.at(i)->getWeight();
328 double dStrength = 0.0;
330 for(
int i = 0; i <
m_lEdges.size(); ++i) {
331 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
332 dStrength +=
m_lEdges.at(i)->getWeight();
357 if(newEdge->getEndNodeID() != newEdge->getStartNodeID()) {
NetworkEdge class declaration.
NetworkNode class declaration.
double getThresholdedOutstrength() const
qint16 getThresholdedIndegree() const
qint16 getThresholdedOutdegree() const
QList< QSharedPointer< NetworkEdge > > getThresholdedEdges() const
qint16 getFullOutdegree() const
qint16 getFullDegree() const
qint16 getThresholdedDegree() const
double getThresholdedStrength() const
qint16 getFullIndegree() const
bool getHubStatus() const
void setHubStatus(bool bIsHub)
NetworkNode(qint16 iId, const Eigen::RowVectorXf &vecVert)
void append(QSharedPointer< NetworkEdge > newEdge)
double getFullInstrength() const
QList< QSharedPointer< NetworkEdge > > getFullEdgesOut() const
QList< QSharedPointer< NetworkEdge > > getThresholdedEdgesOut() const
double getThresholdedInstrength() const
QList< QSharedPointer< NetworkEdge > > m_lEdges
QList< QSharedPointer< NetworkEdge > > getFullEdgesIn() const
double getFullStrength() const
const Eigen::RowVectorXf & getVert() const
double getFullOutstrength() const
Eigen::RowVectorXf m_vecVert
const QList< QSharedPointer< NetworkEdge > > & getFullEdges() const
QList< QSharedPointer< NetworkEdge > > getThresholdedEdgesIn() const