fn construct_dag(values: &Vec<Vec<usize>) -> Graph<usize, ()> {
    let mut graph = Graph::<usize, ()>::new();

    // This isn't strictly a DAG, since we can not crossover paths we have
    // already crossed.
}
/// Construct a DAG that we can perform a graph search on.
Construct a DAG that we can perform a graph search on.
Construct a DAG that we can perform a graph search on .
fn construct_dag(values: &Vec<Vec<usize>) -> Graph<usize, ()> {
    let mut graph = Graph::<usize, ()>::new();
    // This isn't strictly a DAG, since we can not crossover paths we have
    // already crossed.
}
fn construct_dag ( values : & Vec < Vec < usize > ) -> Graph < usize , ( ) > { let mut graph = Graph :: < usize , ( ) > :: new ( ) ; // This isn't strictly a DAG, since we can not crossover paths we have // already crossed. }
Construct a DAG that we can perform a graph search on.
Construct a DAG that we can perform a graph search on .
values
&Vec<Vec<usize>