Function bfs_paths

tests/test_directed_graph.rs:58–88

()

#[test]
fn bfs_paths() {
    let graph = create_digraph(TINY_DG);
    let paths = BreadthFirstPaths::new(graph.as_ref(), 3);
    for (v, expect) in vec![
        Some(vec![3, 2, 0]),    // 0
        Some(vec![3, 2, 0, 1]), // 1
        Some(vec![3, 2]),       // 2
        Some(vec![3]),          // 3
        Some(vec![3, 5, 4]),    // 4
        Some(vec![3, 5]),       // 5
        None,                   // 6
        None,                   // 7
        None,                   // 8
        None,                   // 9
        None,                   // 10
        None,                   // 11
        None,                   // 12
    ]
    .iter()
    .enumerate()
    {
        {
            let paths: Option<Vec<usize>> = paths
                .path_to(v)
                .and_then(|paths| Some(paths.iter().map(|&v| v).collect()));
            assert_eq!(expect, &paths);
        }
        let expect_dist = expect.as_ref().map_or(usize::MAX, |v| v.len() - 1);
        assert_eq!(expect_dist, paths.dist_to(v));
    }
}

#[test]
fn search() {