cugraph
cugraph copied to clipboard
Temporal sampling implementation
trafficstars
Temporal sampling implementation. Sampling considers the time stamp of edges, if we arrive at a vertex v with timestamp t1, then when we depart from that vertex to continue sampling we only consider edges that occur after time t1.
PR includes C++ implementation and tests.
This significantly increases C++ compile time. We'll address this during 25.08.