1on1 is a small project that uses the Networx library and Python 3 to calculate divisions of networks.
Given a directed no-self-looping network, how many ways are there to divide it so, that every node has a an in- and out-degree of exactly 1?
This project started from a Secret Santa family tradition: The grown-ups of a family decided that it would be too much effort to buy presents to all other grown-ups, so they started a game that would reduce the amount of presents bought.
- For every participant another random participant is chosen.
- Each participant buys a single present to their target.
- Each participant can be a targt only once, thus everyone gets and gives exactly one present
- A participant can't buy a present to himself, or their husband/wife/partner (as they are likely going to buy presents for each other anyway)