| /dports/math/igraph/igraph-0.9.5/src/isomorphism/bliss/ |
| H A D | graph.hh | 96 virtual bool is_automorphism(const std::vector<unsigned int>& perm) const = 0;
363 virtual bool is_automorphism(unsigned int* const perm) const = 0;
576 bool is_automorphism(unsigned int* const perm) const;
602 bool is_automorphism(const std::vector<unsigned int>& perm) const;
785 bool is_automorphism(unsigned int* const perm) const;
810 bool is_automorphism(const std::vector<unsigned int>& perm) const;
|
| H A D | graph.cc | 1591 if(!is_automorphism(best_path_automorphism)) in search()
1692 if(!is_automorphism(first_path_automorphism)) in search()
3187 Digraph::is_automorphism(unsigned int* const perm) const in is_automorphism() function in bliss::Digraph
3233 Digraph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::Digraph
4707 Graph::is_automorphism(unsigned int* const perm) const in is_automorphism() function in bliss::Graph
4744 Graph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::Graph
|
| /dports/math/R-cran-igraph/igraph/src/bliss/ |
| H A D | graph.hh | 166 virtual bool is_automorphism(const std::vector<unsigned int>& perm) const;
445 virtual bool is_automorphism(unsigned int* const perm);
643 bool is_automorphism(unsigned int* const perm);
703 bool is_automorphism(const std::vector<unsigned int>& perm) const;
886 bool is_automorphism(unsigned int* const perm);
943 bool is_automorphism(const std::vector<unsigned int>& perm) const;
|
| H A D | graph.cc | 289 AbstractGraph::is_automorphism(unsigned int* const perm) in is_automorphism() function in bliss::AbstractGraph
296 AbstractGraph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::AbstractGraph
1591 if(!is_automorphism(best_path_automorphism)) in search()
1694 if(!is_automorphism(first_path_automorphism)) in search()
3478 Digraph::is_automorphism(unsigned int* const perm) in is_automorphism() function in bliss::Digraph
3524 Digraph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::Digraph
5266 Graph::is_automorphism(unsigned int* const perm) in is_automorphism() function in bliss::Graph
5303 Graph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::Graph
|
| /dports/math/bliss/bliss-0.73/ |
| H A D | graph.hh | 162 virtual bool is_automorphism(const std::vector<unsigned int>& perm) const;
439 virtual bool is_automorphism(unsigned int* const perm);
637 bool is_automorphism(unsigned int* const perm);
695 bool is_automorphism(const std::vector<unsigned int>& perm) const;
878 bool is_automorphism(unsigned int* const perm);
933 bool is_automorphism(const std::vector<unsigned int>& perm) const;
|
| H A D | graph.cc | 283 AbstractGraph::is_automorphism(unsigned int* const perm) in is_automorphism() function in bliss::AbstractGraph
290 AbstractGraph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::AbstractGraph
1599 if(!is_automorphism(best_path_automorphism)) in search()
1702 if(!is_automorphism(first_path_automorphism)) in search()
3483 Digraph::is_automorphism(unsigned int* const perm) in is_automorphism() function in bliss::Digraph
3529 Digraph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::Digraph
5282 Graph::is_automorphism(unsigned int* const perm) in is_automorphism() function in bliss::Graph
5319 Graph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss::Graph
|
| /dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/bliss-0.73/ |
| H A D | graph.hh | 166 virtual bool is_automorphism(const std::vector<unsigned int>& perm) const;
449 virtual bool is_automorphism(uint_pointer_substitute const perm);
654 bool is_automorphism(uint_pointer_substitute const perm);
712 bool is_automorphism(const std::vector<unsigned int>& perm) const;
909 bool is_automorphism(uint_pointer_substitute const perm);
964 bool is_automorphism(const std::vector<unsigned int>& perm) const;
|
| H A D | graph.cc | 267 AbstractGraph::is_automorphism(uint_pointer_substitute const) in is_automorphism() function in bliss_digraphs::AbstractGraph
274 AbstractGraph::is_automorphism(const std::vector<unsigned int>&) const in is_automorphism() function in bliss_digraphs::AbstractGraph
1576 if(!is_automorphism(best_path_automorphism)) in search()
1679 if(!is_automorphism(first_path_automorphism)) in search()
3440 Digraph::is_automorphism(uint_pointer_substitute const perm) in is_automorphism() function in bliss_digraphs::Digraph
3486 Digraph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss_digraphs::Digraph
5233 Graph::is_automorphism(uint_pointer_substitute const perm) in is_automorphism() function in bliss_digraphs::Graph
5270 Graph::is_automorphism(const std::vector<unsigned int>& perm) const in is_automorphism() function in bliss_digraphs::Graph
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/algorithms/ |
| H A D | find_graph_symmetries.cc | 734 bool is_automorphism = true; in FindOneSuitablePermutation() local
737 is_automorphism = IsGraphAutomorphism(tmp_dynamic_permutation_); in FindOneSuitablePermutation()
738 u.AlsoUpdate(is_automorphism ? &stats_.automorphism_test_success_time in FindOneSuitablePermutation()
741 if (is_automorphism) { in FindOneSuitablePermutation()
|
| /dports/math/gap/gap-4.11.0/pkg/OpenMath-11.5.0/gap/ |
| H A D | gap.g | 426 is_automorphism := fail,
497 is_automorphism := fail,
528 is_automorphism := fail,
677 is_automorphism := fail,
1041 is_automorphism := fail,
1102 is_automorphism := fail,
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/ |
| H A D | abcSaucy.c | 164 int (*is_automorphism)(struct saucy *); member
2277 if (s->is_automorphism(s)) { in do_search()
2342 s->is_automorphism = is_directed_automorphism; in saucy_search()
2347 s->is_automorphism = is_undirected_automorphism; in saucy_search()
|