fact: Record connector (A B : {set G}) n (p : 'I_n -> pathS G) : Prop := { conn_irred : forall i, irred (tagged (p i)); conn_begin : forall i, [set x in p i] :&: A = [set fst (p i)]; conn_end : forall i, [set x in p i] :&: B = [set lst (p i)]; conn_disjoint : forall i j, i != j -> [set x in p i] :&: [set x in p j] = set0 }.
imports: mathcomp(all_ssreflect) GraphTheory(edone preliminaries digraph mgraph sgraph set_tac)