Skip to content
GitLab
Explore
Sign in
Open
1
Merged
10
Closed
0
All
11
Recent searches
{{ formattedKey }}
{{ title }}
{{ help }}
{{name}}
@{{username}}
None
Any
{{name}}
@{{username}}
None
Any
{{name}}
@{{username}}
None
Any
{{name}}
@{{username}}
None
Any
{{name}}
@{{username}}
{{name}}
@{{username}}
None
Any
Upcoming
Started
{{title}}
None
Any
{{title}}
None
Any
{{title}}
None
Any
{{name}}
Yes
No
Yes
No
{{title}}
{{title}}
{{title}}
Created date
Add measurement to determine the earliest path in terms of node addition reaching each node.
!11
· created
Jun 17, 2022
by
Adam Reichold
updated
Jun 17, 2022
Print merged edges when aggregating graph to determine a rate.
!10
· created
Mar 29, 2022
by
Adam Reichold
Merged
updated
Mar 30, 2022
Handle extended data format which indicates node addition/removal
!9
· created
Feb 09, 2022
by
Adam Reichold
Merged
updated
Mar 08, 2022
Drop the unnecessary but confusing resolution parameter from the filter binary.
!8
· created
Feb 08, 2022
by
Adam Reichold
Merged
updated
Feb 09, 2022
Add binary to visualize single snapshot using Graphviz's DOT language.
!7
· created
Feb 03, 2022
by
Adam Reichold
Merged
2
updated
Feb 09, 2022
Track minimal path length instead of multiplicity during sparse unfolding.
!6
· created
Jan 26, 2022
by
Adam Reichold
Merged
updated
Feb 01, 2022
Add binary for post-hoc simulations of SIS epidemics
!5
· created
Jan 26, 2022
by
Adam Reichold
Merged
Approved
updated
Feb 01, 2022
Compute strongly connected components using unfolded accesibility graph.
!4
· created
Dec 15, 2021
by
Adam Reichold
Merged
4
updated
Jan 19, 2022
Filter edges and measure edge weights
!3
· created
Dec 15, 2021
by
Adam Reichold
Merged
updated
Jan 19, 2022
RFC: Use a dense representation for the unfolded graph to avoid unbounded memory consumption.
!2
· created
Dec 03, 2021
by
Adam Reichold
cmp-and-doc
Merged
1
Approved
updated
Dec 07, 2021
Improve usability
!1
· created
Dec 01, 2021
by
Adam Reichold
Merged
updated
Jan 19, 2022
