HALOWERKDatenvertragswerk
global minimum edge cut family
For a fully captured simple undirected graph on2..5 labels0..n-1, reconstruct ALL bipartitions minimizing crossing-edge COUNT. Every proper nonempty side is represented once by its vertex-bitmask containing vertex0; masks sort ascending. Return edge_order sorted by(u,v), minimum_size, all cut objects with side_mask and complete ascending crossing_edge_indices into edge_order, and count. Input edges require u<v and no duplicates; input edge-list order is irrelevant. Complement is all_vertices.
POST https://datenvertrag.halowerk.com/v1/global-minimum-edge-cut-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| edges | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 2,
"maximum": 5
},
{
"type": "null"
}
]
},
"edges": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 10
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"edge_order": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 10
},
"minimum_size": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"cuts": {
"type": "array",
"items": {
"type": "object",
"properties": {
"side_mask": {
"type": "integer",
"minimum": 1,
"maximum": 30
},
"crossing_edge_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 9
},
"minItems": 0,
"maxItems": 4
}
},
"required": [
"side_mask",
"crossing_edge_indices"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 15
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 15
}
},
"required": [
"edge_order",
"minimum_size",
"cuts",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edges",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"n": 2,
"edges": [],
"claim": {
"edge_order": [],
"minimum_size": 0,
"cuts": [
{
"side_mask": 1,
"crossing_edge_indices": []
}
],
"count": 1
}
}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