Commit ffc997e9 by Mark Bell

### Removed old code.

parent 1df7a85d
 ... ... @@ -70,29 +70,6 @@ def test(T, edge, colour): if len(depths) % 10000 == 0: print('expanding seen past {}'.format(len(depths))) print('{:s} decomposes as: {}'.format(list(cycle), '.'.join(depths[twist_key]))) def test_conjugators(T, edge, colour): ''' Test whether the vertex cycles of T can be written as conjugate of a product of twists in the vertex cycles of T after the given edge has been split. ''' current, future = current_future_vertex_cycles(T, edge, colour) twists = [((index+1) * (+1 if k == 1 else -1), curve.encode_twist(power=k)) for index, curve in enumerate(future) for k in [-1, +1]] to_do = Queue() names = dict() for s, t in twists: to_do.put((t, [s])) names[t] = [s] for cycle in current: twist = cycle.encode_twist() while twist not in names: current_t, current_s = to_do.get() for s, t in twists: adjacent = ~t * current_t * t if adjacent not in names: names[adjacent] = [s] + current_s + [-s] to_do.put((adjacent, names[adjacent])) if len(names) % 10000 == 0: print('expanding seen past {}'.format(len(names))) print('{:s} decomposes as: {}'.format(list(cycle), '.'.join(map(str, names[twist])))) def test_conjugators(T, edge, colour): ''' Test whether new twists can be applied to the vertex cycles of T to make them carried after the split. ... ...
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!