Package org.knime.base.node.preproc.shuffle

Implementation of the Fisher Yates shuffle, that guarantees that all n! possible outcomes are possible and equally likely.

See:
          Description

Class Summary
ShuffleNodeDialogPane Dialog to enter a seed.
ShuffleNodeFactory The Factory for the Shuffle Node.
ShuffleNodeModel Implementation of the Fisher Yates shuffle, that guarantees that all n! possible outcomes are possible and equally likely.
 

Package org.knime.base.node.preproc.shuffle Description

Implementation of the Fisher Yates shuffle, that guarantees that all n! possible outcomes are possible and equally likely. The shuffling procedure requires only linear runtime. However, the implementation is quite slow because the original DataRows need to be assigned to the shuffled rowkeys. For further details see "Fisher-Yates shuffle", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.



Copyright, 2003 - 2010. All rights reserved.
University of Konstanz, Germany.
Chair for Bioinformatics and Information Mining, Prof. Dr. Michael R. Berthold.
You may not modify, publish, transmit, transfer or sell, reproduce, create derivative works from, distribute, perform, display, or in any way exploit any of the content, in whole or in part, except as otherwise expressly permitted in writing by the copyright owner or as specified in the license file distributed with this product.