Function toposort 

pub fn toposort<'a, G>(graph: &'a G) -> Result<Vec<G::V>, String>
where
    G: FinGraph,
    G::V: Hash + Debug + 'a,

Computes a topological sorting for a given graph.

This toposort algorithm was adapted from the crate petgraph, found here.