code stringlengths 3 6.57k |
|---|
IncidenceStructure(V, blocks) |
type(I.ground_set() |
type(I.blocks() |
IncidenceStructure([]) |
isinstance(points, Matrix) |
set() |
union(*blocks) |
matrix(incidence_matrix) |
M.nrows() |
list(range(v) |
sorted(M.nonzero_positions_in_column(i) |
range(M.ncols() |
isinstance(points, (int,Integer) |
list(range(points) |
sorted(points) |
list(range(len(points) |
all(isinstance(x,(int,Integer) |
enumerate(self._points) |
any(x not in self._points for x in block) |
ValueError("Block {} is not contained in the point set".format(block) |
len(block) |
len(set(block) |
ValueError("Repeated element in block {}".format(block) |
sorted(self._point_to_index[e] for e in block) |
sorted(block) |
b.sort() |
blocks.sort() |
str(name) |
__iter__(self) |
designs.steiner_triple_system(9) |
list(sts) |
IncidenceStructure('ab', ['a','ab']) |
iter(b) |
next(it) |
next(it) |
__repr__(self) |
IncidenceStructure(7,[[0,1,2],[0,3,4],[0,5,6],[1,3,5],[1,4,6],[2,3,6],[2,4,5]]) |
self.num_points() |
self.num_blocks() |
__eq__(self, other) |
IncidenceStructure(7, blocks) |
BD1.incidence_matrix() |
IncidenceStructure(incidence_matrix=M) |
frozenset([0,1]) |
frozenset([2]) |
sorted([e1,e2]) |
sorted([e2,e1]) |
IncidenceStructure([e1,e2], [[e1],[e1,e2]]) |
IncidenceStructure([e1,e2], [[e2,e1],[e1]]) |
IncidenceStructure([e2,e1], [[e1,e2],[e1]]) |
isinstance(other, IncidenceStructure) |
if (self.num_points() |
other.num_points() |
self.num_blocks() |
other.num_blocks() |
list(range(self.num_points() |
any(p not in p_to_i for p in other.ground_set() |
sorted(sorted(p_to_i[p] for p in b) |
other.blocks() |
__ne__(self, other) |
IncidenceStructure(7, [[0,1,2],[0,3,4],[0,5,6],[1,3,5],[1,4,6],[2,3,6],[2,4,5]]) |
BD1.incidence_matrix() |
IncidenceStructure(incidence_matrix=M) |
__contains__(self, block) |
IncidenceStructure([[1,2,3,4]]) |
IncidenceStructure([[1,2,3,4]]) |
IncidenceStructure([[1,2,3,4]]) |
IncidenceStructure([[1,2,"3",4]]) |
Subsets(str.split() |
IncidenceStructure(sets) |
designs.ProjectiveGeometryDesign(3, 1, GF(2) |
iter(block) |
sorted(block) |
canonical_label(self) |
designs.balanced_incomplete_block_design(7,3) |
designs.projective_plane(2) |
fano1.relabel(fano1.canonical_label() |
fano2.relabel(fano2.canonical_label() |
Graph() |
self.num_points() |
g.add_edges((i+n,x) |
enumerate(self._blocks) |
g.canonical_label([list(range(n) |
list(range(n,n+self.num_blocks() |
range(n) |
dict(zip(self._points,self._canonical_label) |
is_isomorphic(self, other, certificate=False) |
designs.balanced_incomplete_block_design(7,3) |
designs.projective_plane(2) |
fano1.is_isomorphic(fano2) |
fano1.is_isomorphic(fano2,certificate=True) |
IncidenceStructure([["A",5,pi],["A",5,"Wouhou"],["A","Wouhou",(9,9) |
IS.copy() |
IS2.relabel(IS2.canonical_label() |
IS.is_isomorphic(IS2) |
IS.is_isomorphic(IS2,certificate=True) |
IS.relabel(canon) |
IncidenceStructure([[1,2]]) |
IS2.is_isomorphic(IS) |
IS2.is_isomorphic(IS,certificate=True) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.