Searched refs:getEdgeNode1 (Results 1 – 4 of 4) sorted by relevance
166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in removeSolverEdge()248 if (xnItr == g.getEdgeNode1(eItr)) { in applyR1()262 Graph::NodeItr ynItr = g.getEdgeNode1(eItr); in applyR1()300 bool flipEdge1 = (g.getEdgeNode1(yxeItr) == xnItr), in applyR2()301 flipEdge2 = (g.getEdgeNode1(zxeItr) == xnItr); in applyR2()345 if (ynItr == g.getEdgeNode1(yzeItr)) { in applyR2()404 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in addSolverEdge()454 if (g.getEdgeNode1(eItr) == nItr) { in disconnectTrivialNodes()460 Graph::NodeItr otherNodeItr = g.getEdgeNode1(eItr); in disconnectTrivialNodes()508 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eItr)), in tryNormaliseEdgeMatrix()[all …]
282 NodeItr getEdgeNode1(EdgeItr eItr) { in getEdgeNode1() function313 if ((getEdgeNode1(*aeItr) == n2Itr) || in findEdge()372 os << " node" << getEdgeNode1(edgeItr) in printDot()
186 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), in preUpdateEdgeCosts()192 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr)); in preUpdateEdgeCosts()216 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), in handleAddEdge()364 bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr); in addEdgeContributions()391 bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr); in subtractEdgeContributions()
405 if (g.getEdgeNode1(edge) == node2) { in build()