本文整理汇总了C++中AbstractNode::getPredecessors方法的典型用法代码示例。如果您正苦于以下问题：C++ AbstractNode::getPredecessors方法的具体用法？C++ AbstractNode::getPredecessors怎么用？C++ AbstractNode::getPredecessors使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类AbstractNode的用法示例。
在下文中一共展示了AbstractNode::getPredecessors方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: createLinearSegment
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);
}
}示例2: calculateDownForces
void BalanceGraph::calculateDownForces()
{
for(Segment* segment : segments) {
AbstractNode* head = segment->nodes.first();
if (head->getPredecessors().isEmpty()) {
segment->dForce = 0;
} else {
qreal sum = 0;
for(AbstractNode* pred : head->getPredecessors()) {
sum += pred->getOutport().x() - head->getInport().x();
}
segment->dForce = (double) (sum / head->getPredecessors().size());
}
}
}