Searched refs:eItr (Results 1 – 4 of 4) sorted by relevance
58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) { in addSolverEdge() argument60 return solverEdges.insert(solverEdges.end(), eItr); in addSolverEdge()137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) { in getHeuristicEdgeData() argument138 return getSolverEdgeData(eItr).getHeuristicData(); in getHeuristicEdgeData()164 void removeSolverEdge(Graph::EdgeItr eItr) { in removeSolverEdge() argument165 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()[all …]
114 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; } in getEdge() argument115 const EdgeEntry& getEdge(ConstEdgeItr eItr) const { return *eItr; } in getEdge() argument219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); } in getEdgeCosts() argument224 const Matrix& getEdgeCosts(ConstEdgeItr eItr) const { in getEdgeCosts() argument225 return getEdge(eItr).getCosts(); in getEdgeCosts()233 void setEdgeData(EdgeItr eItr, void *data) { getEdge(eItr).setData(data); } in setEdgeData() argument238 void* getEdgeData(EdgeItr eItr) { return getEdge(eItr).getData(); } in getEdgeData() argument282 NodeItr getEdgeNode1(EdgeItr eItr) { in getEdgeNode1() argument283 return getEdge(eItr).getNode1(); in getEdgeNode1()289 NodeItr getEdgeNode2(EdgeItr eItr) { in getEdgeNode2() argument[all …]
202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts() argument208 void postUpdateEdgeCostts(Graph::EdgeItr eItr) { in postUpdateEdgeCostts() argument214 void handleAddEdge(Graph::EdgeItr eItr) { in handleAddEdge() argument225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge() argument
184 void preUpdateEdgeCosts(Graph::EdgeItr eItr) { in preUpdateEdgeCosts() argument186 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), in preUpdateEdgeCosts()187 n2Itr = g.getEdgeNode2(eItr); in preUpdateEdgeCosts()192 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr)); in preUpdateEdgeCosts()194 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr)); in preUpdateEdgeCosts()196 EdgeData &ed = getHeuristicEdgeData(eItr); in preUpdateEdgeCosts()202 void postUpdateEdgeCosts(Graph::EdgeItr eItr) { in postUpdateEdgeCosts() argument205 handleAddEdge(eItr); in postUpdateEdgeCosts()214 void handleAddEdge(Graph::EdgeItr eItr) { in handleAddEdge() argument216 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), in handleAddEdge()[all …]