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

use crate::{
    adapt::Undirect,
    core::{Neighbors, VertexSet},
    visit::{DfsEvent, DfsEvents, Visitor},
};

use super::Cycle;

pub fn dfs_find<G>(graph: &G, as_undirected: bool) -> Option<Cycle<G>>
where
    G: Neighbors + VertexSet,
{
    let edge = if as_undirected {
        find(&Undirect::new(graph))
    } else {
        find(graph)
    };

    edge.map(|edge| Cycle {
        edge,
        as_undirected,
    })
}

fn find<G>(graph: &G) -> Option<G::EdgeId>
where
    G: Neighbors + VertexSet,
{
    DfsEvents::new(graph)
        .start_all(graph)
        .into_iter(graph)
        .find_map(|event| match event {
            DfsEvent::BackEdge { edge, .. } => Some(edge),
            _ => None,
        })
}