Struct TemporalWalk 

pub struct TemporalWalk {
    pub steps: Vec<(usize, f64)>,
}

A single time-respecting random walk on a temporal graph.

Each step of the walk moves to a random neighbour via an edge whose timestamp is ≥ the timestamp of the edge used at the previous step. This ensures the walk is causal (it only traverses forward in time).

Fields

steps: Vec<(usize, f64)>

Ordered sequence of (node, edge_timestamp) pairs visited during the walk. The first entry is the starting node with timestamp -∞ (represented as f64::NEG_INFINITY).

Implementations

impl TemporalWalk

pub fn nodes(&self) -> Vec<usize>

Return the sequence of node IDs visited (including the starting node).

pub fn len(&self) -> usize

Return the length of the walk (number of edges traversed).

pub fn is_empty(&self) -> bool

Return true if the walk consists of only the starting node (no edges).

Trait Implementations

impl Clone for TemporalWalk

fn clone(&self) -> TemporalWalk

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TemporalWalk

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.