code
stringlengths
3
6.57k
IncidenceStructure(4, [[0,1],[0,2],[0,3],[1,2], [1,2,3]])
B.num_points()
len(self._points)
num_blocks(self)
designs.DesarguesianProjectivePlaneDesign(2)
num_blocks()
IncidenceStructure(4, [[0,1],[0,2],[0,3],[1,2], [1,2,3]])
B.num_blocks()
len(self._blocks)
blocks(self)
IncidenceStructure(7,[[0,1,2],[0,3,4],[0,5,6],[1,3,5],[1,4,6],[2,3,6],[2,4,5]])
BD.blocks()
block_sizes(self)
IncidenceStructure(8, [[0,1,3],[1,4,5,6],[1,2],[5,6,7]])
BD.block_sizes()
IncidenceStructure(7,[[0,1,2],[0,3,4],[0,5,6],[1,3,5],[1,4,6],[2,3,6],[2,4,5]])
BD.block_sizes()
len(_)
degree(self, p=None, subset=False)
point (or set of points)
point (or a set of points)
point (``subset=True``)
point (``subset=False``, default)
designs.steiner_triple_system(9)
degree(3)
designs.steiner_triple_system(9)
degree({1,2},subset=True)
designs.steiner_triple_system(9)
degree()
degrees()
degree(None)
designs.steiner_triple_system(9)
degree(subset=True)
Traceback (most recent call last)
ValueError("subset must be False when p is None")
deprecation(17108, "Please use degrees()
degree(None)
self.degrees()
self._point_to_index.get(p,-1)
if (p>=0 and p<len(self._points)
sum((p in b)
set(self._point_to_index.get(x,-1)
set(p)
all(x>=0 and x<len(self._points)
set([-1])
sum(p.issubset(b)
degrees(self, size=None)
point (or set of point)
IncidenceStructure([[1,2,3],[1,4]])
degrees(2)
designs.steiner_triple_system(13)
all(v == 1 for v in S13.degrees(2)
values()
self.num_points()
enumerate(self._points)
combinations(range(self.num_points()
combinations(b,size)
tuple([self._points[x] for x in s])
six.iteritems(d)
rank(self)
hypergraph (the maximum size of a block)
Hypergraph(8, [[0,1,3],[1,4,5,6],[1,2]])
h.rank()
max(len(b)
is_regular(self,r=None)
H.is_regular()
designs.balanced_incomplete_block_design(7,3)
is_regular()
designs.balanced_incomplete_block_design(7,3)
is_regular(r=3)
designs.balanced_incomplete_block_design(7,3)
is_regular(r=4)
IncidenceStructure([])
is_regular()
Traceback (most recent call last)
self.num_points()
ValueError("This incidence structure has no points.")
self.num_points()
set(count)
len(count)
count.pop()
count.pop()
is_uniform(self,k=None)
H.is_uniform()
designs.balanced_incomplete_block_design(7,3)
is_uniform()
designs.balanced_incomplete_block_design(7,3)
is_uniform(k=3)
designs.balanced_incomplete_block_design(7,3)
is_uniform(k=4)
IncidenceStructure([])
is_uniform()
Traceback (most recent call last)
self.num_blocks()
ValueError("This incidence structure has no blocks.")
set(self.block_sizes()
len(sizes)
sizes.pop()
sizes.pop()
is_connected(self)