pub fn floyd_warshall( graph: &HashMap<String, Vec<Edge>>, ) -> Result<HashMap<String, HashMap<String, f64>>, Error>
Floyd–Warshall all-pairs shortest paths.