Maximal Condorcet Domain Explorer

Explore maximal Condorcet domains as adjacent-swap graphs. Each node is one permutation; edges connect permutations that differ by a single adjacent transposition.

Adjacent-Swap Graph
layout labels colors size edges
Load data to draw a graph.
Two nodes are adjacent exactly when one permutation is obtained from the other by swapping one neighboring pair.
Permutations in Current Domain
No domain loaded.
Neighbors of Selected Permutation
Select a node to inspect its adjacent neighbors.