HomeSort by relevance Sort by last modified time
    Searched refs:edgeCosts (Results 1 - 2 of 2) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 507 Matrix &edgeCosts = g.getEdgeCosts(eItr);
511 for (unsigned r = 0; r < edgeCosts.getRows(); ++r) {
514 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) {
515 if (vCosts[c] != infinity && edgeCosts[r][c] < rowMin)
516 rowMin = edgeCosts[r][c];
522 edgeCosts.subFromRow(r, rowMin);
525 edgeCosts.setRow(r, 0);
529 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) {
532 for (unsigned r = 0; r < edgeCosts.getRows(); ++r) {
533 if (uCosts[r] != infinity && edgeCosts[r][c] < colMin
    [all...]
Graph.h 376 const Matrix &edgeCosts = getEdgeCosts(edgeItr);
378 for (unsigned i = 0; i < edgeCosts.getRows(); ++i) {
379 os << edgeCosts.getRowAsVector(i) << "\\n";

Completed in 102 milliseconds