Lines Matching full:costs
179 // costs. in addIntraChainConstraint()
185 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
192 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
194 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
197 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
217 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
219 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
220 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
228 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
229 costs[i + 1][j + 1] = sameParityMax + 1.0; in addIntraChainConstraint()
232 G.updateEdgeCosts(edge, std::move(costs)); in addIntraChainConstraint()
284 PBQP::Matrix costs(G.getEdgeCosts(edge)); in addInterChainConstraint() local
294 if (costs[i + 1][j + 1] != in addInterChainConstraint()
296 costs[i + 1][j + 1] > sameParityMax) in addInterChainConstraint()
297 sameParityMax = costs[i + 1][j + 1]; in addInterChainConstraint()
305 if (sameParityMax > costs[i + 1][j + 1]) in addInterChainConstraint()
306 costs[i + 1][j + 1] = sameParityMax + 1.0; in addInterChainConstraint()
309 G.updateEdgeCosts(edge, std::move(costs)); in addInterChainConstraint()