Searched refs:n2Itr (Results 1 – 2 of 2) sorted by relevance
51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()52 if (s->getSolverDegree(n1Itr) > s->getSolverDegree(n2Itr)) in operator()64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { in operator()66 const PBQP::Vector &cv2 = g->getNodeCosts(n2Itr); in operator()69 PBQPNum cost2 = cv2[0] / s->getSolverDegree(n2Itr); in operator()187 n2Itr = g.getEdgeNode2(eItr); in preUpdateEdgeCosts() local189 &n2 = getHeuristicNodeData(n2Itr); in preUpdateEdgeCosts()217 n2Itr = g.getEdgeNode2(eItr); in handleAddEdge() local219 &n2 = getHeuristicNodeData(n2Itr); in handleAddEdge()244 addEdgeContributions(eItr, n2Itr); in handleAddEdge()[all …]
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, in addEdge() argument179 getNodeCosts(n2Itr).getLength() == costs.getCols() && in addEdge()181 return addConstructedEdge(EdgeEntry(n1Itr, n2Itr, costs)); in addEdge()310 EdgeItr findEdge(NodeItr n1Itr, NodeItr n2Itr) { in findEdge() argument313 if ((getEdgeNode1(*aeItr) == n2Itr) || in findEdge()314 (getEdgeNode2(*aeItr) == n2Itr)) { in findEdge()