Graph Theory, Isomorphism, Mathematics, Python, Discrete Mathematics.
inefficient, this is related to the graph isomorphism problem, not yet solved so far. Despite the inefficiency (n!), code can be used by the reader to experiment with graphs with n <= 8 vertices. At least for me, when I code something, then I understand it, hope it’s useful for someone who is new