HALOWERKDatenvertragswerk
exact treedepth parent witness
For an original labelled simple undirected graph n0..5, connected when nonempty, derive exact treedepth: minimum root-leaf NODEcount among rooted trees whose ancestor closure contains every inputedge. Return lexicographically least parentvector among ALL minimum-height valid rooted trees, pervertex depth and complete ancestor-closure edges. Parents use vertexlabels0..n-1 and root-1; parent edges need not be graph edges. Extra cross-component ancestorrelations are allowed when they preserve.
POST https://datenvertrag.halowerk.com/v1/exact-treedepth-parent-witnessEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| graph | Siehe Schema | Ja | |
| claimed_parent | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"graph",
"claimed_parent"
],
"properties": {
"graph": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges"
],
"properties": {
"n": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"edges": {
"type": "array",
"maxItems": 10,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2
}
}
}
},
{
"type": "null"
}
]
},
"claimed_parent": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": -1,
"maximum": 4
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"graph": {
"n": 5,
"edges": [
[
0,
1
],
[
1,
2
],
[
2,
3
],
[
3,
4
]
]
},
"claimed_parent": [
1,
-1,
3,
1,
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