reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
290 G.setSolver(*this); 293 S = backpropagate(G, reduce()); 294 G.unsetSolver(); 299 assert(G.getNodeCosts(NId).getLength() > 1 && 301 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); 301 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); 308 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); 309 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); 313 NodeMetadata& NMd = G.getNodeMetadata(NId); 314 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata(); 315 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); 320 NodeMetadata& NMd = G.getNodeMetadata(NId); 321 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata(); 322 NMd.handleAddEdge(MMd, NId == G.getEdgeNode2Id(EId)); 326 NodeId N1Id = G.getEdgeNode1Id(EId); 327 NodeId N2Id = G.getEdgeNode2Id(EId); 328 NodeMetadata& N1Md = G.getNodeMetadata(N1Id); 329 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); 330 bool Transpose = N1Id != G.getEdgeNode1Id(EId); 334 const MatrixMetadata& OldMMd = G.getEdgeCosts(EId).getMetadata(); 351 if (G.getNodeDegree(NId) == 3) { 363 switch (G.getNodeMetadata(NId).getReductionState()) { 389 G.getNodeMetadata(NId).setReductionState( 396 G.getNodeMetadata(NId).setReductionState( 403 G.getNodeMetadata(NId).setReductionState( 409 for (auto NId : G.nodeIds()) { 410 if (G.getNodeDegree(NId) < 3) 412 else if (G.getNodeMetadata(NId).isConservativelyAllocatable()) 426 assert(!G.empty() && "Cannot reduce empty graph."); 438 switch (G.getNodeDegree(NId)) { 442 applyR1(G, NId); 445 applyR2(G, NId); 460 G.disconnectAllNeighborsFromNode(NId); 465 SpillCostComparator(G)); 469 G.disconnectAllNeighborsFromNode(NId);