Skip to content
HALOWERK

Datenvertragswerk

geodesic seed hull ledger

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. Empty seed has empty.

POST https://datenvertrag.halowerk.com/v1/geodesic-seed-hull-ledger

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
nSee schemaYes
edge_maskSee schemaYes
seed_maskSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "n": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 1,
          "maximum": 4
        },
        {
          "type": "null"
        }
      ]
    },
    "edge_mask": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 63
        },
        {
          "type": "null"
        }
      ]
    },
    "seed_mask": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 15
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 15
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "n",
    "edge_mask",
    "seed_mask",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "n": 1,
  "edge_mask": 0,
  "seed_mask": 0,
  "claim": 0
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’