graaf 0.112.0

Work with directed graphs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

//! Iterate a digraph's vertices.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//!     AdjacencyList,
//!     Empty,
//!     Vertices,
//! };
//!
//! let digraph = AdjacencyList::empty(4);
//!
//! assert!(digraph.vertices().eq(0..4));
//! ```

/// Digraph vertices
pub trait Vertices {
    /// Iterate the digraph's vertices.
    ///
    /// # Examples
    ///
    /// ```
    /// use graaf::{
    ///     AdjacencyList,
    ///     Empty,
    ///     Vertices,
    /// };
    ///
    /// let digraph = AdjacencyList::empty(4);
    ///
    /// assert!(digraph.vertices().eq(0..4));
    /// ```
    #[must_use]
    fn vertices(&self) -> impl Iterator<Item = usize>;
}