HALOWERKDatenvertragswerk
gomory hu cut tree ledger
From an original symmetric loopless capacity matrix on1..5labelled vertices, capacities0..9 including disconnected graphs, synthesize a deterministic Gomory-Hu cut-equivalent tree, all-pairs minimum-cut values and every tree-edge fundamental partition/crossing-edge capacity witness. Root0; processsources1..n-1, use inclusion-minimal source-side minimumcut and standard parentupdates. Return tree rows ordered by child. Onevertex has emptytree; zero edges retain zero mincuts. Whole claimedtree.
POST https://datenvertrag.halowerk.com/v1/gomory-hu-cut-tree-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | integer | Ja | |
| capacities | Siehe Schema | Ja | |
| claimed_tree | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"capacities",
"claimed_tree"
],
"properties": {
"vertices": {
"type": "integer",
"minimum": 1,
"maximum": 5
},
"capacities": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 9
}
}
},
{
"type": "null"
}
]
},
"claimed_tree": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"child",
"parent",
"capacity"
],
"properties": {
"child": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"parent": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"capacity": {
"type": "integer",
"minimum": 0,
"maximum": 36
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"vertices": 3,
"capacities": [
[
0,
1,
1
],
[
1,
0,
1
],
[
1,
1,
0
]
],
"claimed_tree": [
{
"child": 1,
"parent": 0,
"capacity": 2
},
{
"child": 2,
"parent": 0,
"capacity": 2
}
]
}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