cugraph
cugraph copied to clipboard
cuGraph - RAPIDS Graph Analytics Library
Partially addresses #2479 Code clean-up before adding `edge_property_t` and `update_edge_property` (to support edge property in addition to edge weights). - [x] Split `edge_partition_src_dst_property.cuh` to `edge_src_dst_property.hpp` (can be complied with g++)...
This PR defines a uniform random walk implementation using the neighborhood sampling functions. This will be refactored once the new sampling primitive (https://github.com/rapidsai/cugraph/issues/2580) is implemented, but should provide a stronger...
Partially address https://github.com/rapidsai/cugraph/issues/2580 Update vertex_frontier_t to take unsorted input (tagged-)vertex list with possible duplicates. This will be used to define a selection primitive. The primitive needs to take a (tagged-)vertex...
#2485 API definition for Leiden C++ Implementation
Use neighborhood sampling as the algorithm for a round of performance tuning on this primitive. Blocked by https://github.com/rapidsai/cugraph/issues/2581
Update the Random Walks implementation to use the new selection primitive. Blocked by https://github.com/rapidsai/cugraph/issues/2580
Modify Neighborhood sampling implementation to use the new selection primitive. Blocked by https://github.com/rapidsai/cugraph/issues/2580
Create new Selection primitive for use by Neighbor sampling and Random walks.
Provide support in python for creating an edge with both edge id and weight. Blocked by https://github.com/rapidsai/cugraph/issues/2576 to start work. Blocked by https://github.com/rapidsai/cugraph/issues/2575 to finish work.
Create C++ API for creating graph with multiple edge properties. Only edge id and weight will be supported initially, but the C++ API could include support for more complex structures.