extern crate algorithmia;
extern crate serde_json;
use algorithmia::Algorithmia;
use algorithmia::algo::{AlgoResponse, AlgoUri, Version};
use std::collections::HashMap;
use std::env;
macro_rules! hashmap {
($( $key: expr => $val: expr ),*) => {{
let mut map = ::std::collections::HashMap::new();
$( map.insert($key, $val); )*
map
}}
}
type SrcDestMap<'a> = HashMap<&'a str, HashMap<&'a str, u32>>;
type DijkstraInput<'a> = (SrcDestMap<'a>, &'a str, &'a str);
type Route = Vec<String>;
struct RouteMap<'a> {
map: SrcDestMap<'a>,
}
impl<'a> RouteMap<'a> {
pub fn get_dijkstra_route(self, start: &'a str, end: &'a str) -> AlgoResponse {
let api_key = match env::var("ALGORITHMIA_API_KEY") {
Ok(key) => key,
Err(e) => {
panic!("Error getting ALGORITHMIA_API_KEY: {}", e);
}
};
let client = Algorithmia::client(&*api_key);
let dijkstra_uri = AlgoUri::with_version("anowell/Dijkstra", Version::Latest);
let dijkstra = client.algo(dijkstra_uri);
println!("Making request to: {}", dijkstra.to_url().unwrap());
let input_data: DijkstraInput = (self.map, start, end);
println!("Input:\n{}",
serde_json::to_string_pretty(&input_data).unwrap());
match dijkstra.pipe(&input_data) {
Ok(response) => response,
Err(err) => {
println!("{}", err);
std::process::exit(1);
}
}
}
}
fn main() {
let mut args = env::args();
args.next(); let start = args.next().unwrap_or_else(|| "a".to_string());
let end = args.next().unwrap_or_else(|| "c".to_string());
let input_map = RouteMap {
map: hashmap!(
"a" => hashmap!("b" => 1),
"b" => hashmap!("a" => 2, "c" => 2),
"c" => hashmap!("b" => 2, "d" => 1),
"d" => hashmap!("a" => 1, "c" => 3)
),
};
let output = input_map.get_dijkstra_route(&start, &end);
let duration = output.metadata.duration;
let result: Route = output.decode().unwrap();
println!("Shortest route: {}", result.join("->"));
println!("Completed in {} seconds.", duration);
}