| 84 | } |
| 85 | |
| 86 | std::map<NodeID, size_t> nextEdges(RestrictionGraph::EdgeRange edges) |
| 87 | { |
| 88 | std::map<NodeID, size_t> res; |
| 89 | std::transform(edges.begin(), |
| 90 | edges.end(), |
| 91 | std::inserter(res, res.end()), |
| 92 | [&](const auto &edge) |
| 93 | { return std::make_pair(edge.node_based_to, edge.target); }); |
| 94 | return res; |
| 95 | } |
| 96 | |
| 97 | std::map<NodeID, size_t> checkNode(const RestrictionGraph &graph, |
| 98 | const RestrictionID node_id, |