diff options
| author | Jonathan G Rennison <j.g.rennison@gmail.com> | 2019-10-06 17:02:38 +0100 |
|---|---|---|
| committer | Niels Martin Hansen <nielsm@indvikleren.dk> | 2020-01-08 22:49:53 +0100 |
| commit | 6e7117e04c740be951a3dcc81aeda716569fa013 (patch) | |
| tree | 8beca11c11790ecadf36c282bb6024c8d26c8b6e /src/cheat.cpp | |
| parent | 190e074287c76a9332ab1e3632aff037a6d09675 (diff) | |
| download | openttd-6e7117e04c740be951a3dcc81aeda716569fa013.tar.xz | |
Codechange: [Linkgraph] Skip MCF source node Dijkstra when all demand satisfied
MCF Dijkstra iterations are executed for all source nodes in a round-robin order.
Source nodes typically require different numbers of MCF Dijkstra iterations
to satisfy all of their demand.
This change is to avoid performing MCF Dijkstra iterations on source nodes which
have already been fully satisfied.
Diffstat (limited to 'src/cheat.cpp')
0 files changed, 0 insertions, 0 deletions