Struct AdjacencyListGraph

Source

pub struct AdjacencyListGraph {
    pub vsize: usize,
    pub esize: usize,
    pub graph: Vec<Vec<Adjacency>>,
}

Fields§

§vsize: usize§esize: usize§graph: Vec<Vec<Adjacency>>

Implementations§

Source §

impl AdjacencyListGraph

Source

pub fn new(vsize: usize) -> AdjacencyListGraph

Examples found in repository ?

crates/competitive/src/graph/adjacency_list.rs (line 66)

65    fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
66        let mut graph = AdjacencyListGraph::new(self.vsize);
67        let mut rest = Vec::with_capacity(self.esize);
68        for _ in 0..self.esize {
69            let (from, to) = (U::scan(iter)?, U::scan(iter)?);
70            if self.directed {
71                graph.add_edge(from, to);
72            } else {
73                graph.add_undirected_edge(from, to);
74            }
75            rest.push(T::scan(iter)?);
76        }
77        Some((graph, rest))
78    }

Source

pub fn add_edge(&mut self, from: usize, to: usize)

Examples found in repository ?

crates/competitive/src/graph/adjacency_list.rs (line 71)

65    fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
66        let mut graph = AdjacencyListGraph::new(self.vsize);
67        let mut rest = Vec::with_capacity(self.esize);
68        for _ in 0..self.esize {
69            let (from, to) = (U::scan(iter)?, U::scan(iter)?);
70            if self.directed {
71                graph.add_edge(from, to);
72            } else {
73                graph.add_undirected_edge(from, to);
74            }
75            rest.push(T::scan(iter)?);
76        }
77        Some((graph, rest))
78    }

Source

pub fn add_undirected_edge(&mut self, u: usize, v: usize)

Examples found in repository ?

crates/competitive/src/graph/adjacency_list.rs (line 73)

65    fn mscan<'a, I: Iterator<Item = &'a str>>(self, iter: &mut I) -> Option<Self::Output> {
66        let mut graph = AdjacencyListGraph::new(self.vsize);
67        let mut rest = Vec::with_capacity(self.esize);
68        for _ in 0..self.esize {
69            let (from, to) = (U::scan(iter)?, U::scan(iter)?);
70            if self.directed {
71                graph.add_edge(from, to);
72            } else {
73                graph.add_undirected_edge(from, to);
74            }
75            rest.push(T::scan(iter)?);
76        }
77        Some((graph, rest))
78    }