(*s Adding a lis of adresses connected to [root] with weight $0$ *)

Fixpoint CG_add_root (root : ad) (cg : CGraph1) (l : list ad) {struct l} :
 CGraph1 :=
  match l with
  | nil => cg
  | x :: l' => CG_add_root root (CG_add cg root x Dz) l'
  end.

Theorem CG_circuit_complete : forall cg : CGraph1, (forall (x : ad) (d : D) (l : list ad), CG_path cg x d (x :: l) -> Dle Dz d = true) -> CGconsistent cg.