HALOWERKDatenvertragswerk
graph local complementation orbit
For a fully captured simple undirected graph on n1..5 original labels0..n-1, edge_mask bitk encodes the kth pair(i,j),i<j, in numeric lexicographic order. A local complement at vertexv toggles EVERY edge between two DISTINCT current neighbors ofv, leaving all other adjacencies unchanged. Generate ALL labelled graphs reachable by any finite sequence of these operations; no vertex deletion, relabeling or isomorphism quotient. Return ascending whole graph codes, count, minimum_code, and aligned.
POST https://datenvertrag.halowerk.com/v1/graph-local-complementation-orbitEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| edge_mask | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 5
},
{
"type": "null"
}
]
},
"edge_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1023
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"codes": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1023
},
"minItems": 1,
"maxItems": 132
},
"words": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 5
},
"minItems": 1,
"maxItems": 132
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 132
},
"minimum_code": {
"type": "integer",
"minimum": 0,
"maximum": 1023
}
},
"required": [
"codes",
"words",
"count",
"minimum_code"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edge_mask",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"n": 1,
"edge_mask": 0,
"claim": {
"codes": [
0
],
"words": [
[]
],
"count": 1,
"minimum_code": 0
}
}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