summaryrefslogtreecommitdiff
path: root/src/station_func.h
diff options
context:
space:
mode:
authorNicolas Chappe <74881848+nchappe@users.noreply.github.com>2021-07-24 11:07:10 +0200
committerMichael Lutz <michi@icosahedron.de>2021-08-17 14:57:59 +0200
commit977604ef08212cc93653eaa8187ab64ebe72e7d2 (patch)
tree5aa86c084ebee29497147fa8008855acf572977b /src/station_func.h
parent6acf204d14343e67fdc01ae8c52044d0de20bbd2 (diff)
downloadopenttd-977604ef08212cc93653eaa8187ab64ebe72e7d2.tar.xz
Feature: [Linkgraph] Prioritize faster routes for passengers, mail and express cargo
Passengers usually prefer fast paths to short paths. Average travel times of links are updated in real-time for use in Dijkstra's algorithm, and newer travel times weigh more, just like capacities.
Diffstat (limited to 'src/station_func.h')
-rw-r--r--src/station_func.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/station_func.h b/src/station_func.h
index dc8942841..65b9ac5e6 100644
--- a/src/station_func.h
+++ b/src/station_func.h
@@ -52,8 +52,8 @@ void UpdateAirportsNoise();
bool SplitGroundSpriteForOverlay(const TileInfo *ti, SpriteID *ground, RailTrackOffset *overlay_offset);
-void IncreaseStats(Station *st, const Vehicle *v, StationID next_station_id);
-void IncreaseStats(Station *st, CargoID cargo, StationID next_station_id, uint capacity, uint usage, EdgeUpdateMode mode);
+void IncreaseStats(Station *st, const Vehicle *v, StationID next_station_id, uint32 time);
+void IncreaseStats(Station *st, CargoID cargo, StationID next_station_id, uint capacity, uint usage, uint32 time, EdgeUpdateMode mode);
void RerouteCargo(Station *st, CargoID c, StationID avoid, StationID avoid2);
/**