1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
# Regina - A Normal Surface Theory Calculator
# Python Test Suite Component
#
# Copyright (c) 2007-2025, Ben Burton
# For further details contact Ben Burton (bab@debian.org).
#
# Provides tests for the linear programm tree traversal algorithms.
#
# This file is a single component of Regina's python test suite. To run
# the python test suite, move to the main python directory in the source
# tree and run "make check".
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; either version 2 of the
# License, or (at your option) any later version.
#
# As an exception, when this program is distributed through (i) the
# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
# (iii) Google Play by Google Inc., then that store may impose any
# digital rights management, device limits and/or redistribution
# restrictions that are required by its terms of service.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <https://www.gnu.org/licenses/>.
def dumpSurface(tree):
print('Found:', tree.buildSurface())
return False
def dumpStructure(tree):
print('Found:', tree.buildStructure())
return False
t = Example3.rp3rp3()
tree = TreeSingleSoln_EulerPositive(t, NormalCoords.Standard)
if tree.find():
print('Found:', tree.buildSurface())
else:
print('No solution')
print('Visited:', tree.visited())
print()
t = Example3.figureEight()
tree = TautEnumeration(t)
dummy = tree.run(dumpStructure)
print('Visited:', tree.visited())
print('Solutions:', tree.solutions())
print()
t = Example3.figureEight()
tree = TreeEnumeration(t, NormalCoords.Quad)
dummy = tree.run(dumpSurface)
print('Visited:', tree.visited())
print('Solutions:', tree.solutions())
print()
t = Example3.trefoil()
tree = TreeEnumeration_NonSpun(t, NormalCoords.Quad)
dummy = tree.run(dumpSurface)
print('Visited:', tree.visited())
print('Solutions:', tree.solutions())
print()
t = Example3.trefoil()
tab = LPInitialTableaux_NonSpun(t, NormalCoords.Quad)
sys = tab.system()
print('System:', sys.normal(), sys.angle(), sys.standard(), sys.quad())
print('Columns:', tab.coordinateColumns(), '->', tab.columns())
print('Perm:', tab.columnPerm())
m = LPMatrix(tab.rank(), tab.columns())
tab.fillInitialTableaux(m)
print(m.detail())
dat = LPData_NonSpun()
dat.reserve(tab)
dat.initStart()
if dat.isFeasible():
print(dat.extractSolution([0, 0]))
else:
print('Not feasible')
dat.constrainPositive(2)
if dat.isFeasible():
print(dat.extractSolution([3, 0]))
else:
print('Not feasible')
dat.constrainZero(3) # already zero, should do nothing
if dat.isFeasible():
print(dat.extractSolution([3, 0]))
else:
print('Not feasible')
dat.constrainPositive(5)
if dat.isFeasible():
print(dat.extractSolution([3, 3]))
else:
print('Not feasible')
dat.constrainZero(4)
if dat.isFeasible():
print(dat.extractSolution([3, 3]))
else:
print('Not feasible')
print()
t = Example3.rp3rp3()
tab = LPInitialTableaux(t, NormalCoords.Standard)
print(LPConstraintNone.addRows(tab))
tab = LPInitialTableaux_EulerPositive(t, NormalCoords.Standard)
print(LPConstraintEulerPositive.addRows(tab))
tab = LPInitialTableaux_EulerZero(t, NormalCoords.Standard)
print(LPConstraintEulerZero.addRows(tab))
print()
t = Example3.lst(3,4)
tab = LPInitialTableaux(t, NormalCoords.Standard)
sys = tab.system()
print('System:', sys.normal(), sys.angle(), sys.standard(), sys.quad())
print('Columns:', tab.coordinateColumns(), '->', tab.columns())
print('Perm:', tab.columnPerm())
dat = LPData()
dat.reserve(tab)
dat.initStart()
if dat.isFeasible():
print(dat.extractSolution([0, 0, 0] + [0] * 12))
else:
print('Not feasible')
dat.constrainPositive(0)
if dat.isFeasible():
print(dat.extractSolution([1, 0, 0] + [0] * 12))
else:
print('Not feasible')
ban = BanBoundary(tab)
ban.enforceBans(dat)
if dat.isFeasible():
print(dat.extractSolution([1, 0, 0] + [0] * 12))
else:
print('Not feasible')
print()
t = Triangulation3.fromIsoSig('gHLLOcbcdeffafwfss') # Solid torus # RP^3
print(t.nonTrivialSphereOrDisc())
tab = LPInitialTableaux(t, NormalCoords.Standard)
sys = tab.system()
print('System:', sys.normal(), sys.angle(), sys.standard(), sys.quad())
print('Columns:', tab.coordinateColumns(), '->', tab.columns())
print('Perm:', tab.columnPerm())
dat = LPData()
dat.reserve(tab)
dat.initStart()
if dat.isFeasible():
print(dat.extractSolution([0] * 30))
else:
print('Not feasible')
dat.constrainPositive(35) # should be the "real" triangle coordinate #1
if dat.isFeasible():
print(dat.extractSolution([0] * 23 + [1] + [0] * 6))
else:
print('Not feasible')
ban = BanBoundary(tab)
ban.enforceBans(dat)
if dat.isFeasible():
print(dat.extractSolution([0] * 23 + [1] + [0] * 6))
else:
print('Not feasible')
dat.constrainPositive(36) # should be the "real" triangle coordinate #2
if dat.isFeasible():
print(dat.extractSolution([0] * 23 + [1,1] + [0] * 5))
else:
print('Not feasible')
|
