HALOWERKDatenvertragswerk
strong orientation family
For a fully captured simple undirected graph on1..4 original labels0..n-1, construct ALL orientations in which every vertex can reach every other by directed paths. Return lexicographically sorted edge_order(u<v), ascending orientation_masks, count and aligned complete outdegree vectors. Bit i0 orients edge_order[i] from u to v; bit1 reverses it. Input edge order is irrelevant, duplicatepairs/reversed endpoints invalid. A singleton has one empty orientation mask0/outdegrees[0]; disconnected.
POST https://datenvertrag.halowerk.com/v1/strong-orientation-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| edges | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"edges": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"edge_order": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 6
},
"orientation_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"minItems": 0,
"maxItems": 64
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 64
},
"outdegrees": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 0,
"maxItems": 64
}
},
"required": [
"edge_order",
"orientation_masks",
"count",
"outdegrees"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edges",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"n": 1,
"edges": [],
"claim": {
"edge_order": [],
"orientation_masks": [
0
],
"count": 1,
"outdegrees": [
[
0
]
]
}
}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