-
Notifications
You must be signed in to change notification settings - Fork 334
Pull requests: rapidsai/cugraph
Author
Label
Projects
Milestones
Reviews
Assignee
Sort
Pull requests list
WIP: Build and test with CUDA 13.0.0
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
Temporal Sampling C API
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
#5232
opened Aug 16, 2025 by
ChuckHastings
Loading…
removing change blocks and some diagram improvements
doc
Documentation
non-breaking
Non-breaking change
Notebook
#5231
opened Aug 15, 2025 by
acostadon
Loading…
ForceAtlas2 - support for prevent_overlapping and mobility
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
#5213
opened Aug 5, 2025 by
MathisHammel
Loading…
Concurrent multisource backwardpass
improvement
Improvement / enhancement to an existing function
non-breaking
Non-breaking change
#5206
opened Aug 4, 2025 by
HowardHuang1
Loading…
cleanup and dropping NX
breaking
Breaking change
improvement
Improvement / enhancement to an existing function
python
#5194
opened Jul 28, 2025 by
BradReesWork
Loading…
Implement multisource BFS for betweenness centrality
cuGraph
#5192
opened Jul 24, 2025 by
HowardHuang1
•
Draft
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!
Follow long discussions with comments:>50.