pub fn optimise_graph(&self, graph: Graph, config: &Config) -> Vec<Graph> {
        log::debug!("Optimising graph(s)");
        let mut graphs = if config.split_by_start_chunk {
            graph.split_by_start_chunk()
        } else {
            vec![graph]
        };
        for g in &mut graphs {
            g.optimise(&config.optimisation_passes, self);
            log::debug!(
                "Optimised graph has {} chunks, {} starts, {} ends",
                g.chunk_map().len(),
                g.start_chunks().len(),
                g.end_chunks().len()
            );
        }
        graphs
    }
/// Converts a single [`Graph`] into a set of [`Graph`]s which make tree search faster but
/// generate the same overall set of compositions.
Converts a single [`Graph`] into a set of [`Graph`]s which make tree search faster but
generate the same overall set of compositions.
Converts a single [ ` Graph ` ] into a set of [ ` Graph ` ] s which make tree search faster but generate the same overall set of compositions .
pub fn optimise_graph(&self, graph: Graph, config: &Config) -> Vec<Graph> {
        log::debug!("Optimising graph(s)");
        let mut graphs = if config.split_by_start_chunk {
            graph.split_by_start_chunk()
        } else {
            vec![graph]
        };
        for g in &mut graphs {
            g.optimise(&config.optimisation_passes, self);
            log::debug!(
                "Optimised graph has {} chunks, {} starts, {} ends",
                g.chunk_map().len(),
                g.start_chunks().len(),
                g.end_chunks().len()
            );
        }
        graphs
    }
pub fn optimise_graph ( & self , graph : Graph , config : & Config ) -> Vec < Graph > { log :: debug ! ( " " ) ; let mut graphs = if config . split_by_start_chunk { graph . split_by_start_chunk ( ) } else { vec ! [ graph ] } ; for g in & mut graphs { g . optimise ( & config . optimisation_passes , self ) ; log :: debug ! ( " " g chunk_map ( ) len ( ) g start_chunks ( ) len ( ) g end_chunks ( ) len ( ) ) ; } graphs }
Converts a single [`Graph`] into a set of [`Graph`]s which make tree search faster but
generate the same overall set of compositions.
Converts a single [ ` Graph ` ] into a set of [ ` Graph ` ] s which make tree search faster but generate the same overall set of compositions .
&self
graph
Graph
config
&Config
&self
graph
Graph
config
&Config