[−][src]Struct rustc_data_structures::graph::scc::Sccs

pub struct Sccs<N: Idx, S: Idx> { /* fields omitted */ }

Strongly connected components (SCC) of a graph. The type N is the index type for the graph nodes and S is the index type for the SCCs. We can map from each node to the SCC that it participates in, and we also have the successors of each SCC.

Methods

`impl<N: Idx, S: Idx> Sccs<N, S>`[src]

`pub fn new( graph: &impl DirectedGraph<Node = N> + WithNumNodes + WithSuccessors ) -> Self`[src]

`pub fn num_sccs(&self) -> usize`[src]

Returns the number of SCCs in the graph.

`pub fn all_sccs(&self) -> impl Iterator<Item = S>`[src]

Returns an iterator over the SCCs in the graph.

`pub fn scc(&self, r: N) -> S`[src]

Returns the SCC to which a node r belongs.

ⓘImportant traits for &'_ mut [u8 ]
Important traits for &'_ mut [u8 ]
`impl<'_> Write for &'_ mut [u8]impl<'_> Read for &'_ [u8]`
`pub fn successors(&self, scc: S) -> &[S]`[src]

Returns the successors of the given SCC.

`pub fn reverse(&self) -> VecGraph<S>`[src]

Construct the reverse graph of the SCC graph.

Trait Implementations

`impl<N: Idx, S: Idx> DirectedGraph for Sccs<N, S>`[src]

`type Node = S`

`impl<N: Idx, S: Idx> WithNumNodes for Sccs<N, S>`[src]

`fn num_nodes(&self) -> usize`[src]

`impl<N: Idx, S: Idx> WithNumEdges for Sccs<N, S>`[src]

`fn num_edges(&self) -> usize`[src]

`impl<N: Idx, S: Idx> WithSuccessors for Sccs<N, S>`[src]

`fn successors<'graph>(&'graph self, node: S) -> Self::Iter`[src]

ⓘImportant traits for DepthFirstSearch<'_, G>
Important traits for DepthFirstSearch<'_, G>
`impl<'_, G: ?Sized> Iterator for DepthFirstSearch<'_, G> where G: DirectedGraph + WithNumNodes + WithSuccessors, type Item = G::Node;`
`fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<Self> where Self: WithNumNodes,` [src]

`impl<'graph, N: Idx, S: Idx> GraphSuccessors<'graph> for Sccs<N, S>`[src]

`type Item = S`

`type Iter = Cloned<Iter<'graph, S>>`

Auto Trait Implementations

`impl<N, S> Send for Sccs<N, S> where S: Send,`

`impl<N, S> Unpin for Sccs<N, S> where S: Unpin,`

`impl<N, S> Sync for Sccs<N, S> where S: Sync,`

`impl<N, S> UnwindSafe for Sccs<N, S> where S: UnwindSafe,`

`impl<N, S> RefUnwindSafe for Sccs<N, S> where S: RefUnwindSafe,`

Blanket Implementations

`impl<T> Erased for T`[src]

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

`fn from(t: T) -> T`[src]

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

`fn into(self) -> U`[src]

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

`type Error = Infallible`

The type returned in the event of a conversion error.

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

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

`type Error = >::Error`

The type returned in the event of a conversion error.

`fn try_into(self) -> Result<U, >::Error>`[src]

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

ⓘImportant traits for &'_ mut I
Important traits for &'_ mut I
`impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = ::Item;`
`fn borrow(&self) -> &T`[src]

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

ⓘImportant traits for &'_ mut I
Important traits for &'_ mut I
`impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = ::Item;`
`fn borrow_mut(&mut self) -> &mut T`[src]

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

`fn type_id(&self) -> TypeId`[src]

`impl<E> SpecializationError for E`[src]

`default fn not_found<S, T>( trait_name: &'static str, method_name: &'static str ) -> E where T: ?Sized,` [src]

[−][src]Struct rustc_data_structures::graph::scc::Sccs

Methods

impl<N: Idx, S: Idx> Sccs<N, S>[src]

pub fn new( graph: &impl DirectedGraph<Node = N> + WithNumNodes + WithSuccessors) -> Self[src]

pub fn num_sccs(&self) -> usize[src]

pub fn all_sccs(&self) -> impl Iterator<Item = S>[src]

pub fn scc(&self, r: N) -> S[src]

ⓘImportant traits for &'_ mut [u8]Important traits for &'_ mut [u8]impl<'_> Write for &'_ mut [u8]impl<'_> Read for &'_ [u8]pub fn successors(&self, scc: S) -> &[S][src]

Important traits for &'_ mut [u8]

pub fn reverse(&self) -> VecGraph<S>[src]

Trait Implementations

impl<N: Idx, S: Idx> DirectedGraph for Sccs<N, S>[src]

type Node = S

impl<N: Idx, S: Idx> WithNumNodes for Sccs<N, S>[src]

fn num_nodes(&self) -> usize[src]

impl<N: Idx, S: Idx> WithNumEdges for Sccs<N, S>[src]

fn num_edges(&self) -> usize[src]

impl<N: Idx, S: Idx> WithSuccessors for Sccs<N, S>[src]

fn successors<'graph>(&'graph self, node: S) -> Self::Iter[src]

Important traits for DepthFirstSearch<'_, G>

impl<'graph, N: Idx, S: Idx> GraphSuccessors<'graph> for Sccs<N, S>[src]

type Item = S

type Iter = Cloned<Iter<'graph, S>>

Auto Trait Implementations

impl<N, S> Send for Sccs<N, S> where S: Send,

impl<N, S> Unpin for Sccs<N, S> where S: Unpin,

impl<N, S> Sync for Sccs<N, S> where S: Sync,

impl<N, S> UnwindSafe for Sccs<N, S> where S: UnwindSafe,

impl<N, S> RefUnwindSafe for Sccs<N, S> where S: RefUnwindSafe,

Blanket Implementations

impl<T> Erased for T[src]

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

fn from(t: T) -> T[src]

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

fn into(self) -> U[src]

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

type Error = Infallible

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

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

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

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

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

ⓘImportant traits for &'_ mut IImportant traits for &'_ mut Iimpl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;fn borrow(&self) -> &T[src]

Important traits for &'_ mut I

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

ⓘImportant traits for &'_ mut IImportant traits for &'_ mut Iimpl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;fn borrow_mut(&mut self) -> &mut T[src]