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.

Sign up for GitHub

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

Jump to bottom

Edge Triangle Counts in chunks #4370

Closed

ChuckHastings opened this issue Apr 24, 2024 · 0 comments · Fixed by #4382

Assignees

Collaborator

ChuckHastings commented Apr 24, 2024 •

edited by jnke2016

Loading

Neighbor intersection can be a memory intensive operation especially when intersecting high degree vertices.

Perform neighbor intersection in chunks

ChuckHastings assigned jnke2016

jnke2016 mentioned this issue

Move edge triangle count to the stable API #4382

Merged

rapids-bot bot closed this as completed in #4382

rapids-bot bot pushed a commit that referenced this issue


          Move edge triangle count to the stable API (#4382)

1c3f3a8

This PR

1. Performs edge triangle count in chunk
2. Enables k - 1 core optimization
3. Add C++ tests for edge triangle count
4. Move edge triangle count to the stable API
5. Implement MG edge triangle count and add tests
6. Update 'mg_graph_to_sg_graph' to support 'edge_ids' along with tests

closes #4370
closes #4371

Authors:
  - Joseph Nke (https://github.com/jnke2016)
  - Rick Ratzel (https://github.com/rlratzel)

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

URL: #4382

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment