77       AdjEdgeIdx addAdjEdgeId(EdgeId EId) {  in addAdjEdgeId()  argument
79         AdjEdgeIds.push_back(EId);  in addAdjEdgeId()
203     EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }  in getEdge()  argument
204     const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }  in getEdge()  argument
222       EdgeId EId = 0;  in addConstructedEdge()  local
224         EId = FreeEdgeIds.back();  in addConstructedEdge()
226         Edges[EId] = std::move(E);  in addConstructedEdge()
228         EId = Edges.size();  in addConstructedEdge()
232       EdgeEntry &NE = getEdge(EId);  in addConstructedEdge()
235       NE.connect(*this, EId);  in addConstructedEdge()
236       return EId;  in addConstructedEdge()
291       EdgeId findNextInUse(EdgeId EId) const {  in findNextInUse()  argument
292         while (EId < EndEId &&  in findNextInUse()
293                std::find(FreeEdgeIds.begin(), FreeEdgeIds.end(), EId) !=  in findNextInUse()
295           ++EId;  in findNextInUse()
297         return EId;  in findNextInUse()
368       for (auto EId : edgeIds())  in setSolver()  local
369         Solver->handleAddEdge(EId);  in setSolver()
422       EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts));  in addEdge()  local
424         Solver->handleAddEdge(EId);  in addEdge()
425       return EId;  in addEdge()
447       EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs));  in addEdgeBypassingCostAllocator()  local
449         Solver->handleAddEdge(EId);  in addEdgeBypassingCostAllocator()
450       return EId;  in addEdgeBypassingCostAllocator()
515     void updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) {  in updateEdgeCosts()  argument
518         Solver->handleUpdateCosts(EId, *AllocatedCosts);  in updateEdgeCosts()
519       getEdge(EId).Costs = AllocatedCosts;  in updateEdgeCosts()
530     const MatrixPtr& getEdgeCostsPtr(EdgeId EId) const {  in getEdgeCostsPtr()  argument
531       return getEdge(EId).Costs;  in getEdgeCostsPtr()
537     const Matrix& getEdgeCosts(EdgeId EId) const {  in getEdgeCosts()  argument
538       return *getEdge(EId).Costs;  in getEdgeCosts()
541     EdgeMetadata& getEdgeMetadata(EdgeId EId) {  in getEdgeMetadata()  argument
542       return getEdge(EId).Metadata;  in getEdgeMetadata()
545     const EdgeMetadata& getEdgeMetadata(EdgeId EId) const {  in getEdgeMetadata()  argument
546       return getEdge(EId).Metadata;  in getEdgeMetadata()
552     NodeId getEdgeNode1Id(EdgeId EId) const {  in getEdgeNode1Id()  argument
553       return getEdge(EId).getN1Id();  in getEdgeNode1Id()
559     NodeId getEdgeNode2Id(EdgeId EId) const {  in getEdgeNode2Id()  argument
560       return getEdge(EId).getN2Id();  in getEdgeNode2Id()
567     NodeId getEdgeOtherNodeId(EdgeId EId, NodeId NId) {  in getEdgeOtherNodeId()  argument
568       EdgeEntry &E = getEdge(EId);  in getEdgeOtherNodeId()
600         EdgeId EId = *AEItr;  in removeNode()  local
602         removeEdge(EId);  in removeNode()
632     void disconnectEdge(EdgeId EId, NodeId NId) {  in disconnectEdge()  argument
634         Solver->handleDisconnectEdge(EId, NId);  in disconnectEdge()
636       EdgeEntry &E = getEdge(EId);  in disconnectEdge()
651     void reconnectEdge(EdgeId EId, NodeId NId) {  in reconnectEdge()  argument
652       EdgeEntry &E = getEdge(EId);  in reconnectEdge()
653       E.connectTo(*this, EId, NId);  in reconnectEdge()
655         Solver->handleReconnectEdge(EId, NId);  in reconnectEdge()
660     void removeEdge(EdgeId EId) {  in removeEdge()  argument
662         Solver->handleRemoveEdge(EId);  in removeEdge()
663       EdgeEntry &E = getEdge(EId);  in removeEdge()
665       FreeEdgeIds.push_back(EId);  in removeEdge()
666       Edges[EId].invalidate();  in removeEdge()