pub struct Forward<I: SpIndex> { /* private fields */ }
Expand description
Indicates the Cuthill-McKee ordering should be built in forward order.
Implementations§
Trait Implementations§
source§impl<I: SpIndex> DirectedOrdering<I> for Forward<I>
impl<I: SpIndex> DirectedOrdering<I> for Forward<I>
source§fn prepare(&mut self, nb_vertices: usize)
fn prepare(&mut self, nb_vertices: usize)
Prepares this directed ordering for working with the specified
number of vertices.
source§fn add_transposition(&mut self, vertex_index: usize)
fn add_transposition(&mut self, vertex_index: usize)
Adds a new
vertex_index
as computed in the algorithms main loop.source§fn add_component_delimeter(&mut self, index: usize)
fn add_component_delimeter(&mut self, index: usize)
Adds an index indicating the start of a new connected component.
source§fn into_ordering(self) -> Ordering<I>
fn into_ordering(self) -> Ordering<I>
Transforms this directed ordering into an ordering to return from
the algorithm.
Auto Trait Implementations§
impl<I> RefUnwindSafe for Forward<I>where I: RefUnwindSafe,
impl<I> Send for Forward<I>
impl<I> Sync for Forward<I>
impl<I> Unpin for Forward<I>where I: Unpin,
impl<I> UnwindSafe for Forward<I>where I: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.