MCPcopy Create free account
hub / github.com/google-deepmind/alphageometry / all_cyclics

Method all_cyclics

graph.py:2997–3000  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

2995 yield a, b, c, d, e, f, g, h # now a==c, e==g
2996
2997 def all_cyclics(self) -> Generator[tuple[Point, ...], None, None]:
2998 for c in self.type2nodes[Circle]:
2999 for x, y, z, t in utils.perm4(c.neighbors(Point)):
3000 yield x, y, z, t
3001
3002 def all_colls(self) -> Generator[tuple[Point, ...], None, None]:
3003 for l in self.type2nodes[Line]:

Callers 2

match_allFunction · 0.80

Calls 1

neighborsMethod · 0.80

Tested by 1