code stringlengths 3 6.57k |
|---|
IncidenceStructure(3, [[0,1],[0,2]]) |
is_connected() |
IncidenceStructure(4, [[0,1],[2,3]]) |
is_connected() |
DisjointSet(self.num_points() |
range(1,len(B) |
D.union(x,B[i]) |
D.number_of_subsets() |
is_simple(self) |
simple (i.e. no repeated block) |
IncidenceStructure(3, [[0,1],[1,2],[0,2]]) |
is_simple() |
IncidenceStructure(3, [[0],[0]]) |
is_simple() |
IncidenceStructure(V, B) |
I.is_simple() |
IncidenceStructure(V, B*2) |
I2.is_simple() |
all(B[i] != B[i+1] for i in range(len(B) |
_gap_(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._gap_() |
BlockDesign(7,[[1, 2, 3], [1, 4, 5], [1, 6, 7], [2, 4, 6], [2, 5, 7], [3, 4, 7], [3, 5, 6]]) |
self.blocks() |
self.num_points() |
BlockDesign("+str(v) |
str(gB) |
intersection_graph(self,sizes=None) |
PositiveIntegers() |
designs.balanced_incomplete_block_design(19,3) |
BIBD.intersection_graph(1) |
G.is_strongly_regular(parameters=True) |
PositiveIntegers() |
PositiveIntegers() |
Set(v) |
Graph([V, lambda x,y: len(x & y) |
incidence_matrix(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.block_sizes() |
BD.incidence_matrix() |
IncidenceStructure('abc', ('ab','abc','ac','c') |
I.incidence_matrix() |
Matrix(ZZ, self.num_points() |
self.num_blocks() |
enumerate(self._blocks) |
incidence_graph(self,labels=False) |
some (rare) |
IncidenceStructure(7, [[0,1,2],[0,3,4],[0,5,6],[1,3,5],[1,4,6],[2,3,6],[2,4,5]]) |
BD.incidence_graph() |
BD.incidence_matrix() |
Graph(block_matrix([[A*0,A],[A.transpose() |
BD.incidence_graph() |
BD.incidence_graph(labels=True) |
has_edge(0,Set([0,1,2]) |
Graph() |
G.add_vertices(self.ground_set() |
self.blocks() |
Set(b) |
G.add_vertex(b) |
G.add_edges((b,x) |
self.incidence_matrix() |
BipartiteGraph(A) |
complement(self,uniform=False) |
designs.balanced_incomplete_block_design(13,4) |
bibd.is_t_design(return_parameters=True) |
bibd.complement() |
is_t_design(return_parameters=True) |
graphs.PetersenGraph() |
IncidenceStructure(g.edges(labels=False) |
G.complement(uniform=True) |
Graph(H.blocks() |
h.complement() |
bibd.relabel({i:str(i) |
bibd.ground_set() |
bibd.complement() |
ground_set() |
IncidenceStructure('abc', ['ab','ac','bc']) |
I.is_t_design(return_parameters=True) |
self.is_uniform() |
ValueError("The incidence structure is not uniform.") |
self.num_blocks() |
combinations(range(self.num_points() |
list(B) |
blocks.append(B) |
IncidenceStructure(blocks,copy=False) |
set(range(self.num_points() |
IncidenceStructure([X.difference(B) |
I.relabel({i:self._points[i] for i in range(self.num_points() |
relabel(self, perm=None, inplace=True) |
designs.transversal_design(5,5) |
TD.relabel({i:chr(97+i) |
range(25) |
TD.ground_set() |
TD.blocks() |
TD.relabel() |
TD.blocks() |
I.relabel() |
permutations([0,1,2,3,4]) |
I.relabel(p,inplace=False) |
print(p) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.