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

Forward-merge branch-25.04 into branch-25.06 #4996

Merged
merged 1 commit into from
Mar 20, 2025
Merged

Conversation

rapids-bot[bot]
Copy link

@rapids-bot rapids-bot bot commented Mar 20, 2025

Forward-merge triggered by push to branch-25.04 that creates a PR to keep branch-25.06 up-to-date. If this PR is unable to be immediately merged due to conflicts, it will remain open for the team to manually merge. See forward-merger docs for more info.

If there exists a high degree vertex, run BFS from the highest degree vertex first to possibly find the largest connected component in the graph. BFS uses a visited flag (1 bit) instead of component ID (sizeof(vertex_t)) to store edge end point (src or dst) properties; thus use less memory.

Then, we can create a smaller graph just extracting edges with unvisited endpoints.

Authors:
  - Seunghwa Kang (https://github.com/seunghwak)

Approvers:
  - Chuck Hastings (https://github.com/ChuckHastings)

URL: #4990
@rapids-bot rapids-bot bot requested a review from a team as a code owner March 20, 2025 16:56
@GPUtester GPUtester merged commit 1a0da4b into branch-25.06 Mar 20, 2025
1 check passed
Copy link
Author

rapids-bot bot commented Mar 20, 2025

SUCCESS - forward-merge complete.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants