Skip to content

Increase maximum number of base graph edges for edge-based CH#3010

Merged
easbar merged 5 commits intomasterfrom
ch_edge_key_limit
May 16, 2024
Merged

Increase maximum number of base graph edges for edge-based CH#3010
easbar merged 5 commits intomasterfrom
ch_edge_key_limit

Conversation

@easbar
Copy link
Member

@easbar easbar commented May 16, 2024

So far we weren't able to run the edge-based CH preparation for graphs with more than 536mio edges. With this PR the limit is 1037mio. This is because we are storing edge keys in the preparation graph (twice as many as there are edges) and we are not using the negative range for the edge keys yet.

@easbar easbar added this to the 10.0 milestone May 16, 2024
Comment on lines +829 to +830
toNodesAndFwdFlags.add(getIntWithFlag(to, fwd));
keysAndBwdFlags.add(getIntWithFlag(GHUtility.createEdgeKey(edge, false), bwd));
Copy link
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Storing one access flag with the nodes and one with the edges has no disadvantage memory-wise, because we do not use the 32nd bit anyway (we use only positive nodes and edge keys).

@easbar easbar merged commit 78c6743 into master May 16, 2024
@easbar easbar deleted the ch_edge_key_limit branch May 16, 2024 13:33
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant