Datenvertragswerk
synchronizing road coloring family
For one FULLY CAPTURED directed multigraph on original vertices0..n-1,n1..3, with EXACTLY TWO outgoing EDGE RECORDS per vertex, generate EVERY SYNCHRONIZING ROAD COLORING by alphabet a=0,b=1. Input targets[v] lists the two record targets in NONDECREASING order, each in0..n-1. Record identities are (v,slot0/1), including equal-target parallel records; loops allowed. Coloring mask bitv=0 assigns a to slot0 and b to slot1; bitv=1 swaps them. Return colorings sorted by mask, each with full.
POST https://datenvertrag.halowerk.com/v1/synchronizing-road-coloring-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| targets | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"targets": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"colorings": {
"type": "array",
"items": {
"type": "object",
"properties": {
"mask": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 3
},
"word": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 6
}
},
"required": [
"mask",
"transitions",
"word"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 8
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 8
}
},
"required": [
"colorings",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"targets",
"claim"
],
"additionalProperties": false
}Published input example
{
"targets": [
[
0,
0
]
],
"claim": {
"colorings": [
{
"mask": 0,
"transitions": [
[
0,
0
]
],
"word": []
},
{
"mask": 1,
"transitions": [
[
0,
0
]
],
"word": []
}
],
"count": 2
}
}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.