Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
trac #17309: Broken doc and typo
Browse files Browse the repository at this point in the history
  • Loading branch information
nathanncohen committed Feb 25, 2015
1 parent dad6191 commit d83413a
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 3 deletions.
1 change: 1 addition & 0 deletions src/doc/en/reference/combinat/module_list.rst
Original file line number Diff line number Diff line change
Expand Up @@ -91,6 +91,7 @@ Comprehensive Module list
sage/combinat/designs/orthogonal_arrays_build_recursive
sage/combinat/designs/orthogonal_arrays_find_recursive
sage/combinat/designs/steiner_quadruple_systems
sage/combinat/designs/subhypergraph_search
sage/combinat/diagram_algebras
sage/combinat/dict_addition
sage/combinat/dlx
Expand Down
6 changes: 3 additions & 3 deletions src/sage/combinat/designs/incidence_structures.py
Original file line number Diff line number Diff line change
Expand Up @@ -586,9 +586,9 @@ def isomorphic_substructures_iterator(self, H2,induced=False):
sage: sum(1 for _ in IP.isomorphic_substructures_iterator(IC))
120
As the automorphism group of `C_5` has size 10, the number of disjoint
copies is 12. Let us check that all functions returned correspond to an
actual `C_5` subgraph::
As the automorphism group of `C_5` has size 10, the number of distinct
unlabelled copies is 12. Let us check that all functions returned
correspond to an actual `C_5` subgraph::
sage: for f in IP.isomorphic_substructures_iterator(IC):
....: assert all(P.has_edge(f[x],f[y]) for x,y in C.edges(labels=False))
Expand Down

0 comments on commit d83413a

Please sign in to comment.