17 #ifndef RANDOM_WALKER_H
18 #define RANDOM_WALKER_H
21 #include <unordered_map>
49 std::vector<std::vector<int>>
random_walk(
const Graph& graph,
int start_node,
int walk_length,
int num_walks);
52 std::mt19937_64 pcg_engine;
53 uint64_t xoshiro_state[4];
64 uint64_t xoshiro_next();
High-performance, secure graph library using parallel adjacency lists.
Class for performing hardware-efficient random walks on graphs.
Definition RandomWalker.hpp:30
RandomWalker()
Constructor that seeds both PCG and Xoshiro generators using high entropy sources.
Definition RandomWalker.cpp:6
std::vector< std::vector< int > > random_walk(const Graph &graph, int start_node, int walk_length, int num_walks)
Generate random walks from a starting node.
Definition RandomWalker.cpp:39