use crate::ArrayIndex;
use crate::cost::CostFunction;
use crate::routing::Routing;
#[inline]
pub fn bench_minimalist(
features_path: std::path::PathBuf,
start: Vec<ArrayIndex>,
end: Vec<ArrayIndex>,
) {
let cost_json = r#"{
"cost_layers": [
{"layer_name": "A"},
{"layer_name": "B", "multiplier_scalar": 100},
{"layer_name": "A", "multiplier_layer": "B"},
{"layer_name": "C", "multiplier_layer": "A", "multiplier_scalar": 2}
]
}"#
.to_string();
let cost_function = CostFunction::from_json(&cost_json).unwrap();
let mut simulation: Routing =
Routing::new(&features_path, cost_function, 1_000, "dijkstra").unwrap();
let solutions = simulation.compute(&start, end).collect::<Vec<_>>();
assert!(!solutions.is_empty(), "No solutions found");
}