def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_near_x(n_tables, starting_size)
countgraph = _Countgraph(k, primes)
class_ = _GraphLabels.__new__(cls, countgraph)
class_.graph = countgraph
return class_
def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_near_x(n_tables, starting_size)
countgraph = _Countgraph(k, primes)
class_ = _GraphLabels.__new__(cls, countgraph)
class_.graph = countgraph
return class_
def __new__(cls, k, starting_size, n_tables):
nodegraph = Nodegraph(k, starting_size, n_tables)
graphlabels = _GraphLabels.__new__(cls, nodegraph)
graphlabels.graph = nodegraph
return graphlabels
def __new__(cls, k, starting_size, n_tables):
nodegraph = Nodegraph(k, starting_size, n_tables)
graphlabels = _GraphLabels.__new__(cls, nodegraph)
graphlabels.graph = nodegraph
return graphlabels
def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_near_x(n_tables, starting_size)
hb = _Countgraph(k, primes)
c = _GraphLabels.__new__(cls, hb)
c.graph = hb
return c
def __new__(cls, k, starting_size, n_tables):
hb = Nodegraph(k, starting_size, n_tables)
c = _GraphLabels.__new__(cls, hb)
c.graph = hb
return c
def __new__(cls, k, starting_size, n_tables):
primes = get_n_primes_near_x(n_tables, starting_size)
hb = _Countgraph(k, primes)
c = _GraphLabels.__new__(cls, hb)
c.graph = hb
return c
def __new__(cls, k, starting_size, n_tables):
hb = Nodegraph(k, starting_size, n_tables)
c = _GraphLabels.__new__(cls, hb)
c.graph = hb
return c