HALOWERKDatenvertragswerk
tree centroid branch ledger
For a supplied simple connected undirected tree on1..32vertices labelled0..n-1, return a complete per-vertex deletion ledger:each adjacent neighbor in ascending order and the remaining component size reached through it,largest component,minimum largest component over all vertices,and all ascending centroid IDs. A centroid leaves no branch larger than floor(n/2);full source labels retained. Own singleton extension explicitly returnsvertex0 withzero branches/zero balance. Edges are an.
POST https://datenvertrag.halowerk.com/v1/tree-centroid-branch-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | integer | Ja | |
| edges | Siehe Schema | Ja | |
| claimed_value | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"vertices": {
"type": "integer",
"minimum": 1,
"maximum": 32
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 31,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"minItems": 2
}
},
{
"type": "null"
}
]
},
"claimed_value": {
"anyOf": [
{
"type": "object",
"properties": {
"vertices": {
"type": "integer",
"minimum": 1,
"maximum": 32
},
"half_limit": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"min_largest_component": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"centroids": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
}
},
"ledger": {
"type": "array",
"maxItems": 32,
"items": {
"type": "object",
"properties": {
"vertex": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"largest_component": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"branches": {
"type": "array",
"maxItems": 31,
"items": {
"type": "object",
"properties": {
"via_neighbor": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"size": {
"type": "integer",
"minimum": 1,
"maximum": 31
}
},
"required": [
"via_neighbor",
"size"
],
"additionalProperties": false
}
}
},
"required": [
"vertex",
"largest_component",
"branches"
],
"additionalProperties": false
}
}
},
"required": [
"vertices",
"half_limit",
"min_largest_component",
"centroids",
"ledger"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"vertices",
"edges",
"claimed_value"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"vertices": 4,
"edges": [
[
0,
1
],
[
1,
2
],
[
2,
3
]
],
"claimed_value": {
"vertices": 4,
"half_limit": 2,
"min_largest_component": 2,
"centroids": [
1,
2
],
"ledger": [
{
"vertex": 0,
"largest_component": 3,
"branches": [
{
"via_neighbor": 1,
"size": 3
}
]
},
{
"vertex": 1,
"largest_component": 2,
"branches": [
{
"via_neighbor": 0,
"size": 1
},
{
"via_neighbor": 2,
"size": 2
}
]
},
{
"vertex": 2,
"largest_component": 2,
"branches": [
{
"via_neighbor": 1,
"size": 2
},
{
"via_neighbor": 3,
"size": 1
}
]
},
{
"vertex": 3,
"largest_component": 3,
"branches": [
{
"via_neighbor": 2,
"size": 3
}
]
}
]
}
}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