Struct TemporalDijkstra 

pub struct TemporalDijkstra;

Dijkstra-style algorithms adapted for temporal (time-respecting) paths.

Implementations

impl TemporalDijkstra

pub fn earliest_arrival( src: usize, dst: usize, start_time: f64, edges: &[(usize, usize, f64, f64)], n_nodes: usize, ) -> Option<TemporalPath>

Find the earliest-arrival path from src to dst in a temporal graph.

Arguments

• src – source node id
• dst – destination node id
• start_time – earliest time the source may be departed
• edges – temporal edge list: (u, v, departure_time, travel_time)
• n_nodes – total number of nodes (node ids must be in 0..n_nodes)

Returns None when no time-respecting path exists.

pub fn latest_departure( src: usize, dst: usize, deadline: f64, edges: &[(usize, usize, f64, f64)], n_nodes: usize, ) -> Option<TemporalPath>

Find the latest-departure path that still arrives at dst by deadline.

Uses a time-reversed earliest-arrival search on a reversed graph.

pub fn fastest_path( src: usize, dst: usize, start_time: f64, edges: &[(usize, usize, f64, f64)], n_nodes: usize, ) -> Option<TemporalPath>

Find the fastest temporal path (minimises total elapsed duration).

The search extends the state space with the departure time so that we track (node, departure_time) pairs and minimise arrival - start_time.