HALOWERKDatenvertragswerk
bipartite edge round synthesis audit
For two sides of1..4 vertices and0..8 supplied ordered edges, constructs lexicographically smallest restricted-growth minimum edgecolor vector, full originaledge index groups per round and both degreevectors. Edges sharing either endpoint never occupy the same round; parallel edges remain distinct. Minimumroundcount equals maximumdegree for this bipartite profile; empty graph has0rounds. This returns a complete witness rather than a coloring count. Claimed vector is compared wholly including.
POST https://datenvertrag.halowerk.com/v1/bipartite-edge-round-synthesis-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| left_size | integer | Ja | |
| right_size | integer | Ja | |
| edges | array | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"left_size": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"right_size": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"edges": {
"type": "array",
"maxItems": 8,
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"left": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"right": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"required": [
"left",
"right"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"claimed": {
"anyOf": [
{
"type": "array",
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
},
{
"type": "null"
}
]
}
},
"required": [
"left_size",
"right_size",
"edges",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"left_size": 2,
"right_size": 2,
"edges": [
{
"left": 0,
"right": 0
},
{
"left": 0,
"right": 1
},
{
"left": 1,
"right": 0
},
{
"left": 1,
"right": 1
}
],
"claimed": [
0,
1,
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