For an original simple undirected labelled graph on0..6vertices, return its mini...
https://datenvertrag.halowerk.com/v1/graph-burning-optimal-sequence-inventoryOverview
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.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
datenvertrag
Source
bazaar
Indexed
2026-11-05 13:37:29
Health
Status
unknown
Latency (p50)
—
Uptime (30d)
—
Reliability Score
—
Last Checked
Never
Last Healthy
Never
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
—
Asset Verified
—
Facilitator
—
Input Schema
{
"body": {
"claimed_sequences": [
[
1,
3
],
[
2,
0
]
],
"graph": {
"edges": [
[
0,
1
],
[
1,
2
],
[
2,
3
]
],
"vertices": 4
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}