Struct competitive_programming_rs::graph::re_rooting::ReRooting

pub struct ReRooting<T, Identity, Merge, AddRoot> { /* fields omitted */ }

Implementations

impl<T, Identity, Merge, AddRoot> ReRooting<T, Identity, Merge, AddRoot> where
    T: Clone,
    Identity: Fn() -> T,
    Merge: Fn(T, T) -> T,
    AddRoot: Fn(T) -> T, 

pub fn new(
    n: usize,
    identity: Identity,
    merge: Merge,
    add_root: AddRoot
) -> Self

pub fn add_edge(&mut self, a: usize, b: usize)

pub fn build(&mut self)