64 QList<QSharedPointer<NetworkEdge> > edgeList;
66 for(
int i = 0; i<
m_lEdges.size(); i++) {
79 QList<QSharedPointer<NetworkEdge> > edgeList;
81 for(
int i = 0; i<
m_lEdges.size(); i++) {
82 if(
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
94 QList<QSharedPointer<NetworkEdge> > edgeList;
96 for(
int i = 0; i<
m_lEdges.size(); i++) {
97 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
109 QList<QSharedPointer<NetworkEdge> > edgeList;
111 for(
int i = 0; i<
m_lEdges.size(); i++) {
112 if(
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
124 QList<QSharedPointer<NetworkEdge> > edgeList;
126 for(
int i = 0; i<
m_lEdges.size(); i++) {
127 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
162 for(
int i = 0; i <
m_lEdges.size(); i++) {
177 for(
int i = 0; i<
m_lEdges.size(); i++) {
178 if(
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
192 for(
int i = 0; i<
m_lEdges.size(); i++) {
193 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
207 for(
int i = 0; i<
m_lEdges.size(); i++) {
208 if(
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
222 for(
int i = 0; i<
m_lEdges.size(); i++) {
223 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
235 double dStrength = 0.0;
237 for(
int i = 0; i <
m_lEdges.size(); ++i) {
238 dStrength +=
m_lEdges.at(i)->getWeight();
248 double dStrength = 0.0;
250 for(
int i = 0; i <
m_lEdges.size(); ++i) {
252 dStrength +=
m_lEdges.at(i)->getWeight();
263 double dStrength = 0.0;
265 for(
int i = 0; i <
m_lEdges.size(); ++i) {
266 if(
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
267 dStrength +=
m_lEdges.at(i)->getWeight();
278 double dStrength = 0.0;
280 for(
int i = 0; i <
m_lEdges.size(); ++i) {
281 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getEndNodeID() == this->getId()) {
282 dStrength +=
m_lEdges.at(i)->getWeight();
293 double dStrength = 0.0;
295 for(
int i = 0; i <
m_lEdges.size(); ++i) {
296 if(
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
297 dStrength +=
m_lEdges.at(i)->getWeight();
308 double dStrength = 0.0;
310 for(
int i = 0; i <
m_lEdges.size(); ++i) {
311 if(
m_lEdges.at(i)->isActive() &&
m_lEdges.at(i)->getStartNodeID() == this->getId()) {
312 dStrength +=
m_lEdges.at(i)->getWeight();
337 if(newEdge->getEndNodeID() != newEdge->getStartNodeID()) {
Weighted edge between two NetworkNode instances; stores the full per-frequency weight matrix and the ...
Node of a connectivity Network; carries a 3D position and the lists of incident (in / out,...
Functional connectivity metrics (coherence, PLV, cross-correlation, etc.).
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