HALOWERKDatenvertragswerk
prufer tree reconstruction audit
Own bounded Prufer bijection decoder on labels0..n-1,n2..32. Return all canonical undirected edges, original degrees and smallest-leaf elimination trace, then compare whole claimed edge multiset ignoring endpoint orientation/list order. Duplicate claimed edges remain mismatches. Missing symbol prevents whole reconstruction; absent claim leaves decoded tree with unknown. No graphlibrary or program execution. Fixed0.003USDC also for schema-valid unknown; invalid profile native400 before.
POST https://datenvertrag.halowerk.com/v1/prufer-tree-reconstruction-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_edges | Siehe Schema | Ja | |
| n | integer | Ja | |
| sequence | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_edges": {
"anyOf": [
{
"items": {
"additionalProperties": false,
"properties": {
"u": {
"maximum": 31,
"minimum": 0,
"type": "integer"
},
"v": {
"maximum": 31,
"minimum": 0,
"type": "integer"
}
},
"required": [
"u",
"v"
],
"type": "object"
},
"maxItems": 64,
"type": "array"
},
{
"type": "null"
}
]
},
"n": {
"maximum": 32,
"minimum": 2,
"type": "integer"
},
"sequence": {
"items": {
"anyOf": [
{
"maximum": 31,
"minimum": 0,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 30,
"type": "array"
}
},
"required": [
"n",
"sequence",
"claimed_edges"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_edges": [
{
"u": 0,
"v": 4
},
{
"u": 1,
"v": 4
},
{
"u": 2,
"v": 4
},
{
"u": 3,
"v": 4
}
],
"n": 5,
"sequence": [
4,
4,
4
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden