HALOWERKDatenvertragswerk
edge magic total labeling family
For a supplied labeled simple undirected graph with n2..4 vertices0..n-1 and m1..3 original edges, synthesize ALL bijections of the JOINT vertex-and-edge set onto integerlabels1..n+m whose vertexlabel(u)+edgelabel(uv)+vertexlabel(v) is the SAME constant for EVERY originaledge. Input edges are unique lexsorted pairs u<v<n. Each full labeling row is [all n vertexlabels in vertexorder, then all m edgelabels in originaledgeorder], full family numeric-lex sorted. Return all rows, aligned per-edge.
POST https://datenvertrag.halowerk.com/v1/edge-magic-total-labeling-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | integer, null | Ja | |
| edges | Siehe Schema | Ja | |
| claimed_labelings | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges",
"claimed_labelings"
],
"properties": {
"n": {
"type": [
"integer",
"null"
],
"minimum": 2,
"maximum": 4
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 3,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2
},
"minItems": 1
},
{
"type": "null"
}
]
},
"claimed_labelings": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 4,
"edges": [
[
0,
1
],
[
1,
2
],
[
2,
3
]
],
"claimed_labelings": [
[
1,
3,
2,
4,
7,
6,
5
],
[
1,
3,
2,
5,
7,
6,
4
],
[
1,
5,
3,
2,
6,
4,
7
],
[
1,
5,
3,
7,
6,
4,
2
],
[
1,
5,
6,
3,
7,
2,
4
],
[
1,
5,
6,
4,
7,
2,
3
],
[
1,
6,
2,
3,
5,
4,
7
],
[
1,
6,
2,
7,
5,
4,
3
],
[
1,
7,
4,
3,
5,
2,
6
],
[
1,
7,
4,
6,
5,
2,
3
],
[
2,
3,
5,
1,
7,
4,
6
],
[
2,
3,
5,
6,
7,
4,
1
],
[
2,
4,
1,
3,
5,
6,
7
],
[
2,
4,
1,
7,
5,
6,
3
],
[
2,
7,
1,
5,
3,
4,
6
],
[
2,
7,
1,
6,
3,
4,
5
],
[
3,
1,
4,
2,
7,
6,
5
],
[
3,
1,
4,
5,
7,
6,
2
],
[
3,
2,
6,
1,
7,
4,
5
],
[
3,
2,
6,
5,
7,
4,
1
],
[
3,
4,
7,
1,
6,
2,
5
],
[
3,
4,
7,
5,
6,
2,
1
],
[
3,
6,
5,
1,
4,
2,
7
],
[
3,
6,
5,
7,
4,
2,
1
],
[
3,
7,
1,
5,
2,
4,
6
],
[
3,
7,
1,
6,
2,
4,
5
],
[
4,
2,
3,
1,
5,
6,
7
],
[
4,
2,
3,
7,
5,
6,
1
],
[
4,
6,
5,
1,
3,
2,
7
],
[
4,
6,
5,
7,
3,
2,
1
],
[
5,
1,
7,
2,
6,
4,
3
],
[
5,
1,
7,
3,
6,
4,
2
],
[
5,
2,
3,
1,
4,
6,
7
],
[
5,
2,
3,
7,
4,
6,
1
],
[
5,
4,
1,
3,
2,
6,
7
],
[
5,
4,
1,
7,
2,
6,
3
],
[
5,
6,
2,
3,
1,
4,
7
],
[
5,
6,
2,
7,
1,
4,
3
],
[
5,
7,
4,
3,
1,
2,
6
],
[
5,
7,
4,
6,
1,
2,
3
],
[
6,
1,
7,
2,
5,
4,
3
],
[
6,
1,
7,
3,
5,
4,
2
],
[
6,
4,
7,
1,
3,
2,
5
],
[
6,
4,
7,
5,
3,
2,
1
],
[
6,
5,
3,
2,
1,
4,
7
],
[
6,
5,
3,
7,
1,
4,
2
],
[
7,
1,
4,
2,
3,
6,
5
],
[
7,
1,
4,
5,
3,
6,
2
],
[
7,
2,
6,
1,
3,
4,
5
],
[
7,
2,
6,
5,
3,
4,
1
],
[
7,
3,
2,
4,
1,
6,
5
],
[
7,
3,
2,
5,
1,
6,
4
],
[
7,
3,
5,
1,
2,
4,
6
],
[
7,
3,
5,
6,
2,
4,
1
],
[
7,
5,
6,
3,
1,
2,
4
],
[
7,
5,
6,
4,
1,
2,
3
]
]
}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