HALOWERKDatenvertragswerk
vertex deck reconstruction family
From n0..5 and a complete multiset of exactlyn unlabelled (n-1)-vertex graphcards, construct ALL labelled simple undirected graphs on0..n-1 with that vertex-deleted deck. Graphcode is adjacencybitmask for unorderedpairs(0,1),(0,2),. lexicographically, leastsignificantbit first. Each suppliedcard must use its minimum code under all vertexpermutations; cardorder irrelevant, multiplicities retained. Return ascending full graphcodefamily and everyedgeobject, plus all minimum-code.
POST https://datenvertrag.halowerk.com/v1/vertex-deck-reconstruction-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | Siehe Schema | Ja | |
| deck | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"deck",
"claim"
],
"properties": {
"vertices": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 5
},
{
"type": "null"
}
]
},
"deck": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 1024,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1023
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"vertices": 2,
"deck": [
0,
0
],
"claim": [
0,
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