HALOWERKDatenvertragswerk
perfect elimination order family
For one FULLY CAPTURED labelled simple undirected graph n0..5 on0..n-1, reconstruct EVERY PERFECT ELIMINATION ORDER of its ORIGINAL vertices without adding graph edges. edge_mask bitk encodes pair(u,v),u<v, in numeric lexorder. An order P deletes P[0] first; for each deletedvertex v, its ORIGINAL neighbors still present later in P must form a clique. Empty or singleton later-neighborhood is a clique. Return all orders in numeric lexicographic order, aligned later_neighbor_masks[row][step].
POST https://datenvertrag.halowerk.com/v1/perfect-elimination-order-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| edge_mask | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 5
},
{
"type": "null"
}
]
},
"edge_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1023
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"orders": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 5
},
"minItems": 0,
"maxItems": 128
},
"later_neighbor_masks": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"minItems": 0,
"maxItems": 5
},
"minItems": 0,
"maxItems": 128
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 128
},
"chordal": {
"type": "boolean"
}
},
"required": [
"orders",
"later_neighbor_masks",
"count",
"chordal"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edge_mask",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"n": 0,
"edge_mask": 0,
"claim": {
"orders": [
[]
],
"later_neighbor_masks": [
[]
],
"count": 1,
"chordal": true
}
}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