pub enum CorenessMode {
All,
In,
Out,
}Expand description
Direction-handling for coreness_with_mode.
Counterpart of upstream’s igraph_neimode_t. Undirected graphs
always behave as if All.
Variants§
All
All edges count regardless of direction. The classical k-core.
In
In-cores: degree is the number of incoming edges. The k-in-core
is the maximal subgraph in which every vertex has at least
k incoming edges.
Out
Out-cores: degree is the number of outgoing edges.
Trait Implementations§
Source§impl Clone for CorenessMode
impl Clone for CorenessMode
Source§fn clone(&self) -> CorenessMode
fn clone(&self) -> CorenessMode
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for CorenessMode
impl Debug for CorenessMode
Source§impl PartialEq for CorenessMode
impl PartialEq for CorenessMode
impl Copy for CorenessMode
impl Eq for CorenessMode
impl StructuralPartialEq for CorenessMode
Auto Trait Implementations§
impl Freeze for CorenessMode
impl RefUnwindSafe for CorenessMode
impl Send for CorenessMode
impl Sync for CorenessMode
impl Unpin for CorenessMode
impl UnsafeUnpin for CorenessMode
impl UnwindSafe for CorenessMode
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