HALOWERKDatenvertragswerk
reduced adjacent swap word inventory
For a complete permutation of0..n-1,n0..5, construct ALL shortest words of adjacent POSITION swaps which sort it to identity. Each word lists zero-based left positions, applied left-to-right to the supplied source permutation. Return numeric-lexsorted whole word inventory, exact minimum swap length, exact word count and the complete permutation-state trace of the first word. Empty/identity permutations have one empty word. Compare both supplied count and minimum-length claim by field name;.
POST https://datenvertrag.halowerk.com/v1/reduced-adjacent-swap-word-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| permutation | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"permutation",
"claim"
],
"properties": {
"permutation": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"uniqueItems": true
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"minimum_swaps",
"word_count"
],
"properties": {
"minimum_swaps": {
"type": "integer",
"minimum": 0,
"maximum": 10
},
"word_count": {
"type": "integer",
"minimum": 1,
"maximum": 1000
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"permutation": [
2,
1,
0
],
"claim": {
"minimum_swaps": 3,
"word_count": 2
}
}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