HALOWERKDatenvertragswerk
graph relabeling orbit stabilizer
For an original labelled simple undirected graph n1..5 with vertices0..n-1, construct EVERY distinct graph obtained by permuting vertex labels, every automorphism as a full old-to-new vertex map, and the whole vertex-orbit partition. Return sorted orbit codes, minimumcode representative, orbit size, sorted automorphism maps/order and n! relabelinggroup order. Encode uppertriangle pairs (0,1),(0,2),.,(n-2,n-1) in lexicographic order as bits starting at2^0; no edge labels/loops/multiedges..
POST https://datenvertrag.halowerk.com/v1/graph-relabeling-orbit-stabilizerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | integer, null | Ja | |
| edges | Siehe Schema | Ja | |
| claimed_artifact | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges",
"claimed_artifact"
],
"properties": {
"n": {
"type": [
"integer",
"null"
],
"minimum": 1,
"maximum": 5
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 10,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2
}
},
{
"type": "null"
}
]
},
"claimed_artifact": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"orbit_codes",
"canonical_code",
"orbit_size",
"automorphisms",
"automorphism_order",
"vertex_orbits",
"group_order"
],
"properties": {
"orbit_codes": {
"type": "array",
"maxItems": 120,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1023
}
},
"canonical_code": {
"type": "integer",
"minimum": 0,
"maximum": 1023
},
"orbit_size": {
"type": "integer",
"minimum": 0,
"maximum": 120
},
"automorphisms": {
"type": "array",
"maxItems": 120,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1
}
},
"automorphism_order": {
"type": "integer",
"minimum": 0,
"maximum": 120
},
"vertex_orbits": {
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
}
},
"group_order": {
"type": "integer",
"minimum": 0,
"maximum": 120
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 5,
"edges": [
[
0,
1
],
[
0,
4
],
[
1,
2
],
[
2,
3
],
[
3,
4
]
],
"claimed_artifact": {
"orbit_codes": [
220,
234,
316,
358,
425,
453,
570,
598,
665,
707,
789,
803
],
"canonical_code": 220,
"orbit_size": 12,
"automorphisms": [
[
0,
1,
2,
3,
4
],
[
0,
4,
3,
2,
1
],
[
1,
0,
4,
3,
2
],
[
1,
2,
3,
4,
0
],
[
2,
1,
0,
4,
3
],
[
2,
3,
4,
0,
1
],
[
3,
2,
1,
0,
4
],
[
3,
4,
0,
1,
2
],
[
4,
0,
1,
2,
3
],
[
4,
3,
2,
1,
0
]
],
"automorphism_order": 10,
"vertex_orbits": [
[
0,
1,
2,
3,
4
]
],
"group_order": 120
}
}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