gistfile1.rs

fn searcher(g: &Graph<Node,Edge>, ni: NodeIndex) -> Vec<Vec<Node>> {
    let mut v = Vec::new();
    for neighbor in g.neighbors_directed(ni, EdgeDirection::Outgoing) {
        let result = searcher(&g, neighbor);
        for mut nodev in result {
            let node = g.node_weight(ni).unwrap().clone();
            nodev.insert(0, node);
            v.push(nodev);
        }
    }
    v
}