Home | History | Annotate | Download | only in Heuristics

Lines Matching refs:getGraph

62           : s(&s), g(&s.getGraph()) {}
184         Graph &g = getGraph();
191           subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr));
193           subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr));
214         Graph &g = getGraph();
313         Matrix &eCosts = getGraph().getEdgeCosts(eItr);
361         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
363         bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr);
388         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
390         bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr);
407         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
417         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
420         const Vector& nCosts = getGraph().getNodeCosts(nItr);
450           Graph::NodeItr ynItr = getGraph().getEdgeOtherNode(*aeItr, xnItr);