HALOWERKDatenvertragswerk
integral maximum flow family
For FIXED directed vertices0,1,2,3 with source0/sink3, originalcapacity_mask encodes all12nonlooparcs (u,v) in increasingu thenincreasingv, bit0=(0,1),bit1=(0,2),bit2=(0,3),bit3=(1,0),.,bit11=(3,2). Presentarc has capacity1, absentarc capacity0. Generate EVERY feasible integer GROSS arcflow maximizing NETsourceoutflow out(0)-in(0). Internalvertices1,2 conserve flow; source/sink balance oppositely. Each flow_mask uses exactly the same12arcbitpositions and records every originalarc.
POST https://datenvertrag.halowerk.com/v1/integral-maximum-flow-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| capacity_mask | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"capacity_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4095
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"flow_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4095
},
"minItems": 1,
"maxItems": 4096
},
"maximum_value": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 4096
}
},
"required": [
"flow_masks",
"maximum_value",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"capacity_mask",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"capacity_mask": 0,
"claim": {
"flow_masks": [
0
],
"maximum_value": 0,
"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