Lines Matching refs:costs
191 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
198 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
200 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
213 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
223 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
225 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
226 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
234 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
235 costs[i + 1][j + 1] = sameParityMax + 1.0; in addIntraChainConstraint()
238 G.updateEdgeCosts(edge, std::move(costs)); in addIntraChainConstraint()
290 PBQP::Matrix costs(G.getEdgeCosts(edge)); in addInterChainConstraint() local
300 if (costs[i + 1][j + 1] != in addInterChainConstraint()
302 costs[i + 1][j + 1] > sameParityMax) in addInterChainConstraint()
303 sameParityMax = costs[i + 1][j + 1]; in addInterChainConstraint()
311 if (sameParityMax > costs[i + 1][j + 1]) in addInterChainConstraint()
312 costs[i + 1][j + 1] = sameParityMax + 1.0; in addInterChainConstraint()
315 G.updateEdgeCosts(edge, std::move(costs)); in addInterChainConstraint()