51 lines
No EOL
1.9 KiB
Python
51 lines
No EOL
1.9 KiB
Python
import numpy as np
|
|
import math
|
|
|
|
class Node:
|
|
def __init__(self, tuple, word, words, infertile):
|
|
self.tuple = tuple
|
|
self.children = []
|
|
self.word = word
|
|
self.infertile = infertile
|
|
words[str(word)] = self
|
|
|
|
def dc_not_too_big(self, g, generator, dual_curvature):
|
|
temp = np.matmul(generator, self.tuple)
|
|
temp = np.delete(temp,g)
|
|
#print(g, self.word, math.sqrt(temp[0]*temp[1] + temp[0]*temp[2] + temp[1]*temp[2]), math.sqrt(temp[0]*temp[1] + temp[0]*temp[2] + temp[1]*temp[2]) < dual_curvature)
|
|
return math.sqrt(temp[0]*temp[1] + temp[0]*temp[2] + temp[1]*temp[2]) < dual_curvature
|
|
|
|
def next_generation(self, words, dual_curvature, generators):
|
|
if self.infertile:
|
|
return [self]
|
|
if self.children == []:
|
|
for g,generator in enumerate(generators):
|
|
if len(self.word) == 0 or g != self.word[-1]:
|
|
self.children.append(Node(np.matmul(generator,self.tuple), self.word[:] + [g], words, not self.dc_not_too_big(g, generator, dual_curvature)))
|
|
if self.children == []:
|
|
return [self]
|
|
else:
|
|
return self.children
|
|
|
|
def next(self):
|
|
if self.children == []:
|
|
return [self]
|
|
else:
|
|
return self.children
|
|
|
|
def leaves(self):
|
|
current_leaves = [self]
|
|
while True:
|
|
new_leaves = []
|
|
for leaf in current_leaves:
|
|
new_leaves += leaf.next()
|
|
if current_leaves == new_leaves:
|
|
break
|
|
else:
|
|
current_leaves = new_leaves
|
|
return current_leaves
|
|
|
|
def dual_curvature(self):
|
|
temp = self.tuple[:]
|
|
temp = np.delete(temp,self.word[-1])
|
|
return math.sqrt(temp[0]*temp[1] + temp[0]*temp[2] + temp[1]*temp[2]) |