Linkgraph: Dynamically adjust accuracy parameters in MCF 1st pass

For larger graphs (>= 50 nodes), reduce the accuracy and set a
minimum push flow threshold.
This avoids wasting a lot of time calculating very small flow demand
increments when the total number of demands is high and most demands
are small already.
This commit is contained in:
Jonathan G Rennison
2022-12-07 02:24:17 +00:00
parent 351090ae7f
commit ad815210ae
2 changed files with 26 additions and 6 deletions

View File

@@ -24,7 +24,7 @@ protected:
template<class Tannotation, class Tedge_iterator>
void Dijkstra(NodeID from, PathVector &paths);
uint PushFlow(AnnoEdge &edge, Path *path, uint accuracy, uint max_saturation);
uint PushFlow(AnnoEdge &edge, Path *path, uint min_step_size, uint accuracy, uint max_saturation);
void CleanupPaths(NodeID source, PathVector &paths);