Python library for counting graphs using Burnside's lemma and Pólya enumeration theorem.
-
Updated
Sep 12, 2022 - Python
Python library for counting graphs using Burnside's lemma and Pólya enumeration theorem.
Solves a handful of regular math problems
Enumerating the k-pop-stack-sortable permutations
Add a description, image, and links to the generating-function topic page so that developers can more easily learn about it.
To associate your repository with the generating-function topic, visit your repo's landing page and select "manage topics."