| 114 | } |
| 115 | |
| 116 | void ManipulateTableForNonRoundtripFS(const std::size_t source_id, |
| 117 | util::DistTableWrapper<EdgeDuration> &result_table) |
| 118 | { |
| 119 | // We can use the round-trip calculation to simulate non-round-trip fixed start |
| 120 | // by making all paths to the source location zero. Effectively finding an 'optimal' |
| 121 | // round-trip path that ignores the cost of getting back from any destination to the |
| 122 | // source. |
| 123 | for (const auto i : util::irange<size_t>(0, result_table.GetNumberOfNodes())) |
| 124 | { |
| 125 | result_table.SetValue(i, source_id, {0}); |
| 126 | } |
| 127 | } |
| 128 | |
| 129 | void ManipulateTableForNonRoundtripFE(const std::size_t destination_id, |
| 130 | util::DistTableWrapper<EdgeDuration> &result_table) |
no test coverage detected