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

Merge latest branch-0.18 #38

Merged
merged 35 commits into from
Dec 9, 2020
Merged

Conversation

aschaffer
Copy link
Owner

aschaffer <- release

rlratzel and others added 30 commits November 19, 2020 15:24
…nd updates to support better build-all behavior with flags and optional non-default build dirs.
[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]
hlinsen and others added 5 commits December 4, 2020 15:01
[REVIEW] BUG Update weights check in bc and graph prims wrappers
[gpuCI] Auto-merge branch-0.17 to branch-0.18 [skip ci]
@aschaffer aschaffer merged commit a584e0b into aschaffer:branch-0.18 Dec 9, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

10 participants