Searched defs:EId (Results 1 – 4 of 4) sorted by relevance
74 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()208 EdgeId EId = 0; in addConstructedEdge() local273 EdgeId findNextInUse(EdgeId EId) const { in findNextInUse()361 for (auto EId : edgeIds()) in setSolver() local415 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge() local440 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); in addEdgeBypassingCostAllocator() local508 void updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) { in updateEdgeCosts()523 const MatrixPtr& getEdgeCostsPtr(EdgeId EId) const { in getEdgeCostsPtr()[all …]
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1() local202 for (auto EId : G.adjEdgeIds(NId)) { in backpropagate() local
310 void handleAddEdge(EdgeId EId) { in handleAddEdge()315 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()322 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()328 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
428 C[K] = G.getEdgeCostsPtr(EId); in createInterferenceEdge() local 481 if (EId == G.invalidEdgeId()) { in apply() local 908 for (auto EId : edgeIds()) { dump() local 935 for (auto EId : edgeIds()) { printDot() local [all...]