Datenvertragswerk
rooted labelled euler circuit family
From one ordered list of 0..4 directed edge records on fixed vertex labels 0,1,2 (entry code 3*u+v means arc u->v), generates every rooted closed Euler replay as a sequence of original edge indices: start at 0, keep head-to-tail adjacency, end at 0 and use every record exactly once. Equal codes are distinct parallel edges; loops are allowed. Returns the sorted circuits and their count. No quotient by cyclic rotation, reversal or graph isomorphism.
POST https://datenvertrag.halowerk.com/v1/rooted-labelled-euler-circuit-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| edges | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"edges": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"circuits": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 24
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 30
}
},
"required": [
"circuits",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"edges",
"claim"
],
"additionalProperties": false
}Published input example
{
"edges": [],
"claim": {
"circuits": [
[]
],
"count": 1
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.