| 251 | |
| 252 | template<typename NodeType> |
| 253 | int Graph<NodeType>::insert_node(const NodeType& node) |
| 254 | { |
| 255 | const int id = current_id_++; |
| 256 | assert(!nodes_.contains(id)); |
| 257 | nodes_.insert(id, node); |
| 258 | edges_from_node_.insert(id, 0); |
| 259 | node_neighbors_.insert(id, std::vector<int>()); |
| 260 | return id; |
| 261 | } |
| 262 | |
| 263 | template<typename NodeType> |
| 264 | void Graph<NodeType>::erase_node(const int id) |