SccGraph

Struct SccGraph 

Source
pub struct SccGraph { /* private fields */ }
Expand description

An SccGraph is a directed graph that calculates strongly connected components (SCC) in $O(|V| + |E|)$.

§Example

use ac_library::SccGraph;
use proconio::{input, source::once::OnceSource};

input! {
    from OnceSource::from(
        "5\n\
         5\n\
         0 1\n\
         1 2\n\
         2 0\n\
         0 3\n\
         3 4\n",
    ),
    n: usize,
    abs: [(usize, usize)],
}

let mut graph = SccGraph::new(n);
for (a, b) in abs {
    graph.add_edge(a, b);
}

assert_eq!(graph.scc(), [&[0, 1, 2][..], &[3], &[4]]);

Implementations§

Source§

impl SccGraph

Source

pub fn new(n: usize) -> Self

Creates a new SccGraph with n vertices and 0 edges.

§Constraints
  • $0 \leq n \leq 10^8$
§Complexity
  • $O(n)$
Source

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

Adds a directed edge from the vertex from to the vertex to.

§Constraints
  • $0 \leq$ from $< n$
  • $0 \leq$ to $< n$
§Panics

Panics if the above constraints are not satisfied.

§Complexity
  • $O(1)$ amortized
Source

pub fn scc(&self) -> Vec<Vec<usize>>

Calculates the strongly connected components (SCC) of directed graphs in $O(|V| + |E|)$.

Returns the list of the “list of the vertices” that satisfies the following.

  • Each vertex is in exactly one “list of the vertices”.
  • Each “list of the vertices” corresponds to the vertex set of a strongly connected component. The order of the vertices in the list is undefined.
  • The list of “list of the vertices” are sorted in topological order, i.e., for two vertices $u$, $v$ in different strongly connected components, if there is a directed path from $u$ to $v$, the list containing $u$ appears earlier than the list containing $v$.
§Complexity
  • $O(n + m)$ where $m$ is the number of added edges

Trait Implementations§

Source§

impl Clone for SccGraph

Source§

fn clone(&self) -> SccGraph

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for SccGraph

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

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

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.