Struct EvolvingGraph 

pub struct EvolvingGraph {
    pub history: Vec<(f64, GraphChange)>,
    pub current_time: f64,
    /* private fields */
}

A graph that evolves over time through a sequence of explicit changes.

Internally the current state is maintained for O(1) queries; the full history is kept so that state_at can reconstruct any past configuration.

Fields

history: Vec<(f64, GraphChange)>

Chronological log of (timestamp, change) pairs.

current_time: f64

Timestamp of the most recent change applied.

Implementations

impl EvolvingGraph

pub fn new() -> Self

Create an empty evolving graph.

pub fn apply_change(&mut self, time: f64, change: GraphChange)

Apply a change at the given timestamp, updating internal state and history.

pub fn n_nodes(&self) -> usize

Number of nodes in the current state.

pub fn n_edges(&self) -> usize

Number of edges in the current state.

pub fn has_node(&self, n: usize) -> bool

Whether node n exists in the current state.

pub fn has_edge(&self, u: usize, v: usize) -> bool

Whether an edge between u and v exists in the current state.

pub fn edge_weight(&self, u: usize, v: usize) -> Option<f64>

Weight of the edge between u and v, if it exists.

pub fn node_attribute(&self, n: usize, attr: &str) -> Option<f64>

Get the value of attribute attr on node n, if set.

pub fn state_at(&self, target_time: f64) -> Self

Reconstruct the graph state at target_time by replaying history.

Only changes with timestamp <= target_time are applied.

pub fn nodes(&self) -> impl Iterator<Item = usize> + '_

Iterator over all current node identifiers (unordered).

pub fn edges_iter(&self) -> impl Iterator<Item = (usize, usize, f64)> + '_

Iterator over all current edges: (u, v, weight).

Trait Implementations

impl Default for EvolvingGraph

fn default() -> Self

Returns the “default value” for a type.