We implement methods to work with maximal chains into our Poset class in Python and get majorly distracted by Critical Groups of Graphs!

We implement the Depth-First Search algorithm in Python to retrieve the set of maximal chains of the Poset class we created in the last post

This is an exploration of Dunder Methods and how they can be used to create abstract posets like the divisibility or p-adic posets in Python