fact: Definition add_edge' (G : pre_graph) (e:ET) x u y := {| vset := vset G; eset := e |` eset G; endpt b := update (endpt G b) e (if b then y else x); lv := lv G; le := update (le G) e u; p_in := p_in G; p_out := p_out G |}.
imports: HB(structures) Coq(Relation_Definitions Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom rewriting) GraphTheory(finmap_plus)