pub enum DijkstraMode {
Out,
In,
All,
}Expand description
Direction selector for the mode-aware Dijkstra entry points
(SP-001c). Counterpart of igraph_neimode_t restricted to the
three values igraph_distances_dijkstra accepts. For undirected
graphs every variant collapses to DijkstraMode::All (every
edge is bidirectional).
Variants§
Out
Follow outgoing edges (IGRAPH_OUT). Default for the legacy
entry points without _with_mode.
In
Follow incoming edges (IGRAPH_IN).
All
Ignore direction — treat every edge as bidirectional
(IGRAPH_ALL).
Trait Implementations§
Source§impl Clone for DijkstraMode
impl Clone for DijkstraMode
Source§fn clone(&self) -> DijkstraMode
fn clone(&self) -> DijkstraMode
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 DijkstraMode
impl Debug for DijkstraMode
Source§impl PartialEq for DijkstraMode
impl PartialEq for DijkstraMode
impl Copy for DijkstraMode
impl Eq for DijkstraMode
impl StructuralPartialEq for DijkstraMode
Auto Trait Implementations§
impl Freeze for DijkstraMode
impl RefUnwindSafe for DijkstraMode
impl Send for DijkstraMode
impl Sync for DijkstraMode
impl Unpin for DijkstraMode
impl UnsafeUnpin for DijkstraMode
impl UnwindSafe for DijkstraMode
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