| 70 | } |
| 71 | |
| 72 | void checkEdges(RestrictionGraph::EdgeRange edges, std::vector<NodeID> expected_edges) |
| 73 | { |
| 74 | std::vector<NodeID> actual_edges; |
| 75 | std::transform(edges.begin(), |
| 76 | edges.end(), |
| 77 | std::back_inserter(actual_edges), |
| 78 | [&](const auto &edge) { return edge.node_based_to; }); |
| 79 | std::sort(actual_edges.begin(), actual_edges.end(), std::less<NodeID>()); |
| 80 | std::sort(expected_edges.begin(), expected_edges.end(), std::less<NodeID>()); |
| 81 | |
| 82 | BOOST_REQUIRE_EQUAL_COLLECTIONS( |
| 83 | actual_edges.begin(), actual_edges.end(), expected_edges.begin(), expected_edges.end()); |
| 84 | } |
| 85 | |
| 86 | std::map<NodeID, size_t> nextEdges(RestrictionGraph::EdgeRange edges) |
| 87 | { |