Method adjacent_key

publication/code/chapter09/graph_adjlist.rs:22–28

判断与当前点是否相邻

(&self, key: &T)

    // 判断与当前点是否相邻
    fn adjacent_key(&self, key: &T) -> bool {
        for (nbr, _wt) in self.neighbors.iter() {
            if nbr == key { return true; }
        }

        false
    }

    fn add_neighbor(&mut self, nbr: T, wt: i32) {
        self.neighbors.push((nbr, wt));