fact: Definition harray (sh : share) (contents : list heap_item) : val -> mpred := data_at sh (tarray t_struct_edge (Zlength contents)) (map heap_item_rep contents).
imports: VST.floyd.proofauto Coq.ZArith.ZArith CertiGraph.floyd_ext.closed_lemmas CertiGraph.kruskal.kruskal_edgelist RelationClasses CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel