Home | History | Annotate | Download | only in Heuristics

Lines Matching refs:getGraph

63           : s(&s), g(&s.getGraph()) {}
185         Graph &g = getGraph();
192           subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr));
194           subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr));
215         Graph &g = getGraph();
314         Matrix &eCosts = getGraph().getEdgeCosts(eItr);
362         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
364         bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr);
389         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
391         bool nIsNode1 = nItr == getGraph().getEdgeNode1(eItr);
408         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
418         unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
445           Graph::NodeItr ynItr = getGraph().getEdgeOtherNode(*aeItr, xnItr);