fact: Definition gc_graph_iso (g1: LGraph) (roots1: roots_t) (g2: LGraph) (roots2: roots_t): Prop := let vertices1 := filter_sum_right roots1 in let vertices2 := filter_sum_right roots2 in let sub_g1 := reachable_sub_labeledgraph g1 vertices1 in let sub_g2 := reachable_sub_labeledgraph g2 vertices2 in exists vmap12 vmap21 emap12 emap21, roots2 = map (root_map vmap12) roots1 /\ label_preserving_graph_isomorphism_explicit sub_g1 sub_g2 vmap12 vmap21 emap12 emap21.
imports: Coq.ZArith.ZArith Coq.Program.Basics compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph