Small python script to find the optimal pairings for the game of Incidence (https://doi.org/10.1016/j.disc.2023.113570) for cycle and path of a given length.
Given the length of the input (must be an even number), the script will return the value of the optimal pairing and one of the pairing achieving this value. By default, it will compute this value for a cycle. For example, to find the value ofgiven by the optimal pairing for cycles of length 8, just write :
```bash
$ python test_pairing.py 10
(2, [[0, 2], [1, 3], [4, 6], [5, 8], [7, 9]])
```
To apply the script to path, just add the flag --path :
```bash
$ python test_pairing.py 10 --path
(1, [[0, 1], [2, 3], [4, 6], [5, 8], [7, 9]])
```