Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
This is the complete list of members for operations_research::GraphSymmetryFinder, including all inherited members.
DistinguishNodeInPartition(int node, DynamicPartition *partition, std::vector< int > *new_singletons_or_null) | operations_research::GraphSymmetryFinder | |
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) | operations_research::GraphSymmetryFinder | |
Graph typedef | operations_research::GraphSymmetryFinder | |
GraphSymmetryFinder(const Graph &graph, bool is_undirected) | operations_research::GraphSymmetryFinder | |
IsGraphAutomorphism(const DynamicPermutation &permutation) const | operations_research::GraphSymmetryFinder | |
RecursivelyRefinePartitionByAdjacency(int first_unrefined_part_index, DynamicPartition *partition) | operations_research::GraphSymmetryFinder |