| 206 | } |
| 207 | |
| 208 | void Astar::reset() { |
| 209 | expanded_nodes_.clear(); |
| 210 | path_nodes_.clear(); |
| 211 | |
| 212 | std::priority_queue<NodePtr, std::vector<NodePtr>, NodeComparator0> empty_queue; |
| 213 | open_set_.swap(empty_queue); |
| 214 | for (int i = 0; i < use_node_num_; i++) { |
| 215 | NodePtr node = path_node_pool_[i]; |
| 216 | node->parent = NULL; |
| 217 | node->node_state = NOT_EXPAND; |
| 218 | } |
| 219 | use_node_num_ = 0; |
| 220 | iter_num_ = 0; |
| 221 | } |
| 222 | |
| 223 | std::vector<Eigen::Vector3d> Astar::getVisited() { |
| 224 | vector<Eigen::Vector3d> visited; |
no test coverage detected