def betterer_neigh (self, z):
g = DCJ(self._g)
z = [DCJ(g._g) for g in z]
neigh = g.betterer_neigh(z)
if len(neigh) == 0:
print '-----'
print z[0]
print z[1]
print z[2]
return [self.circularize3(h) for h in neigh]
def betterer_neigh(self, z):
g = DCJ(self._g)
z = [DCJ(g._g) for g in z]
neigh = g.betterer_neigh(z)
if len(neigh) == 0:
print '-----'
print z[0]
print z[1]
print z[2]
return [self.circularize3(h) for h in neigh]
def better_neigh(self, z):
g = DCJ(self.g)
z = [DCJ(g.__str__()) for g in z]
return [
CircRev(h.__str__()) for h in g.betterer_neigh(z) if h.circular()
]
def better_neigh (self, z):
g = DCJ(self.g)
z = [DCJ(g.__str__()) for g in z]
return [CircRev(h.__str__()) for h in g.betterer_neigh(z) if h.circular()]
def betterer_neigh (self, z):
g = DCJ(self.g)
z = [DCJ(g.__str__()) for g in z]
return [LinRev(h.__str__()) for h in g.betterer_neigh(z) if h.linear()]
