Searched refs:N2Id (Results 1 – 2 of 2) sorted by relevance
102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument105 NIds[1] = N2Id; in EdgeEntry()371 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge() argument373 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()377 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge()484 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() argument486 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()487 (getEdgeNode2Id(AEId) == N2Id)) { in findEdge()599 NodeId N2Id = getEdgeNode2Id(EId); in dump() local600 assert(N1Id != N2Id && "PBQP graphs shound not have self-edges."); in dump()[all …]
202 NodeId N2Id = G.getEdgeNode2Id(EId); in handleSetEdgeCosts() local204 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); in handleSetEdgeCosts()207 N2Md.handleAddEdge(MMd, N2Id != G.getEdgeNode1Id(EId)); in handleSetEdgeCosts()331 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()333 PBQPNum N2SC = G.getNodeCosts(N2Id)[0] / G.getNodeDegree(N2Id); in operator()