reachability_solver 0.2.0

A linear reachability solver for directional edges
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

extern crate reachability_solver;

use reachability_solver::solve;

fn main() {
    // This example shows that even if the node `2` is initial,
    // it must reach a terminal node to be included in the solution.
    //
    // 1--2--3
    // |     |
    // 4     6
    // |     |
    // 7--8--9
    //    |
    //    10
    //
    println!("{:?}", solve(vec![
        [1, 2], [2, 3], [3, 6], [6, 9], [9, 8], [8, 7], [7, 4], [4, 1],
        [8, 10]
    ]))
}