Construct the COMPLETE GEODESIC CONVEX HULL H_G(S) of ONE independently supplied...
https://datenvertrag.halowerk.com/v1/geodesic-seed-hull-ledgerOverview
Construct the COMPLETE GEODESIC CONVEX HULL H_G(S) of ONE independently supplied original seed vertex set S in a connected simple undirected labelled graph G. Original n=1..4, labels0..n-1, edge_mask uses lexicographic pairs(0,1),(0,2),...,(n-2,n-1); seed_mask bitv denotes original vertexv. H is the smallest superset of S closed under EVERY vertex on EVERY shortest path between EACH pair of its vertices; apply closure to fixedpoint, not arbitrary single shortest paths.