pub enum GraphKind {
Graph,
DiGraph,
MultiGraph,
MultiDiGraph,
}Expand description
Declared graph topology contract.
Variants§
Graph
Undirected simple graph.
DiGraph
Directed simple graph.
MultiGraph
Undirected graph permitting parallel endpoint pairs.
MultiDiGraph
Directed graph permitting parallel endpoint pairs.
Implementations§
Source§impl GraphKind
impl GraphKind
Sourcepub const fn is_directed(self) -> bool
pub const fn is_directed(self) -> bool
Whether algorithms observe stored edge direction.
Sourcepub const fn is_multigraph(self) -> bool
pub const fn is_multigraph(self) -> bool
Whether parallel endpoint pairs are permitted.
Trait Implementations§
impl Copy for GraphKind
Source§impl<'de> Deserialize<'de> for GraphKind
impl<'de> Deserialize<'de> for GraphKind
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for GraphKind
impl StructuralPartialEq for GraphKind
Auto Trait Implementations§
impl Freeze for GraphKind
impl RefUnwindSafe for GraphKind
impl Send for GraphKind
impl Sync for GraphKind
impl Unpin for GraphKind
impl UnsafeUnpin for GraphKind
impl UnwindSafe for GraphKind
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