Linkgraph: Split demand annotations from edge flow annotations
Use sparse storage format for demand annotations
This commit is contained in:
@@ -24,7 +24,7 @@ protected:
|
||||
template<class Tannotation, class Tedge_iterator>
|
||||
void Dijkstra(NodeID from, PathVector &paths);
|
||||
|
||||
uint PushFlow(AnnoEdge &edge, Path *path, uint min_step_size, uint accuracy, uint max_saturation);
|
||||
uint PushFlow(DemandAnnotation &anno, Path *path, uint min_step_size, uint accuracy, uint max_saturation);
|
||||
|
||||
void CleanupPaths(NodeID source, PathVector &paths);
|
||||
|
||||
|
Reference in New Issue
Block a user