code stringlengths 3 6.57k |
|---|
Program (LP) |
integer (default: ``0``) |
designs.transversal_design(2,2,resolvable=True) |
TD.is_resolvable() |
designs.AffineGeometryDesign(3,1,GF(2) |
AG.is_resolvable() |
TD.is_resolvable(True) |
AG.is_resolvable(True) |
designs.balanced_incomplete_block_design(7,3) |
Fano.is_resolvable() |
Fano.is_resolvable(True) |
AG.is_resolvable(certificate=True) |
AG.is_resolvable(certificate=True) |
set(itervalues(self.degrees() |
len(degrees) |
degrees.pop() |
MixedIntegerLinearProgram(solver=solver) |
p.new_variable(binary=True) |
list(range(self.num_points() |
enumerate(self._blocks) |
append(i) |
range(n_classes) |
p.add_constraint(p.sum(b[t,i] for i in dual[x]) |
range(len(self._blocks) |
p.add_constraint(p.sum(b[t,i] for t in range(n_classes) |
p.solve(log=verbose) |
range(n_classes) |
for (t,i) |
six.iteritems(p.get_values(b) |
append(self._blocks[i]) |
sorted(id(c) |
sorted(id(b) |
list(range(self.num_points() |
enumerate(self._classes) |
sorted(sum(c,[]) |
format(i) |
return (False, []) |
return (True, classes) |
coloring(self, k=None, solver=None, verbose=0) |
a (weak) |
Program (LP) |
integer (default: ``0``) |
len(designs.steiner_triple_system(7) |
coloring() |
designs.steiner_triple_system(7) |
coloring() |
graphs.PetersenGraph() |
IncidenceStructure(g.edges(labels=False) |
len(g.coloring() |
len(H.coloring() |
range(self.num_points() |
self.coloring(k) |
self.num_points() |
ValueError("Only empty hypergraphs are 0-chromatic") |
any(len(x) |
any(x for x in self._blocks) |
self.ground_set() |
MixedIntegerLinearProgram(solver=solver) |
p.new_variable(binary=True) |
range(self.num_points() |
p.add_constraint(p.sum(b[x,i] for i in range(k) |
range(k) |
p.add_constraint(p.sum(b[x,i] for x in s) |
len(s) |
p.solve(log=verbose) |
ValueError("This hypergraph is not {}-colorable".format(k) |
range(k) |
for (x,i) |
six.iteritems(p.get_values(b) |
append(self._points[x]) |
edge_coloring(self) |
Hypergraph([{1,2,3},{2,3,4},{3,4,5},{4,5,6}]) |
H.edge_coloring() |
Set(map(Set,sum(C,[]) |
Set(map(Set,H.blocks() |
self.blocks() |
frozenset(_) |
Graph([list(range(self.num_blocks() |
len(blocks_sets[x]&blocks_sets[y]) |
g.coloring(algorithm="MILP") |
_spring_layout(self) |
Hypergraph([{1,2,3},{2,3,4},{3,4,5},{4,5,6}]) |
H._spring_layout() |
all(v in L for v in H.ground_set() |
all(v in L for v in map(Set,H.blocks() |
Graph() |
map(Set, self.blocks() |
g.add_edge((0, s) |
g.plot(iterations = 50000,save_pos=True) |
round(x, 3) |
round(y, 3) |
g.get_pos() |
items() |
_latex_(self) |
Hypergraph([{1,2,3},{2,3,4},{3,4,5},{4,5,6}]) |
view(H) |
graphs.Grid2dGraph(5,5) |
graphs.CycleGraph(4) |
Set(map(Set,list(g.subgraph_search_iterator(C4) |
Hypergraph(sets) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.