HALOWERKDatenvertragswerk
graph modular substitution ledger
For a supplied simple undirected graph on 1..6 labelled vertices, reconstruct every nonempty module and the complete strong-module tree, maximal children, parallel/series/prime quotient graphs and vertex memberships. Masks use bit i for vertex i, arrays sort numerically. Shared cograph union/join structure is retained; arbitrary non-cographs still yield prime substitution quotients. Claim checks total module count only; the whole structure is delivered. Missing edges or claim remains.
POST https://datenvertrag.halowerk.com/v1/graph-modular-substitution-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | integer | Ja | |
| edges | Siehe Schema | Ja | |
| claimed_module_count | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"edges",
"claimed_module_count"
],
"properties": {
"vertices": {
"type": "integer",
"minimum": 1,
"maximum": 6
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 15,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"u",
"v"
],
"properties": {
"u": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"v": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
}
},
{
"type": "null"
}
]
},
"claimed_module_count": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 63
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"vertices": 4,
"edges": [
{
"u": 0,
"v": 1
},
{
"u": 1,
"v": 2
},
{
"u": 2,
"v": 3
}
],
"claimed_module_count": 5
}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