Finding all the possible partitions of a list.
Project description
komby
The Problem
Finding all the possible partitions of a list maintaining in the partition the order of the elements in the original list, and all the elements in the original list must be in some partition.
A list with 3 elements, for example [1, 2, 3], will produce 2n-1 = 4 possible partitions:
1 - [[1, 2, 3]]
2 - [[1, 2], [3]]
3 - [[1], [2, 3]]
4 - [[1], [2], [3]]
Usage
Code:
import Komby
data = [1, 2, 3]
print("Number of possible partitions: {}.\n".format(Komby.total_partitions(data)))
partitions = Komby.partitions(data, True)
print("Partitions:")
for p in partitions:
print("\t - {}".format(p))
Output:
Number of possible partitions: 4.
Partitions:
- [[1, 2, 3]]
- [[1, 2], [3]]
- [[1], [2, 3]]
- [[1], [2], [3]]
Install
You can install Komby easily via pip:
pip install -U komby
Tests
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
komby-1.2.tar.gz
(3.7 kB
view hashes)
Built Distribution
komby-1.2-py3-none-any.whl
(3.6 kB
view hashes)