/// Sort dependencies for processing. Dependencies are ordered such that crates with no
/// dependencies are listed first
Sort dependencies for processing. Dependencies are ordered such that crates with no
dependencies are listed first
Sort dependencies for processing . Dependencies are ordered such that crates with no dependencies are listed first
pub fn order_crates(&self) -> Vec<String> {
        let mut sorted_graph = daggy::petgraph::algo::toposort(&self.graph, None).unwrap();
        sorted_graph.reverse();
        sorted_graph
            .iter()
            .map(|idx| self.graph.node_weight(*idx).unwrap().to_string())
            .collect()
    }
pub fn order_crates ( & self ) -> Vec < String > { let mut sorted_graph = daggy :: petgraph :: algo :: toposort ( & self . graph , None ) . unwrap ( ) ; sorted_graph . reverse ( ) ; sorted_graph . iter ( ) . map ( | idx | self . graph . node_weight ( * idx ) . unwrap ( ) . to_string ( ) ) . collect ( ) }
Sort dependencies for processing.
Sort dependencies for processing .
&self