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

Resolves maximum spanning tree bug when using Edgelist instead of Adjlist #2256

Merged
merged 5 commits into from
May 5, 2022

Conversation

betochimas
Copy link
Contributor

@betochimas betochimas commented Apr 28, 2022

This PR resolves #2251 , where minimum spanning tree and maximum spanning tree had different behaviors when using edge list data versus adjacency list data, specifically that a call to compute the adjacency list had to be made before running maximum spanning tree because of how weights were calculated. After adding a check to verify that the adjacency list was computed, examples for both mst algorithms were uncommented.

@betochimas betochimas requested a review from a team as a code owner April 28, 2022 23:02
@betochimas betochimas added bug Something isn't working 3 - Ready for Review non-breaking Non-breaking change labels Apr 28, 2022
@rlratzel
Copy link
Contributor

Can you add a test that 1) fails if the changes in this PR are not present, then 2) passes once the changes in this PR are added?

betochimas and others added 3 commits May 2, 2022 13:43
Rename primitive functions + Move pylibcugraph APIs out of experimental + Python code cleanup
@rlratzel
Copy link
Contributor

rlratzel commented May 5, 2022

@gpucibot merge

@rapids-bot rapids-bot bot merged commit 3506893 into rapidsai:branch-22.06 May 5, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
bug Something isn't working non-breaking Non-breaking change
Projects
None yet
Development

Successfully merging this pull request may close these issues.

[BUG] Maximum spanning tree fails when loading data from an edgelist
2 participants