Function random_walks_node2vec 

pub fn random_walks_node2vec(
    graph: &Graph,
    weights: Option<&[f64]>,
    mode: DijkstraMode,
    walks_per_vertex: u32,
    walk_length: u32,
    p: f64,
    q: f64,
    seed: u64,
) -> IgraphResult<Vec<Vec<VertexId>>>

Generate multiple Node2Vec random walks from every vertex.

Same as random_walks but uses second-order biased walks with parameters p (return) and q (in-out). See random_walk_node2vec for details on the bias.

Parameters

• p — Return parameter (higher = less backtracking).
• q — In-out parameter (higher = more BFS-like).
• Other parameters as in random_walks.

Examples

use rust_igraph::{Graph, random_walks_node2vec, DijkstraMode};

let g = Graph::from_edges(
    &[(0,1),(1,2),(2,3),(3,0),(0,2)], false, Some(4)
).unwrap();
let corpus = random_walks_node2vec(
    &g, None, DijkstraMode::Out, 2, 5, 1.0, 1.0, 42
).unwrap();
assert_eq!(corpus.len(), 8); // 4 vertices * 2 walks