Commit Graph

6 Commits (b089b561a5bf1774dcb9a15b31fbb3a461c4f07f)

Author SHA1 Message Date
Jonathan G Rennison 8f123589ec Linkgraph: Use sparse storage format for edge annotations
Copy relevant parts of base edge into edge annotation
2 years ago
Jonathan G Rennison 55473bc730 Linkgraph: Split demand annotations from edge flow annotations
Use sparse storage format for demand annotations
2 years ago
Jonathan G Rennison ad815210ae 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.
2 years ago
Jonathan G Rennison e647075870 Change LinkGraph::EdgeMatrix to a sparse storage format
Use a btree_map instead of a SmallMatrix.
This avoids excessive storage requirements for large graphs,
and overly expensive edge matrix resize operations.
Remove next_edge iteration mechanism.
2 years ago
Jonathan G Rennison b14e213bd9 Add average travel time to the link graph overlay tooltip 2 years ago
fonsinchen 1cc410f7bb (svn r25356) -Add: Multi-Commodity-Flow solver for link graph 11 years ago