fn recursive_path_finder_incl_coverage<T, U, Ix: IndexType>(
graph: &Graph<T, U, Directed, Ix>,
start_node: NodeIndex<Ix>,
end_node: NodeIndex<Ix>,
visited: &mut HashMap<NodeIndex<Ix>, usize>,
rel_coverage_map: &HashMap<NodeIndex<Ix>, usize>,
depth: usize,
index: usize
) -> Option<Result<Vec<Vec<NodeIndex<Ix>>>>>Expand description
Function called by all_paths where a HashMap is supplied instead of a
HashSet in order to keep track of how many times a segment/node has been
passed in a path.
Should be no more stack overflows.