| 230 | // State is what is going to be put in the priority queue. See the |
| 231 | // comment for FindPath for more information. |
| 232 | struct State |
| 233 | { |
| 234 | State(Vertex const & vertex, Weight const & distance, Weight const & heuristic) |
| 235 | : vertex(vertex) |
| 236 | , distance(distance) |
| 237 | , heuristic(heuristic) |
| 238 | {} |
| 239 | State(Vertex const & vertex, Weight const & distance) : State(vertex, distance, Weight()) {} |
| 240 | |
| 241 | inline bool operator>(State const & rhs) const { return distance > rhs.distance; } |
| 242 | |
| 243 | Vertex vertex; |
| 244 | Weight distance; |
| 245 | Weight heuristic; |
| 246 | }; |
| 247 | |
| 248 | // BidirectionalStepContext keeps all the information that is needed to |
| 249 | // search starting from one of the two directions. Its main |
no outgoing calls
no test coverage detected