This function checks if a given Switch is bijective. This is done via checking that the order of the codomain is the same as the order of the domain of the function.
Usage
check_permutations(B)
Arguments
B
All elements in set after up/down operation.
Value
TRUE/FALSE
Details
checks that the number of unique words of length 2 in the set is the same after up/down operation as before.