HALOWERKDatenvertragswerk
graph burning optimal sequence inventory
For an original simple undirected labelled graph on0..6vertices, return its minimum number of burning rounds and ALLoptimal ordered sourcevertex sequences in numeric lexicographic order. Eachround chooses one vertex unburned at START of round, while vertices burned in preceding rounds spread to neighbors; the justselected source does not spread until next round. Originaledges require0<=u<v<n,no duplicates. Emptygraph convention number0 andoneemptysequence. Disconnectedgraphs accepted..
POST https://datenvertrag.halowerk.com/v1/graph-burning-optimal-sequence-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| graph | Siehe Schema | Ja | |
| claimed_sequences | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"graph",
"claimed_sequences"
],
"properties": {
"graph": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"edges"
],
"properties": {
"vertices": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"edges": {
"type": "array",
"maxItems": 15,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
}
}
},
{
"type": "null"
}
]
},
"claimed_sequences": {
"anyOf": [
{
"type": "array",
"maxItems": 720,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"graph": {
"vertices": 4,
"edges": [
[
0,
1
],
[
1,
2
],
[
2,
3
]
]
},
"claimed_sequences": [
[
1,
3
],
[
2,
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