| 159 | |
| 160 | |
| 161 | void move(const Point_2& from, const Point_2& to) { |
| 162 | // @todo should check for intersections? |
| 163 | auto it = adjacency_list.find(from); |
| 164 | if (it != adjacency_list.end()) { |
| 165 | auto neighbours = it->second; |
| 166 | for (auto& n : neighbours) { |
| 167 | adjacency_list[n].erase(from); |
| 168 | adjacency_list[n].insert(to); |
| 169 | } |
| 170 | adjacency_list.erase(it); |
| 171 | adjacency_list.insert({ to, neighbours }); |
| 172 | } |
| 173 | } |
| 174 | |
| 175 | bool is_valid() const { |
| 176 | typedef CGAL::Box_intersection_d::Box_with_handle_d<double, 2, size_t, CGAL::Box_intersection_d::ID_EXPLICIT> Box; |
no test coverage detected