Function check 

pub fn check(nodes: usize, edges: &[Edge], bound: &Bound) -> bool

Whether bound is the graph’s: a combinational loop is a simple cycle of no register; a ratio’s cycle is a simple cycle with those sums and some register, and its potential satisfies every edge; acyclic means the graph has no cycle. The graph itself must be well formed.