this is useful in general, but will also help with benchmarking (T1885) as passing edges=* we will be able to time "pure" graph traversal without having to add timing counters around int→type maps (doing so will probably cost more than the lookups themselves)
Description
Description
Revisions and Commits
Revisions and Commits
Status | Assigned | Task | ||
---|---|---|---|---|
Migrated | gitlab-migration | T1885 benchmark swh-graph use cases on the full graph | ||
Migrated | gitlab-migration | T1922 swh-graph optimization: bypass edge restriction checks when edges=* |