Struct algorithm_rs::graph::euler_tour::EulerTour

pub struct EulerTour { /* private fields */ }

Implementations

impl EulerTour

pub fn new(n: usize, graph: Graph) -> Self

pub fn traverse(&mut self, root: usize) -> (&[usize], &[usize])

Euler tour entrypoint that returns two vectors (&l, &r). Note that timestamp starts from 1.

• l: vector indicates the timestamp that visits a node u at the first time.
• r: vector indicates the timestamp that visits a node u at the last time.