Lines Matching refs:eItr
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) { in addSolverEdge() argument
60 return solverEdges.insert(solverEdges.end(), eItr); in addSolverEdge()
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) { in getHeuristicEdgeData() argument
138 return getSolverEdgeData(eItr).getHeuristicData(); in getHeuristicEdgeData()
164 void removeSolverEdge(Graph::EdgeItr eItr) { in removeSolverEdge() argument
165 EdgeData &eData = getSolverEdgeData(eItr); in removeSolverEdge()
166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in removeSolverEdge()
167 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr)); in removeSolverEdge()
213 Graph::EdgeItr eItr(*aeItr); in setSolution()
214 Graph::NodeItr anItr(g.getEdgeOtherNode(eItr, nItr)); in setSolution()
215 getSolverNodeData(anItr).addSolverEdge(eItr); in setSolution()
242 Graph::EdgeItr eItr = *nd.solverEdgesBegin(); in applyR1() local
244 const Matrix &eCosts = g.getEdgeCosts(eItr); in applyR1()
248 if (xnItr == g.getEdgeNode1(eItr)) { in applyR1()
249 Graph::NodeItr ynItr = g.getEdgeNode2(eItr); in applyR1()
260 h.handleRemoveEdge(eItr, ynItr); in applyR1()
262 Graph::NodeItr ynItr = g.getEdgeNode1(eItr); in applyR1()
273 h.handleRemoveEdge(eItr, ynItr); in applyR1()
275 removeSolverEdge(eItr); in applyR1()
398 EdgeData& getSolverEdgeData(Graph::EdgeItr eItr) { in getSolverEdgeData() argument
399 return *static_cast<EdgeData*>(g.getEdgeData(eItr)); in getSolverEdgeData()
402 void addSolverEdge(Graph::EdgeItr eItr) { in addSolverEdge() argument
403 EdgeData &eData = getSolverEdgeData(eItr); in addSolverEdge()
404 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in addSolverEdge()
405 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr)); in addSolverEdge()
407 eData.setN1SolverEdgeItr(n1Data.addSolverEdge(eItr)); in addSolverEdge()
408 eData.setN2SolverEdgeItr(n2Data.addSolverEdge(eItr)); in addSolverEdge()
424 for (Graph::EdgeItr eItr = g.edgesBegin(), eEnd = g.edgesEnd(); in setup() local
425 eItr != eEnd; ++eItr) { in setup()
427 g.setEdgeData(eItr, &edgeDataList.back()); in setup()
428 addSolverEdge(eItr); in setup()
452 Graph::EdgeItr eItr = *aeItr; in disconnectTrivialNodes() local
454 if (g.getEdgeNode1(eItr) == nItr) { in disconnectTrivialNodes()
455 Graph::NodeItr otherNodeItr = g.getEdgeNode2(eItr); in disconnectTrivialNodes()
457 g.getEdgeCosts(eItr).getRowAsVector(0); in disconnectTrivialNodes()
460 Graph::NodeItr otherNodeItr = g.getEdgeNode1(eItr); in disconnectTrivialNodes()
462 g.getEdgeCosts(eItr).getColAsVector(0); in disconnectTrivialNodes()
465 edgesToRemove.push_back(eItr); in disconnectTrivialNodes()
483 for (Graph::EdgeItr eItr = g.edgesBegin(), eEnd = g.edgesEnd(); in eliminateIndependentEdges() local
484 eItr != eEnd; ++eItr) { in eliminateIndependentEdges()
485 edgesToProcess.push_back(eItr); in eliminateIndependentEdges()
495 bool tryToEliminateEdge(Graph::EdgeItr eItr) { in tryToEliminateEdge() argument
496 if (tryNormaliseEdgeMatrix(eItr)) { in tryToEliminateEdge()
497 g.removeEdge(eItr); in tryToEliminateEdge()
503 bool tryNormaliseEdgeMatrix(Graph::EdgeItr &eItr) { in tryNormaliseEdgeMatrix() argument
507 Matrix &edgeCosts = g.getEdgeCosts(eItr); in tryNormaliseEdgeMatrix()
508 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eItr)), in tryNormaliseEdgeMatrix()
509 &vCosts = g.getNodeCosts(g.getEdgeNode2(eItr)); in tryNormaliseEdgeMatrix()
568 Graph::EdgeItr eItr(*solvedEdgeItr); in computeSolution()
569 Matrix &edgeCosts = g.getEdgeCosts(eItr); in computeSolution()
571 if (nItr == g.getEdgeNode1(eItr)) { in computeSolution()
572 Graph::NodeItr adjNode(g.getEdgeNode2(eItr)); in computeSolution()
577 Graph::NodeItr adjNode(g.getEdgeNode1(eItr)); in computeSolution()