HALOWERKDatenvertragswerk
graph cutwidth optimal order inventory
For an original labelled simple undirected graph with0..6vertices, minimize over all vertexorders the maximum number of edges with exactly one endpoint in each prefix. Return exact cutwidth, ALLoptimal numeric-lexicographic vertexorders, their count and every prefix-cut size of the first optimum, including empty/fullprefix. Edges require0<=u<v<n and uniqueness. Emptygraph has width0,oneemptyorder andcutprofile[0]. Reference evaluates allpermutations directly; product subset minimax DP plus.
POST https://datenvertrag.halowerk.com/v1/graph-cutwidth-optimal-order-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| graph | Siehe Schema | Ja | |
| claimed_orders | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"graph",
"claimed_orders"
],
"properties": {
"graph": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"edges"
],
"properties": {
"vertices": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"edges": {
"type": "array",
"maxItems": 15,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
}
}
},
{
"type": "null"
}
]
},
"claimed_orders": {
"anyOf": [
{
"type": "array",
"maxItems": 720,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"graph": {
"vertices": 4,
"edges": [
[
0,
1
],
[
0,
2
],
[
1,
2
]
]
},
"claimed_orders": [
[
0,
1,
2,
3
],
[
0,
1,
3,
2
],
[
0,
2,
1,
3
],
[
0,
2,
3,
1
],
[
0,
3,
1,
2
],
[
0,
3,
2,
1
],
[
1,
0,
2,
3
],
[
1,
0,
3,
2
],
[
1,
2,
0,
3
],
[
1,
2,
3,
0
],
[
1,
3,
0,
2
],
[
1,
3,
2,
0
],
[
2,
0,
1,
3
],
[
2,
0,
3,
1
],
[
2,
1,
0,
3
],
[
2,
1,
3,
0
],
[
2,
3,
0,
1
],
[
2,
3,
1,
0
],
[
3,
0,
1,
2
],
[
3,
0,
2,
1
],
[
3,
1,
0,
2
],
[
3,
1,
2,
0
],
[
3,
2,
0,
1
],
[
3,
2,
1,
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