code stringlengths 3 6.57k |
|---|
label (if necessary) |
designs.projective_plane(3) |
IS1.relabel(Permutations(IS1.ground_set() |
random_element() |
IncidenceStructure(IS2.blocks() |
IS1.is_isomorphic(IS2) |
if (self.num_points() |
other.num_points() |
self.num_blocks() |
other.num_blocks() |
sorted(self.block_sizes() |
sorted(other.block_sizes() |
self.canonical_label() |
other.canonical_label() |
self.relabel(A_canon,inplace=False) |
other.relabel(B_canon,inplace=False) |
six.iteritems(B_canon) |
six.iteritems(A_canon) |
isomorphic_substructures_iterator(self, H2,induced=False) |
V(H_2) |
V(H_1) |
E(H_2) |
f(S2) |
E(H_1) |
E(H_1) |
f(V(H_2) |
E(H_2) |
E(H_1) |
f(V(H_2) |
graphs.PetersenGraph() |
graphs.CycleGraph(5) |
IncidenceStructure(P.edges(labels=False) |
IncidenceStructure(C.edges(labels=False) |
sum(1 for _ in IP.isomorphic_substructures_iterator(IC) |
IP.isomorphic_substructures_iterator(IC) |
all(P.has_edge(f[x],f[y]) |
C.edges(labels=False) |
sum(1 for _ in IP.isomorphic_substructures_iterator(IC,induced=True) |
P.add_edges([(0,x) |
IncidenceStructure(P.edges(labels=False) |
IncidenceStructure(C.edges(labels=False) |
sum(1 for _ in IP.isomorphic_substructures_iterator(IC) |
sum(1 for _ in IP.isomorphic_substructures_iterator(IC,induced=True) |
designs.projective_plane(3) |
sum(1 for _ in H.isomorphic_substructures_iterator(H) |
H.automorphism_group() |
cardinality() |
SubHypergraphSearch(self,H2,induced=induced) |
copy(self) |
IncidenceStructure([[1,2,3,"e"]],name="Test") |
copy(IS) |
copy(IS) |
copy(IS) |
IS.relabel(dict(zip(range(self.num_points() |
induced_substructure(self, points) |
designs.steiner_triple_system(7) |
F.induced_substructure([0..5]) |
F.induced_substructure([0..50]) |
Traceback (most recent call last) |
F.relabel(dict(enumerate("abcdefg") |
F.induced_substructure("abc") |
F.induced_substructure("Y") |
Traceback (most recent call last) |
self.num_points() |
int(x) |
ValueError("{} is not a point of the incidence structure".format(x) |
ValueError("{} is not a point of the incidence structure".format(bad_pt) |
set(int_points) |
int_points.issuperset(S) |
trace(self, points, min_size=1, multiset=True) |
designs.projective_plane(4) |
designs.projective_plane(2) |
Subsets(P4.ground_set() |
P4.trace(x,min_size=2) |
is_isomorphic(F) |
P4.trace(x,min_size=2) |
subplane.is_isomorphic(F) |
F.trace([0..50]) |
Traceback (most recent call last) |
F.relabel(dict(enumerate("abcdefg") |
F.trace("abc") |
F.trace("Y") |
Traceback (most recent call last) |
self.num_points() |
frozenset(int(x) |
ValueError("{} is not a point of the incidence structure".format(x) |
frozenset(self._point_to_index[x] for x in points) |
ValueError("{} is not a point of the incidence structure".format(bad_pt) |
int_points.intersection(S) |
len(S) |
set(blocks) |
IncidenceStructure(blocks) |
IS.relabel({i:self._points[i] for i in int_points}) |
ground_set(self) |
set (i.e the list of points) |
IncidenceStructure(3, [[0,1],[0,2]]) |
ground_set() |
num_points(self) |
designs.DesarguesianProjectivePlaneDesign(2) |
num_points() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.