pub fn assemble<S: Subgraphs + Eq + Hash + Send + Sync + Debug>(
    s: S,
    max_queue_size: Option<usize>,
    time_limit: Option<Duration>,
) -> Option<(HashSet<Graph>, TreeStatistics)> {
    let time_limit = time_limit.map(|d| Instant::now() + d);
    let r = self::run::Run::new(s, max_queue_size, time_limit);
    r.assemble()
}
/// This is this project's main entry point.
/// Given a multiset of subgraphs, this function returns a set of fully assembled molecular graphs.
/// Their subgraphs will be equal to the given set of subgraphs.
This is this project's main entry point.
Given a multiset of subgraphs, this function returns a set of fully assembled molecular graphs.
Their subgraphs will be equal to the given set of subgraphs.
This is this project ' s main entry point . Given a multiset of subgraphs this function returns a set of fully assembled molecular graphs . Their subgraphs will be equal to the given set of subgraphs .
pub fn assemble<S: Subgraphs + Eq + Hash + Send + Sync + Debug>(
    s: S,
    max_queue_size: Option<usize>,
    time_limit: Option<Duration>,
) -> Option<(HashSet<Graph>, TreeStatistics)> {
    let time_limit = time_limit.map(|d| Instant::now() + d);
    let r = self::run::Run::new(s, max_queue_size, time_limit);
    r.assemble()
}
pub fn assemble < S : Subgraphs + Eq + Hash + Send + Sync + Debug > ( s : S , max_queue_size : Option < usize > , time_limit : Option < Duration > , ) -> Option < ( HashSet < Graph > , TreeStatistics ) > { let time_limit = time_limit . map ( | d | Instant :: now ( ) + d ) ; let r = self :: run :: Run :: new ( s , max_queue_size , time_limit ) ; r . assemble ( ) }
This is this project's main entry point.
This is this project ' s main entry point .
s
S
max_queue_size
Option<usize>
time_limit
Option<Duration>