Function bfs 

pub fn bfs(
    graph: &HashMap<String, Vec<String>>,
    start: &str,
) -> Result<Vec<String>, Error>

Breadth-first search.

Every neighbor listed in the adjacency map must also be a key of the map; missing keys return Err(Error::InvalidGraph).