Stay organized with collections Save and categorize content based on your preferences.

C++ Reference: find_graph_symmetries

Note: This documentation is automatically generated.

This class solves the graph automorphism problem (, a variant of the famous graph isomorphism problem (

The algorithm is largely based on the following article, published in 2008: "Faster Symmetry Discovery using Sparsity of Symmetries" by Darga, Sakallah and Markov.

See the comments on the class below for more details.