node2vec_walk

scirs2_graph::algorithms::random_walk

Function node2vec_walk 

Source 
pub fn node2vec_walk<N, E, Ix>(
    graph: &Graph<N, E, Ix>,
    start: &N,
    walk_length: usize,
    p: f64,
    q: f64,
    rng: &mut impl Rng,
) -> Result<Vec<N>>
where
    N: Node + Clone + Hash + Eq + Debug,
    E: EdgeWeight + Into<f64>,
    Ix: IndexType,
Expand description

Node2Vec biased random walk with SIMD optimizations Implements the p and q parameters for controlling exploration vs exploitation