Join GitHub today
GitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up
Implemented a more refined version of the two-closure computation #10
The original algorithm simply intersects the automorphism groups of (almost) ALL orbital graphs. That really isn't necessary, most orbital graphs do not contribute anything new to the intersection. This new algorithm uses computations inside the endomorphism algebra of the permutation module to cut down on the number of necessary orbital graphs and should therefore be much faster.
The steps are revering to https://github.com/JHahnHRO/LaTeX/blob/master/Stuff-about-orbital-graphs/orbital_graphs.pdf