Function dag_longest_path_filtered 

pub fn dag_longest_path_filtered<G, F>(
    graph: &G,
    allows_edge: F,
) -> Result<Option<WeightedPath<G::Node>>>
where
    G: IndexGraphView,
    F: FnMut(G::Edge) -> bool,

Returns a deterministic longest path over accepted DAG edges.

Errors

Returns an error when the accepted subgraph is cyclic or the length overflows.