This package can be used to verify a given solution against a set of crossing counting algorithms.
$ pip install pace2024verifier
$ poetry build
This generates a
dist directory containing the necessary wheel-file that can be installed via pip.
To verify a solution use the following command:
$ pace2024verify <path/to/graph.gr> <path/to/solution.sol>
The verifier has three different methods for verification usable via the switches:
- –segtree = Use a segment tree to count the crossings.
- –interleave = Count the crossings by checking for each pair of edges if they interleave.
- –stacklike = Count the crossings by checking how many pairs are out of order in a one-sided book embedding.
There is also the option to only print the number of crossings via