fact: Definition decompL (G:sgraph) (D : T -> {set G}) A a := match a with Some x => D x | None => A end.
imports: Coq(RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone preliminaries digraph sgraph) GraphTheory(connectivity set_tac)