digraph-rs 0.1.0

a handful of algorithms for digraphs
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

use std::collections::hash_map::Entry;
use std::collections::{HashMap, HashSet};
use std::hash::Hash;

pub trait Visited<'a, T> {
    fn visit(&mut self, v: &'a T) -> bool;
    fn already_visited(&self, v: &'a T) -> bool;
}

#[derive(Debug)]
pub struct VisitedSet<'a, T>
where
    T: Hash + Eq,
{
    visited: HashSet<&'a T>,
}

impl<'a, T> Default for VisitedSet<'a, T>
where
    T: Hash + Eq,
{
    fn default() -> Self {
        Self { visited: Default::default() }
    }
}


impl<'a, T> Visited<'a, T> for VisitedSet<'a, T>
where
    T: Hash + Eq,
{
    fn visit(&mut self, v: &'a T) -> bool {
        self.visited.insert(v)
    }
    fn already_visited(&self, v: &'a T) -> bool {
        self.visited.contains(v)
    }
}