mapgraph::algo::dfs

Function reverse_dfs_visit_mut

Source 
pub fn reverse_dfs_visit_mut<G, N, E, NI, EI, NM, EM, VS, F>(
    graph: &mut G,
    idx: NI,
    f: F,
    visited: &mut VS,
)
where
    G: AsMut<FrozenGraph<N, E, NI, EI, NM, EM>>,
    NI: Copy + Eq + Debug + 'static,
    EI: Copy + Eq + Debug + 'static,
    NM: Map<Node<N, EI>, Key = NI>,
    EM: IntKeyMap<Edge<E, NI, EI>, Key = EI>,
    VS: KeySet<NI>,
    F: FnMut(&mut G, NI),
Available on crate feature algorithms only.
Expand description

Calls a closure for each node in the graph the reverse DFS order starting at a specified index.