fast-path for initialisation of Graph for adjacency that is known to be sorted #2299
Job | Run time |
---|---|
6m 2s | |
3m 45s | |
5m 10s | |
7m 49s | |
6m 29s | |
5m 43s | |
18m 52s | |
13m 20s | |
1h 7m 10s |
Job | Run time |
---|---|
6m 2s | |
3m 45s | |
5m 10s | |
7m 49s | |
6m 29s | |
5m 43s | |
18m 52s | |
13m 20s | |
1h 7m 10s |