adjacency-list 0.0.2

Adjacency List and Adjacency Graph
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101

use crate::utils::ShortEdge;
use graph_types::IndeterminateEdge;
use std::collections::{btree_map, btree_set, btree_set::Iter, BTreeMap, BTreeSet};

#[derive(Debug)]
pub struct EdgeFirstAllNodes<'i> {
    pub(crate) nodes: btree_set::Iter<'i, u32>,
}
#[derive(Debug)]
pub struct EdgeFirstAllEdges<'i> {
    pub(crate) edges: btree_map::Iter<'i, u32, ShortEdge>,
}

#[derive(Debug)]
pub struct EdgeFirstAllBridges<'i> {
    pub(crate) edges: btree_map::Iter<'i, u32, ShortEdge>,
}

#[derive(Debug)]
pub struct EdgeFirstFindBridges<'i> {
    pub(crate) edges: btree_map::Iter<'i, u32, ShortEdge>,
    pub(crate) target: ShortEdge,
}

#[derive(Debug)]
pub struct EdgeFirstFindNeighbors<'i> {
    pub(crate) edges: btree_map::Iter<'i, u32, ShortEdge>,
    pub(crate) target: u32,
}

impl<'i> Iterator for EdgeFirstAllNodes<'i> {
    type Item = usize;

    fn next(&mut self) -> Option<Self::Item> {
        self.nodes.next().map(|x| *x as usize)
    }
}

impl<'i> DoubleEndedIterator for EdgeFirstAllNodes<'i> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.nodes.next_back().map(|x| *x as usize)
    }
}

impl<'i> Iterator for EdgeFirstAllEdges<'i> {
    type Item = usize;

    fn next(&mut self) -> Option<Self::Item> {
        self.edges.next().map(|(x, _)| *x as usize)
    }
}

impl<'i> DoubleEndedIterator for EdgeFirstAllEdges<'i> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.edges.next_back().map(|(x, _)| *x as usize)
    }
}

impl<'i> Iterator for EdgeFirstAllBridges<'i> {
    type Item = IndeterminateEdge;

    fn next(&mut self) -> Option<Self::Item> {
        self.edges.next().map(|(_, y)| y.as_indeterminate())
    }
}

impl<'i> DoubleEndedIterator for EdgeFirstAllBridges<'i> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.edges.next_back().map(|(_, y)| y.as_indeterminate())
    }
}

impl<'i> Iterator for EdgeFirstFindBridges<'i> {
    type Item = IndeterminateEdge;

    fn next(&mut self) -> Option<Self::Item> {
        let (id, edge) = self.edges.next()?;
        if self.target.eq(edge) { Some(edge.as_indeterminate()) } else { self.next() }
    }
}

impl<'i> DoubleEndedIterator for EdgeFirstFindBridges<'i> {
    fn next_back(&mut self) -> Option<Self::Item> {
        let (id, edge) = self.edges.next_back()?;
        if self.target.eq(edge) { Some(edge.as_indeterminate()) } else { self.next_back() }
    }
}

impl<'i> Iterator for EdgeFirstFindNeighbors<'i> {
    type Item = usize;

    fn next(&mut self) -> Option<Self::Item> {
        todo!()
    }
}

impl<'i> DoubleEndedIterator for EdgeFirstFindNeighbors<'i> {
    fn next_back(&mut self) -> Option<Self::Item> {
        todo!()
    }
}