Datenvertragswerk
graph minimum retraction family
For an original labelled simple undirected graph on1..5 vertices0..n-1, construct ALL smallest induced vertex subsets admitting a graph homomorphism retraction: every edge maps to an original edge and every image vertex is fixed. Return minimum image order, every optimum image vertex list, every full vertex-indexed idempotent edge-preserving map, image count and total map count. Edges must be unique sorted pairs u<v in lexicographic order. Images and maps are lexicographically sorted; arrays.
POST https://datenvertrag.halowerk.com/v1/graph-minimum-retraction-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | integer, null | Ja | |
| edges | Siehe Schema | Ja | |
| claimed_images | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges",
"claimed_images"
],
"properties": {
"n": {
"type": [
"integer",
"null"
],
"minimum": 1,
"maximum": 5
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 10,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2
}
},
{
"type": "null"
}
]
},
"claimed_images": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"retractions"
],
"properties": {
"vertices": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1
},
"retractions": {
"type": "array",
"maxItems": 128,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 5,
"edges": [
[
0,
1
],
[
0,
4
],
[
1,
2
],
[
2,
3
],
[
3,
4
]
],
"claimed_images": [
{
"vertices": [
0,
1,
2,
3,
4
],
"retractions": [
[
0,
1,
2,
3,
4
]
]
}
]
}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