[][src]Struct competitive_programming_rs::graph::lca::LowestCommonAncestor

pub struct LowestCommonAncestor { /* fields omitted */ }

Methods

impl LowestCommonAncestor[src]

pub fn new(graph: &Vec<Vec<usize>>) -> Self[src]

pub fn get_lca(&self, u: usize, v: usize) -> usize[src]

pub fn get_dist(&self, u: usize, v: usize) -> usize[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.