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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
//! Iterate a digraph's weighted arcs.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//! AddArcWeighted,
//! AdjacencyListWeighted,
//! ArcsWeighted,
//! Empty,
//! };
//!
//! let mut digraph = AdjacencyListWeighted::empty(3);
//!
//! digraph.add_arc_weighted(0, 1, 2);
//! digraph.add_arc_weighted(1, 2, 3);
//! digraph.add_arc_weighted(2, 0, 4);
//!
//! assert!(
//! digraph
//! .arcs_weighted()
//! .eq([(0, 1, &2), (1, 2, &3), (2, 0, &4)])
//! );
//! ```
/// Weighted arcs
pub trait ArcsWeighted {
/// The weight of an arc.
type Weight;
/// Iterate the digraph's weighted arcs.
///
/// # Examples
///
/// ```
/// use graaf::{
/// AddArcWeighted,
/// AdjacencyListWeighted,
/// ArcsWeighted,
/// Empty,
/// };
///
/// let mut digraph = AdjacencyListWeighted::empty(3);
///
/// digraph.add_arc_weighted(0, 1, 2);
/// digraph.add_arc_weighted(1, 2, 3);
/// digraph.add_arc_weighted(2, 0, 4);
///
/// assert!(
/// digraph
/// .arcs_weighted()
/// .eq([(0, 1, &2), (1, 2, &3), (2, 0, &4)])
/// );
/// ```
#[must_use]
fn arcs_weighted(
&self,
) -> impl Iterator<Item = (usize, usize, &Self::Weight)>;
}