-
Notifications
You must be signed in to change notification settings - Fork 333
Pull requests: rapidsai/cugraph
Author
Label
Projects
Milestones
Reviews
Assignee
Sort
Pull requests list
Allows Dataset method Improvement / enhancement to an existing function
non-breaking
Non-breaking change
python
get_edgelist()
to be called on a CPU-only system
improvement
#5196
opened Jul 29, 2025 by
rlratzel
Loading…
cugraph RAPIDS dependency now use the new rapids-cmake branch info
CMake
cuGraph
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
#5195
opened Jul 28, 2025 by
robertmaynard
Loading…
Implement multisource BFS for betweenness centrality
cuGraph
#5192
opened Jul 24, 2025 by
HowardHuang1
•
Draft
Temporal Graph Construction C API
cuGraph
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
python
#5161
opened Jul 16, 2025 by
ChuckHastings
Loading…
Improve compile time and binary size... round 1
breaking
Breaking change
ci
CMake
cuGraph
DO NOT MERGE
Hold off on merging; see PR for details
improvement
Improvement / enhancement to an existing function
python
#5050
opened Apr 25, 2025 by
ChuckHastings
Loading…
Replace Hold off on merging; see PR for details
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
Thrust
sequential algorithms with libcu++
ones
cuGraph
DO NOT MERGE
[DO NOT MERGE] Experiment to leverage CUDASTF
CMake
cuGraph
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
PR to Test On-Demand MNMG Workflow
DO NOT MERGE
Hold off on merging; see PR for details
graph-devops
Issues for the graph-devops team
Compute shortest paths using Bellman-Ford algorithm.
CMake
cuGraph
feature request
New feature or request
non-breaking
Non-breaking change
ProTip!
Updated in the last three days: updated:>2025-07-27.