Link graph: Use non-sparse matrix for accumulating demand totals

This commit is contained in:
Jonathan G Rennison
2024-01-23 01:30:39 +00:00
parent 5bd4e96347
commit 39e7a9252c
2 changed files with 25 additions and 18 deletions

View File

@@ -152,7 +152,8 @@ protected:
public:
btree::btree_map<std::pair<NodeID, NodeID>, uint> demand_map; ///< Demand map.
std::unique_ptr<uint[]> demand_matrix; ///< Demand matrix.
uint demand_matrix_count; ///< Count of non-zero entries in demand_matrix.
std::vector<DemandAnnotation> demand_annotation_store; ///< Demand annotation store.
DynUniformArenaAllocator path_allocator; ///< Arena allocator used for paths