ambit2.smarts

Class ChiralPermutations

java.lang.Object

ambit2.smarts.ChiralPermutations

public class ChiralPermutations
extends Object

Field Summary

Fields

Modifier and Type	Field and Description
static int[]	basic4Permutation

Constructor Summary

Constructors

Constructor and Description
ChiralPermutations()

Method Summary

Modifier and Type	Method and Description
static int	getNumOfPairSwitches(int[] permutation1, int[] permutation2) Calculates the number of pair switches needed to obtain permutation2 starting from permutation1 The number is not unique (since various paths are possible), but the parity (even/odd) of the switches number must always be the same
static int	getPos(int value, int[] array)
static void	move(int startPos, int endPos, int[] array)
static String	permutationToString(int[] p)
static void	switchPos(int pos1, int pos2, int[] array)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

basic4Permutation

public static final int[] basic4Permutation

Constructor Detail

ChiralPermutations

public ChiralPermutations()

Method Detail

getNumOfPairSwitches

public static int getNumOfPairSwitches(int[] permutation1,
                                       int[] permutation2)

Calculates the number of pair switches needed to obtain permutation2 starting from permutation1 The number is not unique (since various paths are possible), but the parity (even/odd) of the switches number must always be the same

Parameters:

permutation1 -

permutation2 -

Returns:

number of pair switches

switchPos

public static void switchPos(int pos1,
                             int pos2,
                             int[] array)

getPos

public static int getPos(int value,
                         int[] array)

move

public static void move(int startPos,
                        int endPos,
                        int[] array)

permutationToString

public static String permutationToString(int[] p)