Changeset 7775:630e737e0546
- Timestamp:
- 12/15/07 11:40:10 (5 years ago)
- Branch:
- default
- Location:
- sage
- Files:
-
- 3 edited
-
coding/binary_code.pyx (modified) (7 diffs)
-
graphs/graph_generators.py (modified) (1 diff)
-
graphs/graph_isom.pyx (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
sage/coding/binary_code.pyx
r7773 r7775 1766 1766 1 1767 1767 sage: P._refine(3, [[0,1]], B) 1768 5 581768 583 1769 1769 sage: P._split_vertex(2, 4) 1770 1770 2 1771 1771 sage: P._refine(4, [[0,2]], B) 1772 17 131772 1754 1773 1773 sage: P._split_vertex(3, 5) 1774 1774 3 … … 1848 1848 r = j 1849 1849 while True: 1850 if r == 0or self.col_lvls[r-1] == k:1850 if r == j or self.col_lvls[r-1] == k: 1851 1851 if r != t: 1852 1852 alpha[alpha_length] = r … … 1888 1888 r = j 1889 1889 while True: 1890 if r == 0or self.wd_lvls[r-1] == k:1890 if r == j or self.wd_lvls[r-1] == k: 1891 1891 if r != t_w: 1892 1892 alpha[alpha_length] = r^flag … … 1967 1967 1 1968 1968 sage: P._refine(2, [[0,1]], B) 1969 5 581969 583 1970 1970 sage: P._split_vertex(2, 3) 1971 1971 2 1972 1972 sage: P._refine(3, [[0,2]], B) 1973 17 131973 1754 1974 1974 sage: P._split_vertex(4, 4) 1975 1975 4 … … 2102 2102 1 2103 2103 sage: P._refine(2, [[0,1]], B) 2104 5 582104 583 2105 2105 sage: P._split_vertex(2, 3) 2106 2106 2 2107 2107 sage: P._refine(3, [[0,2]], B) 2108 17 132108 1754 2109 2109 sage: P._split_vertex(4, 4) 2110 2110 4 … … 2245 2245 2246 2246 EXAMPLES: 2247 sage: import sage.coding.binary_code 2248 sage: from sage.coding.binary_code import * 2249 sage: BC = BinaryCodeClassifier() 2250 2247 2251 sage: M = Matrix(GF(2),[\ 2248 2252 ... [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0],\ … … 2251 2255 ... [0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1],\ 2252 2256 ... [0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1]]) 2253 sage: import sage.coding.binary_code2254 sage: from sage.coding.binary_code import *2255 2257 sage: B = BinaryCode(M) 2256 sage: BC = BinaryCodeClassifier()2257 2258 sage: gens, labeling = BC._aut_gp_and_can_label(B) 2258 sage: S = SymmetricGroup( 16)2259 sage: S = SymmetricGroup(M.ncols()) 2259 2260 sage: L = [S([x+1 for x in g]) for g in gens] 2260 2261 sage: PermutationGroup(L).order() 2261 2262 322560 2263 2264 sage: M = Matrix(GF(2),[\ 2265 ... [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0],\ 2266 ... [0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0],\ 2267 ... [0,0,0,0,0,1,0,1,0,0,0,1,1,1,1,1,1],\ 2268 ... [0,0,0,1,1,0,0,0,0,1,1,0,1,1,0,1,1]]) 2269 sage: B = BinaryCode(M) 2270 sage: gens, labeling = BC._aut_gp_and_can_label(B) 2271 sage: S = SymmetricGroup(M.ncols()) 2272 sage: L = [S([x+1 for x in g]) for g in gens] 2273 sage: PermutationGroup(L).order() 2274 2304 2262 2275 2263 2276 """ -
sage/graphs/graph_generators.py
r7541 r7775 2733 2733 sage: L = list( graphs(8, lambda G: G.is_bipartite()) ) 2734 2734 sage: len(L) 2735 14 22735 143 2736 2736 2737 2737 Sloane A000088: -
sage/graphs/graph_isom.pyx
r7762 r7775 581 581 r = j 582 582 while True: 583 if r == 0or self.levels[r-1] == k:583 if r == j or self.levels[r-1] == k: 584 584 if r != t: 585 585 alpha[s] = r … … 625 625 r = j 626 626 while True: 627 if r == 0or self.levels[r-1] == k:627 if r == j or self.levels[r-1] == k: 628 628 if r != t: 629 629 alpha[s] = r
Note: See TracChangeset
for help on using the changeset viewer.
