Permutation Class

public sealed class Permutation : IEquatable<Permutation>, 
	IFormattable

Public NotInheritable Class Permutation
	Implements IEquatable(Of Permutation), IFormattable

public ref class Permutation sealed : IEquatable<Permutation^>, 
	IFormattable

[<SealedAttribute>]
type Permutation = 
    class
        interface IEquatable<Permutation>
        interface IFormattable
    end

Inheritance

Object    Permutation

Implements

IEquatablePermutation, IFormattable

A permutation of dimension D is a re-ordering a set of D distinguishable objects. The most obvious application of permutations in programming is to re-order the elements of an ordered set, but the applications in applied and theoretical mathematics are vast.

You can instantiate a new permutation from its map or cycle notation using the Parse(String) or TryParse(String, Permutation) methods. You can enumerate all permutations of a given dimension using the GetPermutations(Int32) method, or get a random one of a given dimension using GetRandomPermutation(Int32, Random).

Once you have a permutation instance in hand, you can examine its properties (e.g. Order and IsDerangement), obtain its inverse (using Inverse), or combine it with another perumtation using group multiplication (Multiply(Permutation, Permutation)). You can also apply it (in-place!) to any IListT using ApplyT(IListT).

Reference

Other Resources