1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
pub mod astar;
pub mod bfs;
pub mod dfs;
pub mod dijkstra;
pub mod edmonds_karp;
pub mod fringe;
pub mod idastar;
pub mod iddfs;
pub mod strongly_connected_components;
pub mod topological_sort;
use indexmap::IndexMap;
use itertools;
use std::hash::Hash;
fn reverse_path<N, V, F>(parents: &IndexMap<N, V>, mut parent: F, start: usize) -> Vec<N>
where
N: Eq + Hash + Clone,
F: FnMut(&V) -> usize,
{
let path = itertools::unfold(start, |i| {
parents.get_index(*i).map(|(node, value)| {
*i = parent(value);
node
})
})
.collect::<Vec<&N>>();
path.into_iter().rev().cloned().collect()
}