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 (
https://en.wikipedia.org/wiki/Graph_automorphism), a variant of the famous graph isomorphism problem (
https://en.wikipedia.org/wiki/Graph_isomorphism).
The algorithm is largely based on the following article, published in 2008: "Faster Symmetry Discovery using Sparsity of Symmetries" by Darga, Sakallah and Markov.
http://web.eecs.umich.edu/~imarkov/pubs/conf/dac08-sym.pdf.
See the comments on the class below for more details.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThe \u003ccode\u003efind_graph_symmetries\u003c/code\u003e tool solves the graph automorphism problem, identifying symmetries within a graph structure.\u003c/p\u003e\n"],["\u003cp\u003eThe underlying algorithm leverages the sparsity of symmetries for faster discovery, based on research by Darga, Sakallah, and Markov.\u003c/p\u003e\n"],["\u003cp\u003eDetailed implementation and usage information can be found within the documentation for the \u003ccode\u003eGraphSymmetryFinder\u003c/code\u003e class.\u003c/p\u003e\n"]]],["The core content introduces a C++ class that addresses the graph automorphism problem, a variation of graph isomorphism. The method employed is primarily derived from the research paper \"Faster Symmetry Discovery using Sparsity of Symmetries\" by Darga, Sakallah, and Markov. The documentation provides a link to the academic article and directs users to the `GraphSymmetryFinder` class for further details on its implementation.\n"],null,["# find_graph_symmetries\n\nC++ Reference: find_graph_symmetries\n====================================\n\n\nNote: This documentation is automatically generated.\nThis class solves the graph automorphism problem (\u003chttps://en.wikipedia.org/wiki/Graph_automorphism\u003e), a variant of the famous graph isomorphism problem (\u003chttps://en.wikipedia.org/wiki/Graph_isomorphism\u003e). \n\nThe algorithm is largely based on the following article, published in 2008: \"Faster Symmetry Discovery using Sparsity of Symmetries\" by Darga, Sakallah and Markov. [http://web.eecs.umich.edu/\\~imarkov/pubs/conf/dac08-sym.pdf](http://web.eecs.umich.edu/~imarkov/pubs/conf/dac08-sym.pdf). \n\nSee the comments on the class below for more details. \n\n| Classes ------- ||\n|-----------------------------------------------------------------------------------------------------|---|\n| [GraphSymmetryFinder](/optimization/reference/algorithms/find_graph_symmetries/GraphSymmetryFinder) |"]]
