C++ Reference
C++ Reference: Algorithms
GraphSymmetryFinder
Detailed Description
Definition at line 43 of file find_graph_symmetries.h.
Public Types | |
| typedef ::util::StaticGraph | Graph |
Public Member Functions | |
| GraphSymmetryFinder (const Graph &graph, bool is_undirected) | |
| bool | IsGraphAutomorphism (const DynamicPermutation &permutation) const |
| absl::Status | FindSymmetries (double time_limit_seconds, std::vector< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *factorized_automorphism_group_size) |
| void | RecursivelyRefinePartitionByAdjacency (int first_unrefined_part_index, DynamicPartition *partition) |
| void | DistinguishNodeInPartition (int node, DynamicPartition *partition, std::vector< int > *new_singletons_or_null) |
Member Typedef Documentation
◆ Graph
| typedef ::util::StaticGraph Graph |
Definition at line 45 of file find_graph_symmetries.h.
Constructor & Destructor Documentation
◆ GraphSymmetryFinder()
| GraphSymmetryFinder | ( | const Graph & | graph, |
| bool | is_undirected | ||
| ) |
Member Function Documentation
◆ DistinguishNodeInPartition()
| void DistinguishNodeInPartition | ( | int | node, |
| DynamicPartition * | partition, | ||
| std::vector< int > * | new_singletons_or_null | ||
| ) |
◆ FindSymmetries()
| absl::Status FindSymmetries | ( | double | time_limit_seconds, |
| std::vector< int > * | node_equivalence_classes_io, | ||
| std::vector< std::unique_ptr< SparsePermutation > > * | generators, | ||
| std::vector< int > * | factorized_automorphism_group_size | ||
| ) |
◆ IsGraphAutomorphism()
| bool IsGraphAutomorphism | ( | const DynamicPermutation & | permutation | ) | const |
◆ RecursivelyRefinePartitionByAdjacency()
| void RecursivelyRefinePartitionByAdjacency | ( | int | first_unrefined_part_index, |
| DynamicPartition * | partition | ||
| ) |
The documentation for this class was generated from the following file: