reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/CodeGen/PBQP/ReductionRules.h
   81     assert(G.getNodeDegree(NId) == 2 &&
   84     const Vector &XCosts = G.getNodeCosts(NId);
   86     typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin();
   90     NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId),
   91            ZNId = G.getEdgeOtherNodeId(ZXEId, NId);
   93     bool FlipEdge1 = (G.getEdgeNode1Id(YXEId) == NId),
   94          FlipEdge2 = (G.getEdgeNode1Id(ZXEId) == NId);
   97       new Matrix(G.getEdgeCosts(YXEId).transpose()) :
   98       &G.getEdgeCosts(YXEId);
  101       new Matrix(G.getEdgeCosts(ZXEId).transpose()) :
  102       &G.getEdgeCosts(ZXEId);
  129     EdgeId YZEId = G.findEdge(YNId, ZNId);
  131     if (YZEId == G.invalidEdgeId()) {
  132       YZEId = G.addEdge(YNId, ZNId, Delta);
  134       const Matrix &YZECosts = G.getEdgeCosts(YZEId);
  135       if (YNId == G.getEdgeNode1Id(YZEId)) {
  136         G.updateEdgeCosts(YZEId, Delta + YZECosts);
  138         G.updateEdgeCosts(YZEId, Delta.transpose() + YZECosts);
  142     G.disconnectEdge(YXEId, YNId);
  143     G.disconnectEdge(ZXEId, ZNId);