fact: Definition fill_edge_spec := DECLARE _fill_edge WITH sh: share, ptr: val, w: val, u: val, v: val, rubbish: reptype t_struct_edge PRE [tptr t_struct_edge, tint, tint, tint] PROP (writable_share sh; def_wedgerep (w,(u,v))) PARAMS (ptr; w; u; v) GLOBALS () SEP (data_at sh t_struct_edge rubbish ptr) POST [ tvoid ] PROP () LOCAL () SEP (data_at sh t_struct_edge (w, (u, v)) ptr).
imports: CertiGraph.unionfind.env_unionfind_arr CertiGraph.unionfind.uf_arr_specs VST.floyd.library RelationClasses CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel Sorting CertiGraph.kruskal.WeightedEdgeListGraph CertiGraph.kruskal.env_kruskal_edgelist CertiGraph.kruskal.spatial_wedgearray_graph CertiGraph.graph.graph_model CertiGraph.floyd_ext.share