pub struct MinimumDegree();
Expand description
This strategy chooses a vertex of minimum degree as starting vertex.
Trait Implementations§
source§impl<N, I, Iptr> Strategy<N, I, Iptr> for MinimumDegreewhere
N: PartialEq,
I: SpIndex,
Iptr: SpIndex,
impl<N, I, Iptr> Strategy<N, I, Iptr> for MinimumDegreewhere N: PartialEq, I: SpIndex, Iptr: SpIndex,
source§fn find_start_vertex(
&mut self,
visited: &[bool],
degrees: &[usize],
_mat: &CsMatViewI<'_, N, I, Iptr>
) -> usize
fn find_start_vertex( &mut self, visited: &[bool], degrees: &[usize], _mat: &CsMatViewI<'_, N, I, Iptr> ) -> usize
Contract: This function must always be called with at least one
unvisited vertex left.
Auto Trait Implementations§
impl RefUnwindSafe for MinimumDegree
impl Send for MinimumDegree
impl Sync for MinimumDegree
impl Unpin for MinimumDegree
impl UnwindSafe for MinimumDegree
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.