|
aegisgraph
A high-performance, secure C++ graph library using adjacency lists
|
Class for performing hardware-efficient random walks on graphs. More...
#include <RandomWalker.hpp>
Public Member Functions | |
| RandomWalker () | |
| Constructor that seeds both PCG and Xoshiro generators using high entropy sources. | |
| 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. | |
Class for performing hardware-efficient random walks on graphs.
| std::vector< std::vector< int > > RandomWalker::random_walk | ( | const Graph & | graph, |
| int | start_node, | ||
| int | walk_length, | ||
| int | num_walks | ||
| ) |
Generate random walks from a starting node.
This function performs multiple random walks of fixed length from a given start node, using hardware-aware pseudorandom number generators to ensure reproducibility and efficiency.
| graph | The graph to walk on. |
| start_node | The node to start walks from. |
| walk_length | Number of steps per walk. |
| num_walks | Number of walks to generate. |