fact: Fixpoint tree_of_graph (l : nat) k (c : comp_graph port) p : tree l k := match l as l0 return tree l0 k with | 0 => Frontier k | l'.+1 => let ep := edges c p in let en := \bigcup_(en in conodes c | ep \in en) en in Node [seq tree_of_graph l' (negk k) (switch c) p' | p' in en :\ ep] end.
imports: mathcomp(all_ssreflect ssralg fingroup zmodp poly ssrnum) mathcomp(matrix perm) ssr_ext ssralg_ext fdist subgraph_partition tanner