![]() |
OR-Tools
8.2
|
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 (std::vector< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *factorized_automorphism_group_size, TimeLimit *time_limit=nullptr) |
void | RecursivelyRefinePartitionByAdjacency (int first_unrefined_part_index, DynamicPartition *partition) |
void | DistinguishNodeInPartition (int node, DynamicPartition *partition, std::vector< int > *new_singletons_or_null) |
typedef ::util::StaticGraph Graph |
Definition at line 45 of file find_graph_symmetries.h.
GraphSymmetryFinder | ( | const Graph & | graph, |
bool | is_undirected | ||
) |
Definition at line 101 of file find_graph_symmetries.cc.
void DistinguishNodeInPartition | ( | int | node, |
DynamicPartition * | partition, | ||
std::vector< int > * | new_singletons_or_null | ||
) |
Definition at line 269 of file find_graph_symmetries.cc.
absl::Status FindSymmetries | ( | std::vector< int > * | node_equivalence_classes_io, |
std::vector< std::unique_ptr< SparsePermutation > > * | generators, | ||
std::vector< int > * | factorized_automorphism_group_size, | ||
TimeLimit * | time_limit = nullptr |
||
) |
Definition at line 376 of file find_graph_symmetries.cc.
bool IsGraphAutomorphism | ( | const DynamicPermutation & | permutation | ) | const |
Definition at line 148 of file find_graph_symmetries.cc.
void RecursivelyRefinePartitionByAdjacency | ( | int | first_unrefined_part_index, |
DynamicPartition * | partition | ||
) |
Definition at line 192 of file find_graph_symmetries.cc.