pub enum VconnNei {
Error,
NumberOfNodes,
Ignore,
Negative,
}Expand description
What to do when computing the vertex connectivity of two adjacent
vertices, which no vertex removal can disconnect
(igraph_vconn_nei_t).
Variants§
Error
Report an error.
NumberOfNodes
Return the number of vertices.
Ignore
Ignore the edges between them: count the vertices needed to cut all the other paths.
Negative
Return -1.
Trait Implementations§
impl Copy for VconnNei
impl Eq for VconnNei
Source§impl From<VconnNei> for igraph_vconn_nei_t
impl From<VconnNei> for igraph_vconn_nei_t
Source§fn from(value: VconnNei) -> igraph_vconn_nei_t
fn from(value: VconnNei) -> igraph_vconn_nei_t
Converts to this type from the input type.
impl StructuralPartialEq for VconnNei
Auto Trait Implementations§
impl Freeze for VconnNei
impl RefUnwindSafe for VconnNei
impl Send for VconnNei
impl Sync for VconnNei
impl Unpin for VconnNei
impl UnsafeUnpin for VconnNei
impl UnwindSafe for VconnNei
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