RustHashmapOfVectorsOfPairs

RuHaOfVeOfPr

    pub struct Edge {
        to:     char,
        from:   char,
        weight: int
    }

    pub struct digraph {
        _vertices:  Vec<char>,
        _adj_list:  HashMap<char, Vec<(char,int)> >
    }

    impl digraph {
        pub fn new(nodes: &Vec<char>, edges: &Vec<Edge> ) -> Option<digraph> {
            let mut tmp_adj_list = HashMap::new();
            for node in (*nodes).iter() {
                tmp_adj_list.insert(*node, Vec::new());
            }
            for edge in (*edges).iter() {
                let Edge{ to: to, from:from, weight:weight } = *edge;
                if  !(*nodes).contains(&to) |  !(*nodes).contains(&from) {
                    return None;
                }
                tmp_adj_list[from].push((to,weight))
            }
            Some(digraph { _vertices: (*nodes).clone(), _adj_list: tmp_adj_list })
        }
    }