void BalanceGraph::createLinearSegment(AbstractNode *node) { // Create a segment Segment* segment = new Segment(); segments.push_back(segment); // Add the head of the chain segment->nodes.push_back(node); nodeToSegment.insert(node,segment); AbstractNode* currentNode = node->getSuccessors().first(); // We are still within in the chain while(currentNode->getPredecessors().size() == 1 && currentNode->getSuccessors().size() == 1) { segment->nodes.push_back(currentNode); nodeToSegment.insert(currentNode,segment); currentNode = currentNode->getSuccessors().first(); } // We are at the end of the chain now // If we have many predecessors, let it be if(currentNode->getPredecessors().size() > 1) { return; } // if we have no successors, end of chain, add and return if(currentNode->getSuccessors().isEmpty()) { segment->nodes.push_back(currentNode); nodeToSegment.insert(currentNode,segment); } }
void BalanceGraph::calculateUpForces() { for(Segment* segment : segments) { AbstractNode* tail = segment->nodes.last(); if (tail->getSuccessors().isEmpty()) { segment->dForce = 0; } else { qreal sum = 0; for(AbstractNode* succ : tail->getSuccessors()) { sum += succ->getInport().x() - tail->getOutport().x(); } segment->dForce = (double) (sum / tail->getSuccessors().size()); } } }