Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Faster shortest_path #18

Open
wants to merge 2 commits into
base: branch-24.12
Choose a base branch
from

Conversation

eriknw
Copy link
Contributor

@eriknw eriknw commented Nov 8, 2024

Closes https://github.com/rapidsai/graph_dl/issues/631

For larger graphs, nearly all the time is spent creating dicts of lists of paths. This PR delays creating the lists of paths by duck-typing the return object and returning a Mapping that computes paths as needed. There is virtually no performance penalty for this, and a huge performance gain by delaying computation.

Moved from here: rapidsai/cugraph#4739

For larger graphs, nearly all the time is spent creating dicts of lists of paths.
This PR delays creating the lists of paths by duck-typing the return object
and returning a Mapping that computes paths as needed. There is virtually no
performance penalty for this, and a huge performance gain by delaying computation.
@eriknw eriknw added improvement Improves an existing functionality non-breaking Introduces a non-breaking change python labels Nov 8, 2024
@github-actions github-actions bot added benchmarks and removed python labels Nov 8, 2024
@nv-rliu nv-rliu requested review from rlratzel and nv-rliu and removed request for nv-rliu November 13, 2024 22:06
@eriknw eriknw added this to the 24.12 milestone Nov 19, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
benchmarks improvement Improves an existing functionality non-breaking Introduces a non-breaking change
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant