Codechange: [Linkgraph] Split annotation for demand between nodes from the edge annotations.

This commit is contained in:
Michael Lutz
2023-01-02 01:06:31 +01:00
parent 564de01d66
commit 8f851ead70
4 changed files with 55 additions and 55 deletions

View File

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