Searched refs:aeItr (Results 1 – 3 of 3) sorted by relevance
426 for (SolverEdgeItr aeItr = getSolver().solverEdgesBegin(nItr), in initializeNode() local428 aeItr != aeEnd; ++aeItr) { in initializeNode()430 Graph::EdgeItr eItr = *aeItr; in initializeNode()442 for (SolverEdgeItr aeItr = getSolver().solverEdgesBegin(xnItr), in handleRemoveNode() local444 aeItr != aeEnd; ++aeItr) { in handleRemoveNode()445 Graph::NodeItr ynItr = getGraph().getEdgeOtherNode(*aeItr, xnItr); in handleRemoveNode()446 handleRemoveEdge(*aeItr, ynItr); in handleRemoveNode()447 edgesToRemove.push_back(*aeItr); in handleRemoveNode()
210 for (Graph::AdjEdgeItr aeItr = g.adjEdgesBegin(nItr), in setSolution() local212 aeItr != aeEnd; ++aeItr) { in setSolution()213 Graph::EdgeItr eItr(*aeItr); in setSolution()293 SolverEdgeItr aeItr = nd.solverEdgesBegin(); in applyR2() local294 Graph::EdgeItr yxeItr = *aeItr, in applyR2()295 zxeItr = *(++aeItr); in applyR2()448 for (Graph::AdjEdgeItr aeItr = g.adjEdgesBegin(nItr), in disconnectTrivialNodes() local450 aeItr != aeEnd; ++aeItr) { in disconnectTrivialNodes()452 Graph::EdgeItr eItr = *aeItr; in disconnectTrivialNodes()
311 for (AdjEdgeItr aeItr = adjEdgesBegin(n1Itr), aeEnd = adjEdgesEnd(n1Itr); in findEdge() local312 aeItr != aeEnd; ++aeItr) { in findEdge()313 if ((getEdgeNode1(*aeItr) == n2Itr) || in findEdge()314 (getEdgeNode2(*aeItr) == n2Itr)) { in findEdge()315 return *aeItr; in findEdge()