Steinhaus–Johnson–Trotter algorithm
id:
steinhaus-johnson-trotter-algorithm-181-7680551
title:
Steinhaus–Johnson–Trotter algorithm
text:
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of n elements. Each two adjacent permutations in the resulting sequence differ by swapping two adjacent permuted elements. Equivalently, this algorithm finds a Hamiltonian cycle in the permutohedron, a polytope whose vertices represent permutations and whose edges represent swaps.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm
date created:
2005-08-29T16:38:30Z
date modified:
2024-09-05T23:11:01Z
main entity:
{"identifier":"Q4925248","url":"https://www.wikidata.org/entity/Q4925248"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/78/Symmetric_group_4%3B_Cayley_graph_1%2C2%2C6_%283D%29%3B_Steinhaus%E2%80%93Johnson%E2%80%93Trotter.svg","width":744,"height":744}
fields total:
13
integrity:
15