Function toposort

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

Computes a topological sorting for a given graph.

This toposort algorithm was borrowed from the crate petgraph, found here