Struct SparseGraphScanner 

pub struct SparseGraphScanner<U, T, D>
where
    U: Scan<Output = usize>,
    T: Scan,
{
    vsize: usize,
    esize: usize,
    _marker: PhantomData<fn() -> (U, T, D)>,
}

Fields

vsize: usize

esize: usize

_marker: PhantomData<fn() -> (U, T, D)>

Implementations

impl<U, T, D> SparseGraphScanner<U, T, D>

where U: Scan<Output = usize>, T: Scan,

pub fn new(vsize: usize, esize: usize) -> Self

Examples found in repository

crates/competitive/src/graph/sparse_graph.rs (line 261)

    fn mscan<I: ScanSource>(self, iter: &mut I) -> Option<Self::Output> {
        UndirectedGraphScanner::<U, T>::new(self.vsize, self.vsize - 1).mscan(iter)
    }

crates/aizu_online_judge/src/grl/grl_4_b.rs (line 7)

pub fn grl_4_b(reader: impl Read, writer: impl Write) {
    prepare_io!(reader, writer);
    sc!(vs, es, (graph, _): @DirectedGraphScanner::<usize, ()>::new(vs, es));
    pp!(@lf @it graph.topological_sort());
}

crates/aizu_online_judge/src/grl/grl_4_a.rs (line 7)

pub fn grl_4_a(reader: impl Read, writer: impl Write) {
    prepare_io!(reader, writer);
    sc!(vs, es, (graph, _): @DirectedGraphScanner::<usize, ()>::new(vs, es));
    pp!((graph.topological_sort().len() != vs) as u32);
}

crates/aizu_online_judge/src/grl/grl_3_b.rs (line 7)

pub fn grl_3_b(reader: impl Read, writer: impl Write) {
    prepare_io!(reader, writer);
    sc!(vs, es, (graph, _): @UndirectedGraphScanner::<usize, ()>::new(vs, es));
    let mut bridge = LowLink::new(&graph).bridge;
    bridge.sort_unstable();
    for (u, v) in bridge.into_iter() {
        pp!(u, v);
    }
}

crates/aizu_online_judge/src/grl/grl_3_a.rs (line 7)

pub fn grl_3_a(reader: impl Read, writer: impl Write) {
    prepare_io!(reader, writer);
    sc!(vs, es, (graph, _): @UndirectedGraphScanner::<usize, ()>::new(vs, es));
    let mut articulation = LowLink::new(&graph).articulation;
    articulation.sort_unstable();
    for u in articulation.into_iter() {
        pp!(u);
    }
}

crates/aizu_online_judge/src/grl/grl_3_c.rs (line 7)

pub fn grl_3_c(reader: impl Read, writer: impl Write) {
    prepare_io!(reader, writer);
    sc!(vs, es, (graph, _): @DirectedGraphScanner::<usize, ()>::new(vs, es));
    let scc = StronglyConnectedComponent::new(&graph);
    sc!(q);
    for (u, v) in sv!([(usize, usize); iter q]) {
        pp!((scc[u] == scc[v]) as u32);
    }
}

Additional examples can be found in:

• crates/aizu_online_judge/src/grl/grl_1_a.rs
• crates/library_checker/src/graph/shortest_path.rs
• crates/aizu_online_judge/src/grl/grl_1_b.rs
• crates/library_checker/src/graph/minimum_steiner_tree.rs
• crates/aizu_online_judge/src/grl/grl_1_c.rs

Trait Implementations

impl<U, T, D> MarkedScan for SparseGraphScanner<U, T, D>

where U: Scan<Output = usize>, T: Scan, D: SparseGraphConstruction,

type Output = (SparseGraph<D>, Vec<<T as Scan>::Output>)

fn mscan<I: ScanSource>(self, iter: &mut I) -> Option<Self::Output>