GitHub - fandreuz/BisPy: BisPy - Python bisimulation library[^]

https://github.com/fandreuz/BisPy

Hi guys, I'm trying to understand the mechanism behind the Paige-Tarjan algorithm. I searched a lot on the internet but I found only papers with analytical explanations, but I would lite to understand pratically how it works, with an example, an exercise or something else. I already downloaded the bispy repository on git but I don't understand how it works pratically, which are the steps that lead me to say that this is the result for an easy example, with this graph:

0 -> 1,2
1 -> 3,4
2 -> 5,6
3,4,5,6 -> null

I can't understand which are the steps that results in:

[(1, 2), (3, 4, 5, 6), (0,)]

I hope someone can explain me this. Thank you all.