HALOWERKDatenvertragswerk
mycielski construction edge lineage
From a supplied simple undirected graph with1..8vertices labelled0..n-1,construct one whole Mycielski lift with original vertices0..n-1,clone n+v for each vertexv and apex2n. Retain every originaledge{a,b},add both crossedges{a,n+b}and{b,n+a},then join everyclone toapex. Return all2n+1vertices and3m+nedges as canonical sortedpairs in lexicographic order,plus complete peredge role(original/cross/apex)and sourceedge or sourcevertex provenance. Source edges unordered/end orientation.
POST https://datenvertrag.halowerk.com/v1/mycielski-construction-edge-lineageEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | integer | Ja | |
| edges | Siehe Schema | Ja | |
| claimed_value | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"vertices": {
"type": "integer",
"minimum": 1,
"maximum": 8
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 28,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 2
}
},
{
"type": "null"
}
]
},
"claimed_value": {
"anyOf": [
{
"type": "object",
"properties": {
"source_vertices": {
"type": "integer",
"minimum": 1,
"maximum": 8
},
"vertices": {
"type": "integer",
"minimum": 3,
"maximum": 17
},
"apex": {
"type": "integer",
"minimum": 2,
"maximum": 16
},
"edge_count": {
"type": "integer",
"minimum": 1,
"maximum": 93
},
"edges": {
"type": "array",
"maxItems": 92,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"minItems": 2
}
},
"lineage": {
"type": "array",
"maxItems": 92,
"items": {
"type": "object",
"properties": {
"edge": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"minItems": 2
},
"role": {
"enum": [
"original",
"cross",
"apex"
]
},
"source_edge": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 2
},
{
"type": "null"
}
]
},
"source_vertex": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 7
},
{
"type": "null"
}
]
}
},
"required": [
"edge",
"role",
"source_edge",
"source_vertex"
],
"additionalProperties": false
}
}
},
"required": [
"source_vertices",
"vertices",
"apex",
"edge_count",
"edges",
"lineage"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"vertices",
"edges",
"claimed_value"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"vertices": 2,
"edges": [
[
0,
1
]
],
"claimed_value": {
"source_vertices": 2,
"vertices": 5,
"apex": 4,
"edge_count": 5,
"edges": [
[
0,
1
],
[
0,
3
],
[
1,
2
],
[
2,
4
],
[
3,
4
]
],
"lineage": [
{
"edge": [
0,
1
],
"role": "original",
"source_edge": [
0,
1
],
"source_vertex": null
},
{
"edge": [
0,
3
],
"role": "cross",
"source_edge": [
0,
1
],
"source_vertex": null
},
{
"edge": [
1,
2
],
"role": "cross",
"source_edge": [
0,
1
],
"source_vertex": null
},
{
"edge": [
2,
4
],
"role": "apex",
"source_edge": null,
"source_vertex": 0
},
{
"edge": [
3,
4
],
"role": "apex",
"source_edge": null,
"source_vertex": 1
}
]
}
}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