guided_digraph 0.1.1

A data structure for incremental live and dead state detection in an abstract transition system
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

/*
    Simplest binary: run a state graph algorithm on an example input
*/

use guided_digraph::driver::{self, Algorithm};
use structopt::StructOpt;

#[derive(Debug, StructOpt)]
#[structopt(
    name = "run basic example",
    about = "Run a state graph algorithm on an example input."
)]
struct Args {
    #[structopt(help = "Path to example without file extension \
        (e.g. 'examples/handwritten/2')")]
    basename: String,

    #[structopt(short, long, default_value = "Naive")]
    algorithm: Algorithm,

    #[structopt(short, long, default_value = "10")]
    timeout: u64,
}
impl Args {
    fn run(self) {
        driver::run_single_example(
            &self.basename,
            self.algorithm,
            self.timeout,
        );
    }
}

fn main() {
    Args::from_args().run();
}