Unfolded Graph merge requestshttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests2022-03-30T12:44:41+02:00https://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/10Print merged edges when aggregating graph to determine a rate.2022-03-30T12:44:41+02:00Adam ReicholdPrint merged edges when aggregating graph to determine a rate.Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/9Handle extended data format which indicates node addition/removal2022-03-08T10:50:04+01:00Adam ReicholdHandle extended data format which indicates node addition/removalAlso adds another binary which uses the information to count the number of active nodes at or up to a given time.
Counterpart to ecoepi/sick-bees!142Also adds another binary which uses the information to count the number of active nodes at or up to a given time.
Counterpart to ecoepi/sick-bees!142Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/8Drop the unnecessary but confusing resolution parameter from the filter binary.2022-02-09T12:20:20+01:00Adam ReicholdDrop the unnecessary but confusing resolution parameter from the filter binary.Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/7Add binary to visualize single snapshot using Graphviz's DOT language.2022-02-09T12:18:43+01:00Adam ReicholdAdd binary to visualize single snapshot using Graphviz's DOT language.```
cargo run --release --bin dot -- 600 144 < temporal_network_3h.dat | dot -Tpdf > dot.pdf
``````
cargo run --release --bin dot -- 600 144 < temporal_network_3h.dat | dot -Tpdf > dot.pdf
```Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/6Track minimal path length instead of multiplicity during sparse unfolding.2022-02-01T13:05:45+01:00Adam ReicholdTrack minimal path length instead of multiplicity during sparse unfolding.Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/5Add binary for post-hoc simulations of SIS epidemics2022-02-01T13:05:12+01:00Adam ReicholdAdd binary for post-hoc simulations of SIS epidemicsAdam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/4Compute strongly connected components using unfolded accesibility graph.2022-01-19T17:01:15+01:00Adam ReicholdCompute strongly connected components using unfolded accesibility graph.Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/3Filter edges and measure edge weights2022-01-19T15:47:28+01:00Adam ReicholdFilter edges and measure edge weightsAdam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/1Improve usability2022-01-19T15:47:21+01:00Adam ReicholdImprove usability* Makes the resolution and upper aggregation time limit parameters configurable via command line arguments.
* Adds inline documentation to the library and the various programs.
* Adds a `cmp` program to check if two time-dependent graphs...* Makes the resolution and upper aggregation time limit parameters configurable via command line arguments.
* Adds inline documentation to the library and the various programs.
* Adds a `cmp` program to check if two time-dependent graphs are equal up to reordering of edges within snapshots.Adam ReicholdAdam Reicholdhttps://git.ufz.de/ecoepi/unfolded-graph/-/merge_requests/2RFC: Use a dense representation for the unfolded graph to avoid unbounded mem...2021-12-07T07:55:40+01:00Adam ReicholdRFC: Use a dense representation for the unfolded graph to avoid unbounded memory consumption.@buergerm Using a dense representation avoids the unbound increase in memory consumption as the path graph becomes more and more meshed even though it does imply a slow down in the beginning when that graph is still sparse. But at least ...@buergerm Using a dense representation avoids the unbound increase in memory consumption as the path graph becomes more and more meshed even though it does imply a slow down in the beginning when that graph is still sparse. But at least this would allow us to process the large graphs on notebook class hardware:
```
$ /usr/bin/time ./target/release/unfold 86400 <~/sick-bees/graph_lt060_dc03.bin
nodes = 93697
time,paths
0,333344
1,3402916
...
118,4824669195
119,4905467827
8549.55user 2.10system 17:59.91elapsed 791%CPU (0avgtext+0avgdata 13944812maxresident)k
0inputs+0outputs (0major+379933minor)pagefaults 0swaps
```Adam ReicholdAdam Reichold