cugraph
cugraph copied to clipboard
rapidsai
cuGraph - RAPIDS Graph Analytics Library
Have `black` format cugraph code. Other RAPIDS repos have done this using a pre-commit hook (as seen [here](https://github.com/rapidsai/cudf/pull/2160)). Things to consider: * making sure `git blame` still works as expected...
**Describe the solution you'd like and any additional context** Currently 74% of time of sample_neighbors in `gnn/graph_store.py` is spent in looking up `edge_ids`. If we provide edge_ids inside the uniform...
This will be needed for both the small and large-scale graph support in PG, and to ensure design changes produce the expected results (functional and performance) as early as possible....
The nightly MNMG test/benchmark runs include PG tests, but are not easily run by developers outside of the automated environment. This task is to get a developer set up to...
Use unit tests (initially disabled or calling stubbed out APIs in order to allow CI to pass) to define the cugraph python API for data masking.
Currently, a large number of cuGraph unit tests will construct NetworkX objects when comparing algorithm outputs. For example: ``` assert nx_n_components == cg_n_components assert nx_vertices == cg_vertices ``` This issue...
Milestone for #1348 Replace the Testing Util functions within the unit tests with new methods from the `datasets` API.
The python implementation of Louvain still uses the legacy implementation. There is already an SG and MG Louvain available in PLC (pylibcugraph). Existing tests should be sufficient, it should just...
The current renumbering performs cudf/dask_cudf merges for unrenumbering and re-renumbering. Single column renumbering can be optimized using local unrenumbering to make it faster instead of merge operation
Hello, I was wondering whether a [k-shortest path ](https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.simple_paths.shortest_simple_paths.html#networkx.algorithms.simple_paths.shortest_simple_paths) feature could be implemented for cuGraph. If you believe that this would not be very complicated I'm happy to give it...
