HALOWERKDatenvertragswerk
optimal key search tree audit
Own exact intervalDP on ordered keyranks0..n-1,n<=8. Keys are INTERNAL successnodes with rootdepth/comparisoncost1, not ordered leafdecisiontree. Return minimumweightedcost,countalloptimalBSTshapes,lexleastpreorder,parents,comparisondepths,perkeycontributions and normalizedmeanifweighttotal>0. Successfulaccess weights only,no missgap model,rotations or realperformance. Missingweight/claim unknown; invalid profile native400 before settlement. Fixed0.003USDC also for schema-valid unknown..
POST https://datenvertrag.halowerk.com/v1/optimal-key-search-tree-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed | Siehe Schema | Ja | |
| weights | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"optimal_tree_count": {
"maximum": 1430,
"minimum": 1,
"type": "integer"
},
"preorder": {
"items": {
"maximum": 7,
"minimum": 0,
"type": "integer"
},
"maxItems": 8,
"type": "array"
},
"weighted_cost": {
"maximum": 36000000,
"minimum": 0,
"type": "integer"
}
},
"required": [
"weighted_cost",
"optimal_tree_count",
"preorder"
],
"type": "object"
},
{
"type": "null"
}
]
},
"weights": {
"items": {
"anyOf": [
{
"maximum": 1000000,
"minimum": 0,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 8,
"type": "array"
}
},
"required": [
"weights",
"claimed"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed": {
"optimal_tree_count": 1,
"preorder": [
1,
0,
2
],
"weighted_cost": 5
},
"weights": [
1,
1,
1
]
}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