| /dports/math/nauty/nauty27r3/ |
| H A D | nauteste.ans | 1 2 graphs : orbits=6
2 16 graphs : orbits=7
3 29 graphs : orbits=8
4 32 graphs : orbits=9
5 21 graphs : orbits=10
6 14 graphs : orbits=11
7 23 graphs : orbits=12
8 218 graphs : orbits=13
9 1071 graphs : orbits=14
10 2658 graphs : orbits=15
[all …]
|
| H A D | nautest1a.ans | 57 level 4: 11 orbits; 10 fixed; index 20
60 level 3: 5 orbits; 1 fixed; index 36
63 level 2: 3 orbits; 2 fixed; index 7
71 level 3: 5 orbits; 1 fixed; index 36
72 level 2: 3 orbits; 2 fixed; index 7
77 level 4: 11 orbits; 2 fixed; index 20
78 level 3: 5 orbits; 1 fixed; index 36
79 level 2: 3 orbits; 6 fixed; index 7
137 level 3: 7 orbits; 2 fixed; index 30
138 level 2: 3 orbits; 1 fixed; index 42
[all …]
|
| H A D | nautest1b.dre | 55 level 4: 20 orbits; 15 fixed; index 4
60 level 3: 7 orbits; 7 fixed; index 30
63 level 2: 3 orbits; 1 fixed; index 42
71 level 4: 20 orbits; 15 fixed; index 4
72 level 3: 7 orbits; 7 fixed; index 30
73 level 2: 3 orbits; 1 fixed; index 42
78 level 4: 20 orbits; 1 fixed; index 4
79 level 3: 7 orbits; 4 fixed; index 30
80 level 2: 3 orbits; 3 fixed; index 42
138 level 3: 7 orbits; 4 fixed; index 30
[all …]
|
| H A D | nautest1a.dre | 57 level 4: 11 orbits; 10 fixed; index 20
60 level 3: 5 orbits; 1 fixed; index 36
63 level 2: 3 orbits; 2 fixed; index 7
71 level 3: 5 orbits; 1 fixed; index 36
72 level 2: 3 orbits; 2 fixed; index 7
77 level 4: 11 orbits; 4 fixed; index 20
78 level 3: 5 orbits; 3 fixed; index 36
79 level 2: 3 orbits; 1 fixed; index 7
136 level 4: 20 orbits; 8 fixed; index 4
137 level 3: 7 orbits; 4 fixed; index 30
[all …]
|
| H A D | nautest1b.ans | 55 level 4: 20 orbits; 15 fixed; index 4
60 level 3: 7 orbits; 7 fixed; index 30
63 level 2: 3 orbits; 1 fixed; index 42
71 level 4: 20 orbits; 15 fixed; index 4
72 level 3: 7 orbits; 7 fixed; index 30
73 level 2: 3 orbits; 1 fixed; index 42
78 level 4: 20 orbits; 6 fixed; index 4
79 level 3: 7 orbits; 2 fixed; index 30
80 level 2: 3 orbits; 1 fixed; index 42
138 level 3: 7 orbits; 2 fixed; index 30
[all …]
|
| H A D | schreier.c | 121 free(sh->orbits); in clearfreelists()
591 orbits = sh->orbits; in filterschreier()
597 while (orbits[j1] != j1) j1 = orbits[j1]; in filterschreier()
599 while (orbits[j2] != j2) j2 = orbits[j2]; in filterschreier()
609 for (i = 0; i < n; ++i) orbits[i] = orbits[orbits[i]]; in filterschreier()
790 *orbits = sh->orbits; in getorbitsmin()
799 *orbits = sh->orbits; in getorbitsmin()
822 *orbits = fixorbs = sh->orbits; in getorbitsmin()
858 *orbits = sh->orbits; in getorbitsmin()
906 orbits = sh->orbits; in pruneset()
[all …]
|
| H A D | gtnauty.c | 161 int lab[MAXN],ptn[MAXN],orbits[MAXN]; in fcanonise() local
168 DYNALLSTAT(int,orbits,orbits_sz); in fcanonise()
242 int lab[MAXN],ptn[MAXN],orbits[MAXN]; in fcanonise_inv() local
249 DYNALLSTAT(int,orbits,orbits_sz); in fcanonise_inv()
328 int lab[MAXN],ptn[MAXN],orbits[MAXN]; in fcanonise_inv_sg() local
335 DYNALLSTAT(int,orbits,orbits_sz); in fcanonise_inv_sg()
465 orbits[lab[i]] = lab[i]; in fgroup()
565 orbits[lab[i]] = lab[i]; in fgroup_inv()
620 if (orbits[i] != i0) in userlevel()
660 DYNALLSTAT(int,orbits,orbits_sz); in istransitive()
[all …]
|
| /dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/ |
| H A D | nauteste.ans | 1 2 graphs : orbits=6
2 16 graphs : orbits=7
3 29 graphs : orbits=8
4 32 graphs : orbits=9
5 21 graphs : orbits=10
6 14 graphs : orbits=11
7 23 graphs : orbits=12
8 218 graphs : orbits=13
9 1071 graphs : orbits=14
10 2658 graphs : orbits=15
[all …]
|
| H A D | nautest1a.ans | 57 level 4: 11 orbits; 10 fixed; index 20
60 level 3: 5 orbits; 1 fixed; index 36
63 level 2: 3 orbits; 2 fixed; index 7
71 level 3: 5 orbits; 1 fixed; index 36
72 level 2: 3 orbits; 2 fixed; index 7
77 level 4: 11 orbits; 2 fixed; index 20
78 level 3: 5 orbits; 1 fixed; index 36
79 level 2: 3 orbits; 6 fixed; index 7
137 level 3: 7 orbits; 2 fixed; index 30
138 level 2: 3 orbits; 1 fixed; index 42
[all …]
|
| H A D | nautest1a.dre | 57 level 4: 11 orbits; 10 fixed; index 20
60 level 3: 5 orbits; 1 fixed; index 36
63 level 2: 3 orbits; 2 fixed; index 7
71 level 3: 5 orbits; 1 fixed; index 36
72 level 2: 3 orbits; 2 fixed; index 7
77 level 4: 11 orbits; 4 fixed; index 20
78 level 3: 5 orbits; 3 fixed; index 36
79 level 2: 3 orbits; 1 fixed; index 7
136 level 4: 20 orbits; 8 fixed; index 4
137 level 3: 7 orbits; 4 fixed; index 30
[all …]
|
| H A D | nautest1b.dre | 55 level 4: 20 orbits; 15 fixed; index 4
60 level 3: 7 orbits; 7 fixed; index 30
63 level 2: 3 orbits; 1 fixed; index 42
71 level 4: 20 orbits; 15 fixed; index 4
72 level 3: 7 orbits; 7 fixed; index 30
73 level 2: 3 orbits; 1 fixed; index 42
78 level 4: 20 orbits; 1 fixed; index 4
79 level 3: 7 orbits; 4 fixed; index 30
80 level 2: 3 orbits; 3 fixed; index 42
138 level 3: 7 orbits; 4 fixed; index 30
[all …]
|
| H A D | nautest1b.ans | 55 level 4: 20 orbits; 15 fixed; index 4
60 level 3: 7 orbits; 7 fixed; index 30
63 level 2: 3 orbits; 1 fixed; index 42
71 level 4: 20 orbits; 15 fixed; index 4
72 level 3: 7 orbits; 7 fixed; index 30
73 level 2: 3 orbits; 1 fixed; index 42
78 level 4: 20 orbits; 6 fixed; index 4
79 level 3: 7 orbits; 2 fixed; index 30
80 level 2: 3 orbits; 1 fixed; index 42
138 level 3: 7 orbits; 2 fixed; index 30
[all …]
|
| H A D | schreier.c | 121 free(sh->orbits); in clearfreelists()
587 orbits = sh->orbits; in filterschreier()
593 while (orbits[j1] != j1) j1 = orbits[j1]; in filterschreier()
595 while (orbits[j2] != j2) j2 = orbits[j2]; in filterschreier()
605 for (i = 0; i < n; ++i) orbits[i] = orbits[orbits[i]]; in filterschreier()
786 *orbits = sh->orbits; in getorbitsmin()
795 *orbits = sh->orbits; in getorbitsmin()
818 *orbits = fixorbs = sh->orbits; in getorbitsmin()
854 *orbits = sh->orbits; in getorbitsmin()
902 orbits = sh->orbits; in pruneset()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/bliss/ |
| H A D | orbit.cc | 29 orbits = 0; in Orbit()
37 if(orbits) in ~Orbit()
39 free(orbits); in ~Orbit()
40 orbits = 0; in ~Orbit()
54 if(orbits) free(orbits); in init()
55 orbits = (OrbitEntry*)malloc(n * sizeof(OrbitEntry)); in init()
66 assert(orbits); in reset()
71 orbits[i].element = i; in reset()
72 orbits[i].next = 0; in reset()
73 orbits[i].size = 1; in reset()
[all …]
|
| /dports/math/bliss/bliss-0.73/ |
| H A D | orbit.cc | 29 orbits = 0; in Orbit()
37 if(orbits) in ~Orbit()
39 free(orbits); in ~Orbit()
40 orbits = 0; in ~Orbit()
54 if(orbits) free(orbits); in init()
55 orbits = (OrbitEntry*)malloc(n * sizeof(OrbitEntry)); in init()
66 assert(orbits); in reset()
71 orbits[i].element = i; in reset()
72 orbits[i].next = 0; in reset()
73 orbits[i].size = 1; in reset()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/isomorphism/bliss/ |
| H A D | orbit.cc | 27 orbits = 0; in Orbit()
35 delete[] orbits; in ~Orbit()
36 orbits = 0; in ~Orbit()
61 if(orbits) delete[] orbits; in init()
62 orbits = new OrbitEntry[n]; in init()
73 assert(orbits); in reset()
78 orbits[i].element = i; in reset()
79 orbits[i].next = 0; in reset()
80 orbits[i].size = 1; in reset()
81 in_orbit[i] = &orbits[i]; in reset()
|
| /dports/math/conauto/conauto-2.03/src/ |
| H A D | orbits.c | 36 free ( go->orbits ); in free_graph_orbits()
43 go->orbits = malloc ( size * sizeof(Info_Orbit) ); in allocate_graph_orbits()
55 go->orbits[i].first = i; in create_trivial_orbits()
56 go->orbits[i].last = i; in create_trivial_orbits()
57 go->orbits[i].size = 1; in create_trivial_orbits()
72 go->vertices[go->orbits[orbit_of(v2)].last].next = go->orbits[orbit_of(v1)].first; in merge_orbits()
73 go->orbits[orbit_of(v2)].last = go->orbits[orbit_of(v1)].last; in merge_orbits()
74 for ( v = go->orbits[orbit_of(v1)].first; v != UINT16_MAX; v = go->vertices[v].next ) in merge_orbits()
80 free ( go->orbits ); in destroy_graph_orbits()
93 for ( v = go->orbits[orbit_of(vertex)].first; v != UINT16_MAX; v = go->vertices[v].next ) in mark_not_valid()
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/fining/examples/gap/ |
| H A D | stab_orbs_finingorbitsdomain.g | 5 orbits := FiningOrbits(syl127,AsList(Solids(pg)));;
7 Collected(List(orbits,x->Length(x)));
8 orbits := FiningOrbitsDomain(syl127,Solids(pg),OnProjSubspaces);;
10 Collected(List(orbits,x->Length(x)));
11 orbits := OrbitsDomain(syl127,Solids(pg),OnProjSubspaces);;
13 Collected(List(orbits,x->Length(x)));
17 orbits := FiningOrbitsDomain(group,Points(ag),OnAffineSubspaces);
|
| /dports/math/gap/gap-4.11.0/pkg/RepnDecomp-1.1.0/lib/cohcfg/ |
| H A D | misc.gi | 5 local orbits, mapping, representatives,
12 …orbits := OrbitsDomain(G, Omega); # this returns a list of the orbits; WARNING: undefined behavior…
14 for i in [1..Length(orbits)] do
15 for j in orbits[i] do
21 representatives := List(orbits, x -> x[1]); # retrieves the first element of each orbit
25 orbits := orbits, # a list of the orbits of G acting on Omega
26 …mapping := mapping, # a mapping from Omega to orbits, i.e. mapping[i] = j iff i in Omega is in orb…
|
| /dports/math/SCIP/scip-7.0.3/tests/src/symmetry/ |
| H A D | compute.c | 70 int* orbits; variable
146 cr_assert( orbits[0] == 0 );
147 cr_assert( orbits[1] == 1 );
148 cr_assert( orbits[2] == 2 );
149 cr_assert( orbits[3] == 3 );
192 int* orbits; variable
286 cr_assert( orbits[0] == 0 );
287 cr_assert( orbits[1] == 1 );
430 int* orbits; variable
559 int* orbits; variable
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/rcwa-4.6.4/data/3ctsgroups6/ |
| H A D | finite-orbits.g | 3 #W finite-orbits.g GAP4 Package `RCWA' Stefan Kohl
6 ## 3 class transpositions which concerns finite orbits of these groups.
11 ## indices of those groups which are believed to have only finite orbits,
12 ## but which have orbits longer than 256 which intersect nontrivially with
17 ## orbits, but all of whose orbits which intersect nontrivially with the
23 ## interval [-2^k..2^k] if all orbits intersecting with this interval
18803 #E finite-orbits.g . . . . . . . . . . . . . . . . . . . . . . . . ends here
|
| /dports/math/gap/gap-4.11.0/pkg/fining/tst/gap/extra/ |
| H A D | tst_fining1.g | 6 orbits := FiningOrbits(coll,Planes(ps));
7 Length(orbits);
8 S := First(orbits,x->Length(x)=(q^6-1)/(q-1));
14 orbits := FiningOrbits(coll,Planes(ps));
15 Length(orbits);
16 S := First(orbits,x->Length(x)=(q^6-1)/(q-1));
|
| /dports/math/gap/gap-4.11.0/pkg/fining/tst/gap/ |
| H A D | tst_regular13system.g | 6 orbits := FiningOrbits(coll,Planes(ps));
7 Length(orbits);
8 S := First(orbits,x->Length(x)=(q^6-1)/(q-1));
14 orbits := FiningOrbits(coll,Planes(ps));
15 Length(orbits);
16 S := First(orbits,x->Length(x)=(q^6-1)/(q-1));
|
| /dports/math/gap/gap-4.11.0/pkg/fining/examples/include/ |
| H A D | stab_orbs_finingorbitsdomain.include | 7 gap> orbits := FiningOrbits(syl127,AsList(Solids(pg)));;
16 gap> Collected(List(orbits,x->Length(x)));
18 gap> orbits := FiningOrbitsDomain(syl127,Solids(pg),OnProjSubspaces);;
21 gap> Collected(List(orbits,x->Length(x)));
23 gap> orbits := OrbitsDomain(syl127,Solids(pg),OnProjSubspaces);;
26 gap> Collected(List(orbits,x->Length(x)));
34 gap> orbits := FiningOrbitsDomain(group,Points(ag),OnAffineSubspaces);
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/sat/ |
| H A D | symmetry_util.cc | 168 std::vector<int> orbits(n, -1); in GetOrbits() local
172 if (orbits[root] == -1) orbits[root] = num_parts++; in GetOrbits()
173 orbits[i] = orbits[root]; in GetOrbits()
175 return orbits; in GetOrbits()
180 std::vector<int> orbits(n, -1); in GetOrbitopeOrbits() local
183 CHECK_EQ(orbits[orbitope[i][j]], -1); in GetOrbitopeOrbits()
184 orbits[orbitope[i][j]] = i; in GetOrbitopeOrbits()
187 return orbits; in GetOrbitopeOrbits()
|