HALOWERKDatenvertragswerk
degree sequence realization inventory
For 0 to 6 labelled vertices, enumerate all simple undirected graphs realizing the complete vertex-indexed degree vector. Vertex labels are preserved; no isomorphism quotient or degree sorting. Return ascending edge masks, every canonical edge pair and every connected component ordered by minimum vertex. Bit i corresponds to the ith lexicographic pair(u,v),u<v. Return count, graphical flag and degree sum. A valid nongraphical degree vector returns an empty family; the empty graph on zero.
POST https://datenvertrag.halowerk.com/v1/degree-sequence-realization-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | integer | Ja | |
| degrees | Siehe Schema | Ja | |
| claimed_masks | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"degrees",
"claimed_masks"
],
"properties": {
"vertices": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"degrees": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
},
{
"type": "null"
}
]
},
"claimed_masks": {
"anyOf": [
{
"type": "array",
"maxItems": 70,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 32767
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"vertices": 4,
"degrees": [
2,
2,
2,
2
],
"claimed_masks": [
30,
45,
51
]
}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