HALOWERKDatenvertragswerk
edge labelled line graph root inventory
Input1..5linevertices label the edges of unknownsimpleundirected rootgraph. Return ALLinverse roots modulo rootvertexrenaming, noisolatedinvisiblerootvertices; canonicalrootnodes are lexsorted incidenceblocks. Rootlist nestedlexsorted; wholeedge-labelled roots retained, includingtriangle/claw-rootambiguity and nonexistentroots. Claimcomparesrootcountonly. Nulladjacencies/claim unknown. Fixed.003USDC alsovalidunknown; no externalgraphclaim.
POST https://datenvertrag.halowerk.com/v1/edge-labelled-line-graph-root-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| line_vertices | integer | Ja | |
| adjacencies | Siehe Schema | Ja | |
| claimed_root_count | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"line_vertices",
"adjacencies",
"claimed_root_count"
],
"properties": {
"line_vertices": {
"type": "integer",
"minimum": 1,
"maximum": 5
},
"adjacencies": {
"anyOf": [
{
"type": "array",
"maxItems": 10,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
}
},
{
"type": "null"
}
]
},
"claimed_root_count": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 16
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"line_vertices": 3,
"adjacencies": [
[
0,
1
],
[
0,
2
],
[
1,
2
]
],
"claimed_root_count": 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