gryf 0.2.1

Graph data structure library with focus on convenience, versatility, correctness and performance.
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

use crate::{
    adapt::{
        Transpose, Undirect,
        cast::{CastAsDirected, CastAsUndirected},
    },
    core::{
        GraphBase, Neighbors, VertexSet,
        id::IdType,
        marker::{Directed, Undirected},
    },
    visit::{Dfs, VisitSet, Visitor},
};

use super::Connected;

pub fn dfs<G>(
    graph: &G,
    between: Option<(&G::VertexId, &G::VertexId)>,
    strong: bool,
) -> Connected<G>
where
    G: Neighbors + VertexSet,
{
    if let Some((start, goal)) = between
        && start == goal
    {
        // A vertex is trivially connected with itself.
        return Connected {
            disconnected_any: None,
            strong: false,
        };
    }

    let disconnected_any = if graph.is_directed() {
        dfs_directed(&CastAsDirected::new(graph), between, strong)
    } else {
        dfs_undirected(&CastAsUndirected::new(graph), between)
    };

    Connected {
        disconnected_any,
        strong,
    }
}

fn dfs_undirected<G, VI>(graph: &G, between: Option<(&VI, &VI)>) -> Option<(VI, VI)>
where
    VI: IdType,
    G: GraphBase<EdgeType = Undirected, VertexId = VI> + Neighbors + VertexSet,
{
    let mut traversal = Dfs::new(&graph);

    match between {
        Some((start, goal)) => {
            for vertex in traversal.start(start.clone()).into_iter(&graph) {
                if &vertex == goal {
                    return None;
                }
            }

            Some((start.clone(), goal.clone()))
        }
        None => {
            let Some(any_vertex) = graph.vertices_by_id().next() else {
                // Empty graph trivially connected.
                return None;
            };

            for _ in traversal.start(any_vertex.clone()).into_iter(&graph) {}

            if traversal.visited().visited_count() == graph.vertex_count() {
                // Visited all vertices.
                return None;
            }

            let other_vertex = graph
                .vertices_by_id()
                .find(|vertex| !traversal.visited().is_visited(vertex))
                .unwrap();

            Some((any_vertex, other_vertex))
        }
    }
}

fn dfs_directed<G, VI>(graph: &G, between: Option<(&VI, &VI)>, strong: bool) -> Option<(VI, VI)>
where
    VI: IdType,
    G: GraphBase<EdgeType = Directed, VertexId = VI> + Neighbors + VertexSet,
{
    if !strong {
        return dfs_undirected(&Undirect::new(graph), between);
    }

    let mut traversal = Dfs::new(graph);

    match between {
        Some((start, goal)) => {
            let mut found = false;

            for vertex in traversal.start(start.clone()).into_iter(graph) {
                if &vertex == goal {
                    found = true;
                    break;
                }
            }

            if !found {
                return Some((start.clone(), goal.clone()));
            }

            // Backwards pass.
            for vertex in traversal.start(goal.clone()).into_iter(graph) {
                if &vertex == start {
                    return None;
                }
            }

            Some((start.clone(), goal.clone()))
        }
        None => {
            let Some(any_vertex) = graph.vertices_by_id().next() else {
                // Empty graph trivially connected.
                return None;
            };

            for _ in traversal.start(any_vertex.clone()).into_iter(graph) {}

            if traversal.visited().visited_count() != graph.vertex_count() {
                let other_vertex = graph
                    .vertices_by_id()
                    .find(|vertex| !traversal.visited().is_visited(vertex))
                    .unwrap();

                return Some((any_vertex, other_vertex));
            }

            // Backwards pass.
            let transpose = Transpose::new(graph);
            let mut backwards = Dfs::new(&transpose);

            for vertex in backwards.start(any_vertex.clone()).into_iter(&transpose) {
                if !traversal.visited_mut().unvisit(&vertex) {
                    return Some((any_vertex.clone(), vertex));
                }
            }

            if traversal.visited().visited_count() == 0 {
                // Visited all vertices.
                None
            } else {
                let other_vertex = graph
                    .vertices_by_id()
                    .find(|vertex| !traversal.visited().is_visited(vertex))
                    .unwrap();

                Some((any_vertex, other_vertex))
            }
        }
    }
}