forked from rapidsai/cugraph
-
Notifications
You must be signed in to change notification settings - Fork 0
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
Merge latest branch-0.18 #38
Merged
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…scipyinputsupport
…scipyinputsupport
…nd updates to support better build-all behavior with flags and optional non-default build dirs.
…scipyinputsupport
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
[REVIEW] FEA SciPy sparse matrix input support for WCC, SCC, SSSP, and BFS
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
[REVIEW] FIX Move codecov upload to gpu build script
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
Update the README with new algorithms and multi-gpu status Also cleaned up a few other stops Authors: - BradReesWork <[email protected]> Approvers: - Alex Fender - Alex Fender URL: #1281
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
Authors: - Alex Fender <[email protected]> Approvers: - Brad Rees URL: #1289
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
Authors: - divyegala <[email protected]> Approvers: - Alex Fender URL: #1293
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
Adds the ability to get the length/cost of path from source to destination(s). Closely follows [`networkx.shortest_path_length`](https://networkx.org/documentation/latest/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path_length.html#networkx.algorithms.shortest_paths.generic.shortest_path_length). Similarities: 1) Takes an optional target vertex 2) If only source is provided, a `cudf` dataframe is returned with columns: `[vertex, distance]` (similar to `networkx` dictionary return) 3) If source and target are specified the exact length is returned or `sys.float_info.max` if the vertex is not reachable. Differences: 1) Requires that source be provided, as apposed to `networkx` 2) Nethod of graph traversal is not an option. Fixes: 1) Fixes #806 2) `sssp` and `cugraph.Graph.has_node` vertex checks. Added support for checking for vertexes that are not apart of the graph. in the past, `TypeError` was raised when doing a comparison check (as apposed to `ValueError`) Authors: - John Purviance <[email protected]> - BradReesWork <[email protected]> Approvers: - Alex Fender URL: #1278
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
[REVIEW] BUG Update weights check in bc and graph prims wrappers
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
aschaffer <- release