Struct TemporalGraph 

pub struct TemporalGraph {
    pub nodes: usize,
    pub edges: Vec<TemporalEdge>,
    /* private fields */
}

Temporal graph in the stream-of-interactions model.

Stores a sorted sequence of TemporalEdge contacts; nodes are identified by consecutive usize indices 0..nodes.

Example

use scirs2_graph::temporal::TemporalGraph;
use scirs2_graph::temporal::TemporalEdge;

let mut tg = TemporalGraph::new(4);
tg.add_edge(TemporalEdge::new(0, 1, 1.0));
tg.add_edge(TemporalEdge::new(1, 2, 2.0));
tg.add_edge(TemporalEdge::new(2, 3, 3.0));

// Static snapshot of interactions in [0.5, 2.5)
let snap = tg.snapshot(0.5, 2.5);
assert!(snap.edge_count() >= 1);

Fields

nodes: usize

Total number of nodes (fixed at construction; node indices are 0..nodes)

edges: Vec<TemporalEdge>

Edge stream, sorted by timestamp

Implementations

impl TemporalGraph

pub fn new(n_nodes: usize) -> Self

Create an empty temporal graph with n_nodes nodes.

pub fn add_edge(&mut self, edge: TemporalEdge)

Add a temporal edge. The internal list is lazily re-sorted when queried.

pub fn time_ordered_edges(&mut self) -> &[TemporalEdge]

Return all edges in sorted order.

pub fn edges_slice(&self) -> &[TemporalEdge]

Borrow edges without sorting (useful if you know they are already sorted).

pub fn edges_in_window(&mut self, start: f64, end: f64) -> &[TemporalEdge]

Return edges in the half-open window [start, end).

pub fn snapshot(&mut self, start: f64, end: f64) -> Graph<usize, f64>

Build a static undirected snapshot for the window [start, end).

Repeated contacts between the same pair of nodes accumulate weights. The returned Graph<usize, f64> contains only nodes that appear in at least one edge within the window.

pub fn aggregate_graph(&mut self) -> Graph<usize, f64>

Collapse all temporal contacts into a static undirected weighted graph by summing contact weights over all time.

pub fn temporal_neighbors( &mut self, node: usize, t_start: f64, t_end: f64, ) -> Vec<(usize, f64)>

Return all neighbors of node contacted in [t_start, t_end).

Returns (neighbor_id, earliest_contact_time) pairs (undirected semantics).

pub fn foremost_path( &mut self, source: usize, target: usize, t_start: f64, t_end: f64, ) -> Option<Vec<usize>>

Find a time-respecting foremost (earliest-arrival) path from source to target using only contacts in [t_start, t_end).

Returns None when no such path exists.

pub fn n_edges(&self) -> usize

Number of temporal contacts stored.

Trait Implementations

impl Clone for TemporalGraph

fn clone(&self) -> TemporalGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TemporalGraph

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

Formats the value using the given formatter.