passagemath-graphs 10.5.39__cp312-cp312-macosx_13_0_x86_64.whl → 10.5.44__cp312-cp312-macosx_13_0_x86_64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {passagemath_graphs-10.5.39.dist-info → passagemath_graphs-10.5.44.dist-info}/METADATA +82 -11
- {passagemath_graphs-10.5.39.dist-info → passagemath_graphs-10.5.44.dist-info}/RECORD +80 -80
- {passagemath_graphs-10.5.39.dist-info → passagemath_graphs-10.5.44.dist-info}/WHEEL +1 -1
- sage/all__sagemath_graphs.py +5 -0
- sage/combinat/abstract_tree.py +1 -1
- sage/combinat/binary_tree.py +1 -1
- sage/combinat/cluster_algebra_quiver/all.py +1 -1
- sage/combinat/cluster_algebra_quiver/cluster_seed.py +18 -12
- sage/combinat/cluster_algebra_quiver/interact.py +4 -0
- sage/combinat/designs/MOLS_handbook_data.py +5 -5
- sage/combinat/designs/bibd.py +1 -1
- sage/combinat/designs/covering_array.py +3 -3
- sage/combinat/designs/covering_design.py +2 -1
- sage/combinat/designs/designs_pyx.cpython-312-darwin.so +0 -0
- sage/combinat/designs/difference_matrices.py +1 -1
- sage/combinat/designs/evenly_distributed_sets.cpython-312-darwin.so +0 -0
- sage/combinat/designs/ext_rep.py +9 -14
- sage/combinat/designs/gen_quadrangles_with_spread.cpython-312-darwin.so +0 -0
- sage/combinat/designs/group_divisible_designs.py +1 -1
- sage/combinat/designs/latin_squares.py +1 -1
- sage/combinat/designs/orthogonal_arrays_find_recursive.cpython-312-darwin.so +0 -0
- sage/combinat/designs/resolvable_bibd.py +1 -1
- sage/combinat/designs/steiner_quadruple_systems.py +1 -1
- sage/combinat/designs/subhypergraph_search.cpython-312-darwin.so +0 -0
- sage/combinat/finite_state_machine_generators.py +2 -2
- sage/combinat/graph_path.py +3 -3
- sage/combinat/ordered_tree.py +1 -1
- sage/combinat/posets/cartesian_product.py +1 -1
- sage/combinat/posets/d_complete.py +1 -1
- sage/combinat/posets/forest.py +1 -1
- sage/combinat/posets/hasse_cython.cpython-312-darwin.so +0 -0
- sage/combinat/posets/incidence_algebras.py +1 -1
- sage/combinat/posets/linear_extension_iterator.cpython-312-darwin.so +0 -0
- sage/combinat/posets/linear_extensions.py +1 -11
- sage/combinat/posets/moebius_algebra.py +1 -1
- sage/combinat/rooted_tree.py +1 -1
- sage/graphs/asteroidal_triples.cpython-312-darwin.so +0 -0
- sage/graphs/base/boost_graph.cpython-312-darwin.so +0 -0
- sage/graphs/base/c_graph.cpython-312-darwin.so +0 -0
- sage/graphs/base/dense_graph.cpython-312-darwin.so +0 -0
- sage/graphs/base/graph_backends.cpython-312-darwin.so +0 -0
- sage/graphs/base/sparse_graph.cpython-312-darwin.so +0 -0
- sage/graphs/base/static_dense_graph.cpython-312-darwin.so +0 -0
- sage/graphs/base/static_sparse_backend.cpython-312-darwin.so +0 -0
- sage/graphs/base/static_sparse_graph.cpython-312-darwin.so +0 -0
- sage/graphs/centrality.cpython-312-darwin.so +0 -0
- sage/graphs/comparability.cpython-312-darwin.so +0 -0
- sage/graphs/connectivity.cpython-312-darwin.so +0 -0
- sage/graphs/convexity_properties.cpython-312-darwin.so +0 -0
- sage/graphs/distances_all_pairs.cpython-312-darwin.so +0 -0
- sage/graphs/edge_connectivity.cpython-312-darwin.so +0 -0
- sage/graphs/generators/distance_regular.cpython-312-darwin.so +0 -0
- sage/graphs/generic_graph_pyx.cpython-312-darwin.so +0 -0
- sage/graphs/genus.cpython-312-darwin.so +0 -0
- sage/graphs/graph_coloring.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/bandwidth.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/clique_separators.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/cutwidth.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/fast_digraph.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/graph_products.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/modular_decomposition.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/slice_decomposition.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/tree_decomposition.cpython-312-darwin.so +0 -0
- sage/graphs/graph_decompositions/vertex_separation.cpython-312-darwin.so +0 -0
- sage/graphs/graph_generators_pyx.cpython-312-darwin.so +0 -0
- sage/graphs/graph_list.py +2 -3
- sage/graphs/hyperbolicity.cpython-312-darwin.so +0 -0
- sage/graphs/independent_sets.cpython-312-darwin.so +0 -0
- sage/graphs/isoperimetric_inequalities.cpython-312-darwin.so +0 -0
- sage/graphs/line_graph.cpython-312-darwin.so +0 -0
- sage/graphs/path_enumeration.cpython-312-darwin.so +0 -0
- sage/graphs/spanning_tree.cpython-312-darwin.so +0 -0
- sage/graphs/strongly_regular_db.cpython-312-darwin.so +0 -0
- sage/graphs/traversals.cpython-312-darwin.so +0 -0
- sage/graphs/trees.cpython-312-darwin.so +0 -0
- sage/graphs/views.cpython-312-darwin.so +0 -0
- sage/graphs/weakly_chordal.cpython-312-darwin.so +0 -0
- sage/groups/perm_gps/partn_ref/refinement_graphs.cpython-312-darwin.so +0 -0
- sage/sandpiles/sandpile.py +1 -2
- {passagemath_graphs-10.5.39.dist-info → passagemath_graphs-10.5.44.dist-info}/top_level.txt +0 -0
@@ -1,6 +1,6 @@
|
|
1
1
|
Metadata-Version: 2.4
|
2
2
|
Name: passagemath-graphs
|
3
|
-
Version: 10.5.
|
3
|
+
Version: 10.5.44
|
4
4
|
Summary: passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers
|
5
5
|
Author-email: The Sage Developers <sage-support@googlegroups.com>
|
6
6
|
Maintainer: Matthias Köppe, passagemath contributors
|
@@ -29,9 +29,10 @@ Classifier: Topic :: Scientific/Engineering :: Mathematics
|
|
29
29
|
Requires-Python: <3.14,>=3.9
|
30
30
|
Description-Content-Type: text/x-rst
|
31
31
|
Requires-Dist: gmpy2~=2.1.b999
|
32
|
-
Requires-Dist: cysignals
|
32
|
+
Requires-Dist: cysignals!=1.12.0,>=1.11.2
|
33
33
|
Requires-Dist: memory_allocator
|
34
|
-
Requires-Dist: passagemath-categories~=10.5.
|
34
|
+
Requires-Dist: passagemath-categories~=10.5.44.0
|
35
|
+
Requires-Dist: passagemath-environment~=10.5.44.0
|
35
36
|
Provides-Extra: test
|
36
37
|
Requires-Dist: passagemath-repl; extra == "test"
|
37
38
|
Provides-Extra: benzene
|
@@ -42,6 +43,8 @@ Provides-Extra: buckygen
|
|
42
43
|
Requires-Dist: passagemath-buckygen; extra == "buckygen"
|
43
44
|
Provides-Extra: cliquer
|
44
45
|
Requires-Dist: passagemath-cliquer; extra == "cliquer"
|
46
|
+
Provides-Extra: cmr
|
47
|
+
Requires-Dist: passagemath-cmr; extra == "cmr"
|
45
48
|
Provides-Extra: gap
|
46
49
|
Requires-Dist: passagemath-gap; extra == "gap"
|
47
50
|
Provides-Extra: igraph
|
@@ -68,6 +71,9 @@ Provides-Extra: combinat
|
|
68
71
|
Requires-Dist: passagemath-combinat; extra == "combinat"
|
69
72
|
Provides-Extra: editor
|
70
73
|
Requires-Dist: phitigra>=0.2.6; extra == "editor"
|
74
|
+
Provides-Extra: groups
|
75
|
+
Requires-Dist: passagemath-groups; extra == "groups"
|
76
|
+
Requires-Dist: passagemath-graphs[nauty]; extra == "groups"
|
71
77
|
Provides-Extra: homology
|
72
78
|
Requires-Dist: passagemath-modules; extra == "homology"
|
73
79
|
Provides-Extra: mip
|
@@ -83,7 +89,8 @@ Requires-Dist: passagemath-repl; extra == "repl"
|
|
83
89
|
Provides-Extra: sat
|
84
90
|
Requires-Dist: passagemath-combinat; extra == "sat"
|
85
91
|
Provides-Extra: standard
|
86
|
-
Requires-Dist: passagemath-graphs[combinat,databases,mip,modules,planarity,
|
92
|
+
Requires-Dist: passagemath-graphs[combinat,databases,groups,mip,modules,planarity,polyhedra,rankwidth,repl]; extra == "standard"
|
93
|
+
Requires-Dist: passagemath-plot[tachyon]; extra == "standard"
|
87
94
|
|
88
95
|
=======================================================================================================================================================
|
89
96
|
passagemath: Graphs, posets, hypergraphs, designs, abstract complexes, combinatorial polyhedra, abelian sandpiles, quivers
|
@@ -134,7 +141,7 @@ so compilation from source is triggered for those.
|
|
134
141
|
About this pip-installable distribution package
|
135
142
|
-----------------------------------------------
|
136
143
|
|
137
|
-
This pip-installable package `passagemath-graphs` is a distribution of a part of the Sage Library. It provides a small subset of the modules of the Sage library ("sagelib", `
|
144
|
+
This pip-installable package `passagemath-graphs` is a distribution of a part of the Sage Library. It provides a small subset of the modules of the Sage library ("sagelib", `passagemath-standard`) for computations with graphs, posets, complexes, etc.
|
138
145
|
|
139
146
|
It consists of over 170 first-party Python and Cython modules and uses the `Boost Graph Library <https://github.com/boostorg/graph>`_, with additional functionality from `NetworkX <https://networkx.github.io/>`_ and several other libraries.
|
140
147
|
|
@@ -181,32 +188,96 @@ A quick way to try it out interactively::
|
|
181
188
|
Available as extras, from other distributions
|
182
189
|
---------------------------------------------
|
183
190
|
|
191
|
+
Libraries
|
192
|
+
~~~~~~~~~
|
193
|
+
|
194
|
+
``pip install passagemath-graphs[benzene,buckygen,plantri]`` additionally make
|
195
|
+
various graph generators available via `passagemath-benzene <https://pypi.org/project/passagemath-benzene/>`_, `passagemath-buckygen <https://pypi.org/project/passagemath-buckygen/>`_, and `passagemath-plantri <https://pypi.org/project/passagemath-plantri/>`_.
|
196
|
+
|
197
|
+
``pip install passagemath-graphs[bliss]`` additionally installs `passagemath-bliss <https://pypi.org/project/passagemath-bliss/>`_ for the purpose
|
198
|
+
of computing graph (iso/auto)morphisms.
|
199
|
+
|
200
|
+
``pip install passagemath-graphs[cliquer]`` additionally installs `passagemath-cliquer <https://pypi.org/project/passagemath-cliquer/>`_
|
201
|
+
|
202
|
+
``pip install passagemath-graphs[cmr]`` additionally installs `passagemath-cmr <https://pypi.org/project/passagemath-cmr/>`_ for recognition and decomposition algorithms
|
203
|
+
for network matrices, totally unimodular matrices and regular matroids, series-parallel matroids, etc.
|
204
|
+
|
205
|
+
``pip install passagemath-graphs[gap]`` additionally installs `passagemath-gap <https://pypi.org/project/passagemath-gap/>`_ for group-theoretic functionality.
|
206
|
+
|
207
|
+
``pip install passagemath-graphs[igraph]`` additionally installs
|
208
|
+
`igraph <https://python.igraph.org/en/stable/>`_::
|
209
|
+
|
210
|
+
$ pipx run --pip-args="--prefer-binary" --spec "passagemath-graphs[igraph,test]" ipython
|
211
|
+
In [1]: from sage.all__sagemath_graphs import *
|
212
|
+
|
213
|
+
In [2]: ## Example depending on igraph goes here
|
214
|
+
|
215
|
+
``pip install passagemath-graphs[mcqd]`` additionally installs `passagemath-mcqd <https://pypi.org/project/passagemath-mcqd/>`_
|
216
|
+
|
217
|
+
``pip install passagemath-graphs[nauty]`` additionally installs `passagemath-nauty <https://pypi.org/project/passagemath-nauty/>`_ for computing
|
218
|
+
automorphism groups of graphs and digraphs.
|
219
|
+
|
184
220
|
``pip install passagemath-graphs[networkx]`` additionally installs
|
185
|
-
`NetworkX <https://networkx.github.io
|
221
|
+
`NetworkX <https://networkx.github.io>`__::
|
186
222
|
|
187
223
|
$ pipx run --pip-args="--prefer-binary" --spec "passagemath-graphs[networkx,test]" ipython
|
188
224
|
In [1]: from sage.all__sagemath_graphs import *
|
189
225
|
|
190
226
|
In [2]: ## Example depending on networkx goes here
|
191
227
|
|
228
|
+
``pip install passagemath-graphs[pari]`` additionally installs `passagemath-pari <https://pypi.org/project/passagemath-pari/>`_
|
192
229
|
|
193
|
-
``pip install passagemath-graphs[
|
194
|
-
`igraph <https://python.igraph.org/en/stable/>`::
|
230
|
+
``pip install passagemath-graphs[planarity]`` additionally installs `passagemath-planarity <https://pypi.org/project/passagemath-planarity/>`_ for planarity testing.
|
195
231
|
|
196
|
-
|
232
|
+
``pip install passagemath-graphs[rankwidth]`` additionally installs `passagemath-rankwidth <https://pypi.org/project/passagemath-rankwidth/>`_ for rank width and rank decompositions.
|
233
|
+
|
234
|
+
``pip install passagemath-graphs[tdlib]`` additionally installs `passagemath-tdlib <https://pypi.org/project/passagemath-tdlib/>`_ for computing tree decompositions.
|
235
|
+
|
236
|
+
|
237
|
+
Features
|
238
|
+
~~~~~~~~
|
239
|
+
|
240
|
+
``pip install passagemath-graphs[combinat]`` additionally installs `passagemath-combinat <https://pypi.org/project/passagemath-combinat/>`_
|
241
|
+
|
242
|
+
``pip install passagemath-graphs[editor]`` additionally installs the interactive graph editor `phitigra <https://pypi.org/project/phitigra/>`_.
|
243
|
+
|
244
|
+
``pip install passagemath-graphs[groups]`` additionally makes group-theoretic features
|
245
|
+
available via `passagemath-gap <https://pypi.org/project/passagemath-gap/>`_, `passagemath-groups <https://pypi.org/project/passagemath-groups/>`_, and `passagemath-nauty <https://pypi.org/project/passagemath-nauty/>`_::
|
246
|
+
|
247
|
+
$ pipx run --pip-args="--prefer-binary" --spec "passagemath-graphs[groups,test]" ipython
|
197
248
|
In [1]: from sage.all__sagemath_graphs import *
|
198
249
|
|
199
|
-
In [2]:
|
250
|
+
In [2]: g = Graph({
|
251
|
+
0: [1, 2],
|
252
|
+
1: [0, 2],
|
253
|
+
2: [0, 1, 3],
|
254
|
+
3: [2]
|
255
|
+
})
|
256
|
+
|
257
|
+
In [3]: aut = g.automorphism_group()
|
200
258
|
|
259
|
+
In [4]: print(aut.order())
|
260
|
+
|
261
|
+
``pip install passagemath-graphs[homology]`` provides homological computations for abstract complexes via `passagemath-modules <https://pypi.org/project/passagemath-modules/>`_.
|
201
262
|
|
202
263
|
``pip install passagemath-graphs[mip]`` additionally makes the mixed-integer programming
|
203
|
-
solver GLPK available
|
264
|
+
solver GLPK available via `passagemath-glpk <https://pypi.org/project/passagemath-glpk/>`_ and `passagemath-polyhedra <https://pypi.org/project/passagemath-polyhedra/>`_ (see there for other available solvers).::
|
204
265
|
|
205
266
|
$ pipx run --pip-args="--prefer-binary" --spec "passagemath-graphs[mip,test]" ipython
|
206
267
|
In [1]: from sage.all__sagemath_graphs import *
|
207
268
|
|
208
269
|
In [2]: ## Example depending on MIP goes here
|
209
270
|
|
271
|
+
``pip install passagemath-graphs[modules]`` additionally makes linear algebra features available via `passagemath-modules <https://pypi.org/project/passagemath-modules/>`_.
|
272
|
+
|
273
|
+
``pip install passagemath-graphs[plot]`` additionally installs `passagemath-plot <https://pypi.org/project/passagemath-plot/>`_.
|
274
|
+
|
275
|
+
``pip install passagemath-graphs[polyhedra]`` additionally installs `passagemath-polyhedra <https://pypi.org/project/passagemath-polyhedra/>`_.
|
276
|
+
|
277
|
+
``pip install passagemath-graphs[sat]`` additionally provides SAT features via `passagemath-combinat <https://pypi.org/project/passagemath-combinat/>`_.
|
278
|
+
|
279
|
+
``pip install passagemath-graphs[standard]`` installs all libraries and features related to graphs that
|
280
|
+
are available in a standard installation of Sage.
|
210
281
|
|
211
282
|
|
212
283
|
Development
|
@@ -1,9 +1,9 @@
|
|
1
|
-
passagemath_graphs-10.5.
|
2
|
-
passagemath_graphs-10.5.
|
3
|
-
passagemath_graphs-10.5.
|
4
|
-
passagemath_graphs-10.5.
|
1
|
+
passagemath_graphs-10.5.44.dist-info/RECORD,,
|
2
|
+
passagemath_graphs-10.5.44.dist-info/WHEEL,sha256=teO2xh-FJ1HNVGe5DhoP69xaQDzWk7o1JLSQ2CMfYdA,137
|
3
|
+
passagemath_graphs-10.5.44.dist-info/top_level.txt,sha256=Kmzulf9WsphADFQuqgvdy5mvTLDj_V2zkFHU2s3UXos,6
|
4
|
+
passagemath_graphs-10.5.44.dist-info/METADATA,sha256=kvqJOW0_Kwm2owzDqAsbWP1OwEZexskMy624Cm-l4wk,14024
|
5
5
|
passagemath_graphs.dylibs/libgmp.10.dylib,sha256=KWbopqse81gamnnS9s6RJUAT7etWefG99meCR47T7pI,580928
|
6
|
-
sage/all__sagemath_graphs.py,sha256=
|
6
|
+
sage/all__sagemath_graphs.py,sha256=q3QFFFTkeijGtFSjZtlnAko3Mrnr8fK-m5Yghw2VQyM,837
|
7
7
|
sage/topology/simplicial_complex_catalog.py,sha256=JGHpK2P6JilXIbnSIanraJTST2SQaHSqBWg8ZAlqhFU,4396
|
8
8
|
sage/topology/simplicial_complex_homset.py,sha256=8wSfpi6t6qQpRW1CkLSb36eFieflaYQKpcshdEjutZ8,7425
|
9
9
|
sage/topology/simplicial_set_constructions.py,sha256=5Qw7TdOn10-NjSf8Vfrfc73-WEjKSnqFcHI3mi2SkcE,115261
|
@@ -22,73 +22,73 @@ sage/topology/simplicial_complex.py,sha256=5rPDy-11TzNggeM-QKDYt21KAGAzmcMULNAnk
|
|
22
22
|
sage/topology/cell_complex.py,sha256=2La9yE3TJ5Rtm4CY-LqKC6LrUofaufqQUaoVN7G8p00,47382
|
23
23
|
sage/databases/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
|
24
24
|
sage/databases/knotinfo_db.py,sha256=EafNspIultVKdtZrwtzYySTGxPun0oTXN_zFCwagYQE,54188
|
25
|
-
sage/combinat/graph_path.py,sha256=
|
25
|
+
sage/combinat/graph_path.py,sha256=enqb7IFVXGZ-roxtMJRTaTmCDY3qr_kkjC-03qg0p5s,13122
|
26
26
|
sage/combinat/shard_order.py,sha256=hULsSgJS39xMwEe8UrNCkoTZii41V-cROxE0PAvsE8k,8060
|
27
|
-
sage/combinat/binary_tree.py,sha256
|
28
|
-
sage/combinat/abstract_tree.py,sha256=
|
27
|
+
sage/combinat/binary_tree.py,sha256=BnjdPKrHRxtJrlKmUSHqrDDQ0UvQbm8onuh0IHpSGV0,183189
|
28
|
+
sage/combinat/abstract_tree.py,sha256=mE_VtaSWztO_BJHthsJNhvD3mCTf2wVfHQr-3--169k,88714
|
29
29
|
sage/combinat/nu_tamari_lattice.py,sha256=DIZ3Y-hyxvATa_NZDJKv3mzlUcjKVSS7N_drsJ9LDzY,9457
|
30
|
-
sage/combinat/ordered_tree.py,sha256=
|
30
|
+
sage/combinat/ordered_tree.py,sha256=Q08B55_8JZPxiymIAh5bbhiepvWtjj3T96owcR0mLfw,47856
|
31
31
|
sage/combinat/finite_state_machine.py,sha256=nOn9HzDZljzaNaTY_x4eL39HkM_2TbRreqXvk3X_XsI,574609
|
32
|
-
sage/combinat/finite_state_machine_generators.py,sha256=
|
32
|
+
sage/combinat/finite_state_machine_generators.py,sha256=YqeqpPwWpra88B4GW5IcA2rtbXpbeT9uGxREegTJFdM,73186
|
33
33
|
sage/combinat/all__sagemath_graphs.py,sha256=zAse3aKr_WJaFWDL93rOM8mNuHUvs_hs0gJsoxfbqiQ,1329
|
34
34
|
sage/combinat/yang_baxter_graph.py,sha256=BGcGaIfAnOzW4g9tCg6uDpKrHHeG-Q5z74TBQa0JYhc,33932
|
35
35
|
sage/combinat/interval_posets.py,sha256=n1EpZC2XnwvRAPiG-fA5c66krNlO2V-kox9LwgawHu0,147095
|
36
|
-
sage/combinat/rooted_tree.py,sha256=
|
36
|
+
sage/combinat/rooted_tree.py,sha256=HwZ6OlSwROTXZoZsgPEd4Hz9VqYPMsZYXdrO-PbcT4s,34211
|
37
37
|
sage/combinat/tamari_lattices.py,sha256=1K261Ntyt3uZqkFVVTC_PVyimDFomOeJeEW3UAwqpQc,11061
|
38
|
-
sage/combinat/designs/covering_array.py,sha256=
|
39
|
-
sage/combinat/designs/difference_matrices.py,sha256=
|
40
|
-
sage/combinat/designs/designs_pyx.cpython-312-darwin.so,sha256=
|
41
|
-
sage/combinat/designs/resolvable_bibd.py,sha256=
|
38
|
+
sage/combinat/designs/covering_array.py,sha256=SC7dwTzNt4lYJk_FKRUt_EsaOYjFRXMJus2i8NKGP84,9600
|
39
|
+
sage/combinat/designs/difference_matrices.py,sha256=H1gvPjsH890ASH66zSJj36yiFMIU_C40xYZA609eawE,8610
|
40
|
+
sage/combinat/designs/designs_pyx.cpython-312-darwin.so,sha256=2vou_uwD7EHJHdG6Q-Fg1m6wSbnbDudw9BjqfhQi8SA,284976
|
41
|
+
sage/combinat/designs/resolvable_bibd.py,sha256=zZyP6-dTavplbCFR5vGa4zjb8tHqmn6FRF8NrPIrt4s,29761
|
42
42
|
sage/combinat/designs/twographs.py,sha256=xr84mamGdA-DIGcti5mVhEIvwlkmOt5pBwv8RKe1whM,11227
|
43
|
-
sage/combinat/designs/steiner_quadruple_systems.py,sha256
|
43
|
+
sage/combinat/designs/steiner_quadruple_systems.py,sha256=-vnODm9iybM9_x36oDOFMZyu_kMaMTZWYbzcWAvaG0E,68601
|
44
44
|
sage/combinat/designs/orthogonal_arrays.py,sha256=MuJ5C7NtafuJUfjvzl9n1dea5Uwl6GgroEcDgWHSlXg,82581
|
45
|
-
sage/combinat/designs/orthogonal_arrays_find_recursive.cpython-312-darwin.so,sha256=
|
46
|
-
sage/combinat/designs/ext_rep.py,sha256=
|
47
|
-
sage/combinat/designs/MOLS_handbook_data.py,sha256=
|
45
|
+
sage/combinat/designs/orthogonal_arrays_find_recursive.cpython-312-darwin.so,sha256=ylO2e5r3nCdLBWhqp-zbV0S1Fe-F6NoEJMgwylBSBYw,217872
|
46
|
+
sage/combinat/designs/ext_rep.py,sha256=4t0xjnVqEyZUQn9L4JxvSt2wlhHJoY3Xz6uAP3L6_7g,34884
|
47
|
+
sage/combinat/designs/MOLS_handbook_data.py,sha256=SOjglkjrMNtbttoKD5werH6IXSUMwt1Zh_cOLOPSwTU,42437
|
48
48
|
sage/combinat/designs/subhypergraph_search.pyx,sha256=HLopGk2XtAZXaMHWSrAhhBdJC87szaeaNrcKpvSAFvA,18125
|
49
49
|
sage/combinat/designs/block_design.py,sha256=PHZG5Q9egUb7PwVnX2MQq6UPATxZPp5zq_VpJzWLAxU,38165
|
50
50
|
sage/combinat/designs/database.py,sha256=3zky0T2enXCAIFXfsHUlB1z2JsGbIuNpC8HFEHltgT0,242946
|
51
51
|
sage/combinat/designs/orthogonal_arrays_build_recursive.py,sha256=Ley_eOHwF1sOk9MukJDOM8KlPLT-JVdA7hqPz42Z_YU,70698
|
52
|
-
sage/combinat/designs/group_divisible_designs.py,sha256=
|
52
|
+
sage/combinat/designs/group_divisible_designs.py,sha256=U8YLCTUbbsdmWH8aiKqxWHv3AFNHqmCh1eoVFELIch4,13037
|
53
53
|
sage/combinat/designs/designs_pyx.pxd,sha256=d78q7gQf58kZirLF1TXxNjLi50YYo-EIUM2e4kXS5C8,679
|
54
54
|
sage/combinat/designs/all.py,sha256=z1avRgBKp3Gu_OhxVMFYtxWoXCBOcFd_t5-C1JcoAkw,2015
|
55
|
-
sage/combinat/designs/bibd.py,sha256=
|
56
|
-
sage/combinat/designs/latin_squares.py,sha256=
|
55
|
+
sage/combinat/designs/bibd.py,sha256=fB_aPra3Cbr4uqef4vLN1sIKJ9yXn-teFGMOzrkRpiw,59071
|
56
|
+
sage/combinat/designs/latin_squares.py,sha256=2O6O35hCPlemoRn4RzBQFgwjZyANoBO92cN8aMAxe5s,21834
|
57
57
|
sage/combinat/designs/evenly_distributed_sets.pyx,sha256=VktfzlQuB6wJVY6kk63YAXtSsh4yaO8i4XiWmOvs02Y,25543
|
58
58
|
sage/combinat/designs/gen_quadrangles_with_spread.pyx,sha256=oE049xlfXkX_ly-WpQZnPw2cNXYDueHeuRJ69bfTbkQ,10767
|
59
59
|
sage/combinat/designs/designs_pyx.pyx,sha256=e3RtTEz6VofqnfFNpJHrTLhZ_eRdKsxSHDmkjV3_RXY,37180
|
60
60
|
sage/combinat/designs/incidence_structures.py,sha256=-a1Ub9q_91055qr-Ns3CuQduJvVmVqja2tBbMRu0u4Q,89619
|
61
61
|
sage/combinat/designs/orthogonal_arrays_find_recursive.pyx,sha256=IIiOkj4T2ibHoUefBPxWxAN7n0gtzWQd6Cbii2ullbM,34298
|
62
62
|
sage/combinat/designs/design_catalog.py,sha256=u9FpOxLuNuEcRxOU3C9P_bw-OGqQL0qgGsjUFFx7Icc,5095
|
63
|
-
sage/combinat/designs/evenly_distributed_sets.cpython-312-darwin.so,sha256=
|
64
|
-
sage/combinat/designs/subhypergraph_search.cpython-312-darwin.so,sha256=
|
65
|
-
sage/combinat/designs/covering_design.py,sha256=
|
63
|
+
sage/combinat/designs/evenly_distributed_sets.cpython-312-darwin.so,sha256=lCYLbb21Bf8E4I0DVEP_XafEWGj2qc7jsQMdDjbaixA,215072
|
64
|
+
sage/combinat/designs/subhypergraph_search.cpython-312-darwin.so,sha256=nC1Fkz3FO5fZ4fCgwUvXA3Pc5RLz48kBqHqzmPCFyIs,127392
|
65
|
+
sage/combinat/designs/covering_design.py,sha256=ysOReKTgxyYD5EVwNqd3iWESWM8oLJ5gQLRmQJrSa1A,17380
|
66
66
|
sage/combinat/designs/difference_family.py,sha256=0fhKdWJVL0uErG5BwLfJKt2cDgF8gHIkudLtF6So1rI,155391
|
67
|
-
sage/combinat/designs/gen_quadrangles_with_spread.cpython-312-darwin.so,sha256=
|
67
|
+
sage/combinat/designs/gen_quadrangles_with_spread.cpython-312-darwin.so,sha256=9q2okIGTxaXmVeiTFwLCLs7GxN1ludqirwnAinLXsHY,161432
|
68
68
|
sage/combinat/cluster_algebra_quiver/quiver.py,sha256=6-EKk63ZQdHekayChrNd24M8CZpGTNZ5DQujNDQ9tfQ,86317
|
69
69
|
sage/combinat/cluster_algebra_quiver/mutation_type.py,sha256=MexdkgJF64f58LdVPDLaqdUYNtTbt4oCt7Gm5R-HKGg,76837
|
70
70
|
sage/combinat/cluster_algebra_quiver/mutation_class.py,sha256=cv4g59ZLppsG55L2t5ec0TviJ0yuCqozpakIBGFAUUQ,24134
|
71
|
-
sage/combinat/cluster_algebra_quiver/all.py,sha256=
|
71
|
+
sage/combinat/cluster_algebra_quiver/all.py,sha256=Kn96IeqXORbsHL0NSlKT3mKDtcM2biPzgxNrab-BiXY,831
|
72
72
|
sage/combinat/cluster_algebra_quiver/quiver_mutation_type.py,sha256=24QBRRseafrBvShSJC_ilP7nY6QwDX0U1GkMDxFhoBA,92005
|
73
|
-
sage/combinat/cluster_algebra_quiver/cluster_seed.py,sha256=
|
74
|
-
sage/combinat/cluster_algebra_quiver/interact.py,sha256=
|
73
|
+
sage/combinat/cluster_algebra_quiver/cluster_seed.py,sha256=8WyDGr-i77io5pC5xSCdMP-0ssdWxLZKyKVTN6eMx-Y,197656
|
74
|
+
sage/combinat/cluster_algebra_quiver/interact.py,sha256=ZKeMsySh5KcaMtnbfEbftKSYwCcRrkZjllaushry3N8,4266
|
75
75
|
sage/combinat/posets/posets.py,sha256=IVvddH6UUbUjFI1WhY6zKQUJBeC7UuhhfOOKEmZI1o8,332834
|
76
|
-
sage/combinat/posets/hasse_cython.cpython-312-darwin.so,sha256=
|
76
|
+
sage/combinat/posets/hasse_cython.cpython-312-darwin.so,sha256=zI0TGyNnRAENHdZuX32V1g3uNsfwyl16WEfNDrOUakA,152544
|
77
77
|
sage/combinat/posets/poset_examples.py,sha256=23w6JjtzVyOR9RV-L8K1zLP41wUcI7H2ENtoLURt_IU,77050
|
78
|
-
sage/combinat/posets/moebius_algebra.py,sha256=
|
78
|
+
sage/combinat/posets/moebius_algebra.py,sha256=GmJdyCNhmIeT-hE0d-djJLRd2jgBtydPNyNgmG49Jfc,26371
|
79
79
|
sage/combinat/posets/lattices.py,sha256=W2fN9oRs5dUUTX5cbw7iFFeEAj3c3oExhPQCEputFbQ,186239
|
80
|
-
sage/combinat/posets/incidence_algebras.py,sha256=
|
81
|
-
sage/combinat/posets/linear_extension_iterator.cpython-312-darwin.so,sha256=
|
80
|
+
sage/combinat/posets/incidence_algebras.py,sha256=qf1d495q2BJItNf0Ills8IAlv_GlZeqb53MR_dsEX1k,25058
|
81
|
+
sage/combinat/posets/linear_extension_iterator.cpython-312-darwin.so,sha256=4hQWHu6x8cpuTPyM_JOjizo22AHlPrMnKRahsCJagL8,148480
|
82
82
|
sage/combinat/posets/linear_extension_iterator.pyx,sha256=1DVxfIsMvtsPGjOi3SUjWtVKFKXQfnk_UXKtmsTpQl4,9272
|
83
83
|
sage/combinat/posets/elements.py,sha256=xKAD36BOIBtKi3AJ-ITCQMnjjrnjSSBfDPokdIdz2y8,7961
|
84
84
|
sage/combinat/posets/mobile.py,sha256=1Fzspx-afq66PO_5BTJoprp4GemROCPnZOacqZiJXI4,10558
|
85
|
-
sage/combinat/posets/linear_extensions.py,sha256=
|
85
|
+
sage/combinat/posets/linear_extensions.py,sha256=hpABWmpo5kXMxKUY3A2R4JmrtyiYONe3M3oaS_VA2qM,41598
|
86
86
|
sage/combinat/posets/all.py,sha256=A-S_eIm6Io7aE5YjG_ETS9Fsam30I8xOIR56QG8hpMs,1438
|
87
87
|
sage/combinat/posets/hasse_diagram.py,sha256=Z87fc4ssKwWWxD2Mjvf5L0xZDyG8fheArbNQrelJTM4,133265
|
88
88
|
sage/combinat/posets/hasse_cython.pyx,sha256=xGUFu90go4BA_LwmXkbbRT5wnb5WB71jmwU1JnW4fj4,5989
|
89
|
-
sage/combinat/posets/cartesian_product.py,sha256=
|
90
|
-
sage/combinat/posets/forest.py,sha256=
|
91
|
-
sage/combinat/posets/d_complete.py,sha256=
|
89
|
+
sage/combinat/posets/cartesian_product.py,sha256=_ZyRnB3-t3vQpaHjlXO-a_GHvCyQzxzH5FtLXIKbt88,16945
|
90
|
+
sage/combinat/posets/forest.py,sha256=c-3aHa_yyTN2Zo7ddPv4GIxDCG3ebs7hmf3r99FG3kU,1017
|
91
|
+
sage/combinat/posets/d_complete.py,sha256=ZkqWd-FTQMFppkXv8si4Ku4ZWmwydVeWWazv17JI1H0,6621
|
92
92
|
sage/ext_data/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
|
93
93
|
sage/ext_data/kenzo/S4.txt,sha256=iSXavQqy7ep6HFOWnnsHtqoDhL4Hu3s1SpsaUKbizWs,272
|
94
94
|
sage/ext_data/kenzo/CP4.txt,sha256=WXb63Qce3f9Z3Q6K3_zkI0W4-cHBM93XMn7K5bNQD3U,640878
|
@@ -96,72 +96,72 @@ sage/ext_data/kenzo/CP2.txt,sha256=DYHV8ETaavPvch7t5KdEuGhEqoOAozD7NVAzFGbR3ws,1
|
|
96
96
|
sage/ext_data/kenzo/CP3.txt,sha256=zyCb_0Lh5zAUrK_RJ-wFdCckivlMRyIEnN9xVg1sDsE,27973
|
97
97
|
sage/ext_data/kenzo/README.txt,sha256=SZywXyUDRE8JUt2_JajOYslQiEBSkkB5-14jtxPIt08,1912
|
98
98
|
sage/ext_data/graphs/graph_plot_js.html,sha256=OmGUTusnlNQgxC3rb2q_1FR8flYvLT6DNfY0zjY_0_0,9811
|
99
|
-
sage/sandpiles/sandpile.py,sha256=
|
99
|
+
sage/sandpiles/sandpile.py,sha256=yeO4-dNtmYd5LQV86K5XyMkxYVK3w_rnvBudZNTzTpg,211694
|
100
100
|
sage/sandpiles/all.py,sha256=GxDiTE98htXEil5sR7gdVNgIh8eCu6q1IyxjHPOLyx8,565
|
101
101
|
sage/sandpiles/examples.py,sha256=NNlBeEP0Nd7G4FNDNbsGRH51a1vOX-Pxo2aUjY1cUao,5595
|
102
102
|
sage/groups/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
|
103
103
|
sage/groups/perm_gps/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
|
104
104
|
sage/groups/perm_gps/partn_ref/refinement_graphs.pyx,sha256=AyuBZ0MJ0x9EIiVzInK__7W4dy_hCONOBHyP4qy721M,56634
|
105
105
|
sage/groups/perm_gps/partn_ref/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
|
106
|
-
sage/groups/perm_gps/partn_ref/refinement_graphs.cpython-312-darwin.so,sha256=
|
106
|
+
sage/groups/perm_gps/partn_ref/refinement_graphs.cpython-312-darwin.so,sha256=i1DKtL8raS6qdYzJLxzyI083X7BLQUVEzgnjeVvmwto,359952
|
107
107
|
sage/groups/perm_gps/partn_ref/refinement_graphs.pxd,sha256=6sU1BVnxoySV9GhDXZsUKBlAgAMBqc8Bp3FELHB3neU,1759
|
108
108
|
sage/graphs/graph_editor.py,sha256=_6wr59GPJfl0lylU_tMsqQbc1jH8E8GD6ZxQdVBxBYQ,2850
|
109
|
-
sage/graphs/genus.cpython-312-darwin.so,sha256=
|
110
|
-
sage/graphs/graph_generators_pyx.cpython-312-darwin.so,sha256=
|
109
|
+
sage/graphs/genus.cpython-312-darwin.so,sha256=H-9mqOpxgfigdKLgDSkRY6iFY0qYsIS37oTJ54WY-P0,147328
|
110
|
+
sage/graphs/graph_generators_pyx.cpython-312-darwin.so,sha256=30EpEd_-nYkJ0jxeDXWzfZiK0VBPJMAiRdH0TealRak,98232
|
111
111
|
sage/graphs/digraph_generators.py,sha256=QcVOE4jpqe8QxbEk79fFr33Mc0zZuIjJadkKTJG_-Bc,75899
|
112
112
|
sage/graphs/asteroidal_triples.pyx,sha256=8y4J9SN8HNXQIBRQjXPAmeSfkqJ1KaHmOe-NV5_3dpI,10431
|
113
113
|
sage/graphs/schnyder.py,sha256=OdTuBwHll5p50etHaa6cU_NvEKh7BOS7ILVZcBUZjCc,30683
|
114
114
|
sage/graphs/graph_latex.py,sha256=58UNam13b4n9QVvdrMWGniZMrs-QnVXbmdpMPnA-Afg,99128
|
115
115
|
sage/graphs/independent_sets.pxd,sha256=ozW1INPrNhfTHx9P0yQBW9m4C0VyNILAr2MixvI-Ao8,322
|
116
|
-
sage/graphs/comparability.cpython-312-darwin.so,sha256=
|
116
|
+
sage/graphs/comparability.cpython-312-darwin.so,sha256=psVZGFgoiiH5EhIAF-dQBWfAT5w6XfNFvPgts5VsbzU,240912
|
117
117
|
sage/graphs/matching_covered_graph.py,sha256=B_-x9cutL3AIMGaKIayFyMyIUIB6JjZSDY3fy9OB-kc,143004
|
118
118
|
sage/graphs/trees.pxd,sha256=wyQiHIkw7Zf3CCJqf1hLxJsCHOg_4D2R8cDcTGPHe3E,377
|
119
|
-
sage/graphs/views.cpython-312-darwin.so,sha256=
|
120
|
-
sage/graphs/hyperbolicity.cpython-312-darwin.so,sha256=
|
119
|
+
sage/graphs/views.cpython-312-darwin.so,sha256=jjk5mjIHYdkmNFIEbSN-5AA8HZRH0lzSgJAwU-SQU3s,208800
|
120
|
+
sage/graphs/hyperbolicity.cpython-312-darwin.so,sha256=VQNSU4kLow5D75HaX6j3gjNMUjUU9qUNlKSo1BOZZa0,315760
|
121
121
|
sage/graphs/traversals.pxd,sha256=B17xUmzx5ar22san3Zcz6iX2borzlmLYHQWBzJ8cuXY,481
|
122
|
-
sage/graphs/trees.cpython-312-darwin.so,sha256=
|
122
|
+
sage/graphs/trees.cpython-312-darwin.so,sha256=NVEGynp9w1eqL0kx0Pd91o2FINTetT5RvBpardow_4Q,120688
|
123
123
|
sage/graphs/edge_connectivity.pyx,sha256=SBrTBJaeM8uLsF6d-_5frdbPtWanWvJSxiEO7k7H0b4,44701
|
124
|
-
sage/graphs/connectivity.cpython-312-darwin.so,sha256=
|
125
|
-
sage/graphs/convexity_properties.cpython-312-darwin.so,sha256=
|
124
|
+
sage/graphs/connectivity.cpython-312-darwin.so,sha256=iEo-mQv_3nmqZINnY8AXlAe47L4hYPsNfsgYUa8pDms,871616
|
125
|
+
sage/graphs/convexity_properties.cpython-312-darwin.so,sha256=E3cZHJFiYXs5lWNQU8h89AScMW8DAEWD_wymewsXb28,213312
|
126
126
|
sage/graphs/generic_graph_pyx.pyx,sha256=T1QiJGKc1tcKSrMEFJM6-cTLko5ffC0kw2GH3Ml2qOs,58405
|
127
|
-
sage/graphs/graph_coloring.cpython-312-darwin.so,sha256=
|
127
|
+
sage/graphs/graph_coloring.cpython-312-darwin.so,sha256=3IgpfBCQicVBq1DJNEAnUQzO0FZkaeg2usKpG00AVrs,788376
|
128
128
|
sage/graphs/line_graph.pyx,sha256=fg92Q-gxnzRMjPmID7IztliBYP7n8JL0HhpK0CTCLio,22272
|
129
129
|
sage/graphs/hyperbolicity.pyx,sha256=Xij4iR3b0gQ0095UklppcWc3uZfEeh3GlcjrYlN0jVM,64417
|
130
|
-
sage/graphs/independent_sets.cpython-312-darwin.so,sha256=
|
130
|
+
sage/graphs/independent_sets.cpython-312-darwin.so,sha256=bwcJ3Yf-ngh0Y1NLdC56tUGNrn7tycPzc77E-lB8WTs,148320
|
131
131
|
sage/graphs/graph.py,sha256=C078UpvczPdjrh9nqFr_uvruwXW7JyF9_fkRsRqkJNc,369909
|
132
132
|
sage/graphs/convexity_properties.pyx,sha256=G5bhKH3lho-CMMNrIMTx3OjC0fN_8GekR_VwqGBynBk,29524
|
133
133
|
sage/graphs/distances_all_pairs.pxd,sha256=RMrpaxs-r98iY6BnCS2H18BFN85BNrYPk9Dipuvva0s,565
|
134
|
-
sage/graphs/path_enumeration.cpython-312-darwin.so,sha256=
|
134
|
+
sage/graphs/path_enumeration.cpython-312-darwin.so,sha256=KW7Di9Mw40GxVQ0X9zFBwH4rXG5IqCUZJUKBwS-EyHI,479952
|
135
135
|
sage/graphs/graph_coloring.pyx,sha256=XLq6kega_G2tzkc06urWj5JarMp_64CvpMlF3ylZhJg,85592
|
136
136
|
sage/graphs/graph_input.py,sha256=r0n78xXCSG6awA0rZDfBPfFsPh4lpvnEBxCkE0WP5A4,28844
|
137
137
|
sage/graphs/isgci.py,sha256=6nOGMGYeD95W_IGzRznhkCMl4Ceh2sOsLlZ6QFFDYFU,34105
|
138
138
|
sage/graphs/graph_generators_pyx.pyx,sha256=1E81srDiCWxRmesm86ne47frn2UJ04Kp5AaFI7kW-j4,3092
|
139
139
|
sage/graphs/all.py,sha256=x8SE1AFbrSgF8NtYDKAPR4Qj1rcawY5NCRN3zdNx76U,1500
|
140
|
-
sage/graphs/line_graph.cpython-312-darwin.so,sha256=
|
140
|
+
sage/graphs/line_graph.cpython-312-darwin.so,sha256=DzV7hhORu2DM1dRewTFJVdn3motny64CxHPD_cZKIuo,222784
|
141
141
|
sage/graphs/views.pyx,sha256=7OJX4dq4dwa5RQalTV8-NJWdurTIXOxL2_Tvr9yFn30,27971
|
142
|
-
sage/graphs/centrality.cpython-312-darwin.so,sha256=
|
142
|
+
sage/graphs/centrality.cpython-312-darwin.so,sha256=1havExQDAVPxOUy75_fXxRhVRjwom8_A9AZbJKhnp2I,229056
|
143
143
|
sage/graphs/hypergraph_generators.py,sha256=0gFR6duplhJ9m6Ecn-APwNIuooR5vcBoQkBdj_hJcSA,13926
|
144
144
|
sage/graphs/connectivity.pyx,sha256=Ttl1tzPlXRHmHuoFKcWOmR_YcDvKanDDcoPCqEIAsAQ,183216
|
145
145
|
sage/graphs/matching.py,sha256=rLuE4t6nErNdDnx7vnMBK8YhZhmrT4N6o75KfKo9Ry0,62208
|
146
146
|
sage/graphs/connectivity.pxd,sha256=xbB3JNVdxZDUwuhSrPaioJujxcOOUzCM4nUZ0Cmild0,5378
|
147
147
|
sage/graphs/bipartite_graph.py,sha256=L0-eIF8q2JZbkKqOHEafxsbJirxrKVB5N0Gsh5CpVkQ,104781
|
148
148
|
sage/graphs/graph_plot_js.py,sha256=jhaO_KUhxeOCw1IsZGPeCobW5nfXXEcJqIHEWV9rt0U,12898
|
149
|
-
sage/graphs/strongly_regular_db.cpython-312-darwin.so,sha256=
|
150
|
-
sage/graphs/distances_all_pairs.cpython-312-darwin.so,sha256=
|
149
|
+
sage/graphs/strongly_regular_db.cpython-312-darwin.so,sha256=bTuqcYRpWD0IhZdsu841nAycoYSpYj17MPnJQ6_68NU,1097936
|
150
|
+
sage/graphs/distances_all_pairs.cpython-312-darwin.so,sha256=lEkSIikZLMXF2Oc5STzjoE9ieTjbycmv-aiUxLKFevk,343168
|
151
151
|
sage/graphs/domination.py,sha256=BRTVApP6SeB-NVe3rcuJDfpSbg6jWRc4rWgTPgMUsVo,48674
|
152
152
|
sage/graphs/convexity_properties.pxd,sha256=5NS5R5LyBnwfiKEo6CNG-aspmA0HqkC0fvsmmr799xo,627
|
153
|
-
sage/graphs/traversals.cpython-312-darwin.so,sha256=
|
153
|
+
sage/graphs/traversals.cpython-312-darwin.so,sha256=4irkEbaqsKTCRnPXgHHrjjOllZB-VesKQ-1xwHNgNso,351344
|
154
154
|
sage/graphs/distances_all_pairs.pyx,sha256=CEbGv42frddFNp3xGOyC2M4Tnh2M8vLRuNMSYk3oyS4,105359
|
155
|
-
sage/graphs/spanning_tree.cpython-312-darwin.so,sha256=
|
155
|
+
sage/graphs/spanning_tree.cpython-312-darwin.so,sha256=DSxognmAj5B7A4SVN2I75jLPjQnBHP_ZOWvJrzLOEcQ,377968
|
156
156
|
sage/graphs/generic_graph_pyx.pxd,sha256=aVwQbA8BGVHbwufAo6-EHEhyfCFNxRq7pPI_FtOJu3Y,825
|
157
157
|
sage/graphs/lovasz_theta.py,sha256=mEZIrYcmhJHNolsSfRVUnXl9FBkDdqbQ1Frg8qmqJjo,2151
|
158
|
-
sage/graphs/generic_graph_pyx.cpython-312-darwin.so,sha256=
|
158
|
+
sage/graphs/generic_graph_pyx.cpython-312-darwin.so,sha256=1jfssBjUIQzKCMfleFd6NJGR_IWZJkSYzxekt9NCj4I,347792
|
159
159
|
sage/graphs/tutte_polynomial.py,sha256=Wcid9JQ5dJFZITAzmJ18YnOskNPxCbzXvBDvgjNE-pA,21811
|
160
160
|
sage/graphs/pq_trees.py,sha256=6z6pzjeApBLvjx4FTqxklFHjEcwoF9Z78LlvTpcv0G0,39418
|
161
161
|
sage/graphs/partial_cube.py,sha256=u4X-fZgUIcaX9QSIv_N8kbVUYRx3dH51LCmEfc2nYkg,16402
|
162
|
-
sage/graphs/weakly_chordal.cpython-312-darwin.so,sha256=
|
162
|
+
sage/graphs/weakly_chordal.cpython-312-darwin.so,sha256=3EufTeqelh7O9ArPDBMc_TXCdZxHuF9N4fIEkRSCAWM,186208
|
163
163
|
sage/graphs/graph_plot.py,sha256=EfcwzdjrtsUuEXoyWb6j1CbkJt170ASzCmgkJiFuMfI,70278
|
164
|
-
sage/graphs/graph_list.py,sha256=
|
164
|
+
sage/graphs/graph_list.py,sha256=XW3g5tAW_zmdMpmEUgXniTeu3GG2i7e-_NgStIRGWdU,12712
|
165
165
|
sage/graphs/print_graphs.py,sha256=pBg_hHJxWAcsEzqbqDG4ehZg8C1LreySAbqcoHBmE_A,4931
|
166
166
|
sage/graphs/digraph.py,sha256=uryks9iuR5KU_XpPV2dk2GHMud2djfX5wbcQKm-dkec,180720
|
167
167
|
sage/graphs/dot2tex_utils.py,sha256=nCUHldadHC4Jvdx3sOWypkwlRH7Lc3x_xCuJOk_o4jA,3165
|
@@ -174,32 +174,32 @@ sage/graphs/trees.pyx,sha256=fxCGm1lmkjsaLSg4L0IbnA_gMzYIWhPwbU07_C8e5UA,8733
|
|
174
174
|
sage/graphs/centrality.pyx,sha256=mJIHu3It0FzZsJ9vhNi5h1sr2_7SHFdPtXmUx6-c-R0,34973
|
175
175
|
sage/graphs/spanning_tree.pyx,sha256=WbPx-yeaNy_UQOOL6UqdHrYvJPhv3J-1t7rWgCo_Rks,55241
|
176
176
|
sage/graphs/strongly_regular_db.pyx,sha256=FFxau4Zr8YjZp7wboDqJmCWcNOEHwxfizCnOrzicisU,132851
|
177
|
-
sage/graphs/asteroidal_triples.cpython-312-darwin.so,sha256=
|
177
|
+
sage/graphs/asteroidal_triples.cpython-312-darwin.so,sha256=VdxrF6TpowHod8C22e4JkOsrsS9qcKJUIYl7usVu0no,125568
|
178
178
|
sage/graphs/independent_sets.pyx,sha256=AA4D-pjoMyguifXSDRCZJmwZqfTMIv6tVpxXiDo83vs,13082
|
179
179
|
sage/graphs/cographs.py,sha256=LTajbKp8uk-4NPdnuEUyd181qDXgA4Qb73r7_RNrx8c,15187
|
180
180
|
sage/graphs/graph_generators.py,sha256=TXNwxiDlyj8bBjkhA_bKhZljkk2k1pC736YYMyla3EA,133965
|
181
181
|
sage/graphs/genus.pyx,sha256=xlF94KFiTgiaagZmTJu-49-y--qhUUclo9BVbQwEn8s,21694
|
182
182
|
sage/graphs/generic_graph.py,sha256=AVIWhd10PwauaDHO4Ddv-xW9dZbi1PIhI3dCv8vVRr8,1094325
|
183
|
-
sage/graphs/isoperimetric_inequalities.cpython-312-darwin.so,sha256=
|
183
|
+
sage/graphs/isoperimetric_inequalities.cpython-312-darwin.so,sha256=0oWlPm4O_kwFAQ8yJQ-wUrKWHoE_GufGSLfZbvIa7_0,147680
|
184
184
|
sage/graphs/orientations.py,sha256=ZMTASPviyKb4t2swDdTajNeGfemG3vbVmU9IwRUmCzU,53818
|
185
185
|
sage/graphs/comparability.pyx,sha256=k6yGZH9qZbabyaIGPQBGY75Tmsl8EaT-_XyTgPtKPRI,30696
|
186
|
-
sage/graphs/edge_connectivity.cpython-312-darwin.so,sha256=
|
186
|
+
sage/graphs/edge_connectivity.cpython-312-darwin.so,sha256=hJ_q4Ts4X4eOoTuoEElCfeS2zzU1L4er1NgONyvpO7o,202992
|
187
187
|
sage/graphs/generators/degree_sequence.py,sha256=oN9BFV3aC3g0Im_L9v1bx4aBzEf2qFRc8IHpxMVLkF8,8735
|
188
188
|
sage/graphs/generators/distance_regular.pyx,sha256=qnYVaHCpc7L4m2Z1pXuEg98tyJ2ED73bNky5_Fk9ASI,96145
|
189
189
|
sage/graphs/generators/smallgraphs.py,sha256=Kwqzi6iXl36QRVJ8L9-YQcuRjIMlAVhJQpMDdXmwIBY,201988
|
190
190
|
sage/graphs/generators/families.py,sha256=Ex6zqwclb1OXLs7uzuLaBzrWmiephaD0nwKSR5jYxGY,164644
|
191
191
|
sage/graphs/generators/all.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
|
192
192
|
sage/graphs/generators/random.py,sha256=Hwnid8-_Hx9N8kA6i9Vpuqlw-l-5cemVqUjo7qSCpVw,92229
|
193
|
-
sage/graphs/generators/distance_regular.cpython-312-darwin.so,sha256=
|
193
|
+
sage/graphs/generators/distance_regular.cpython-312-darwin.so,sha256=YkiC0eLBgsHdUqUS3zL2Ff_k7wtuSsrKvGDyMsSTZv4,950408
|
194
194
|
sage/graphs/generators/chessboard.py,sha256=AYh9NIWZcueME7xiSL3MUdEa9O8O_NTDXh01cHfP8Js,20682
|
195
195
|
sage/graphs/generators/basic.py,sha256=aSkIJvPJ_eD5pG-2Uf5jh5qxEv8Tbe7o3vwDLiisSYc,61441
|
196
196
|
sage/graphs/generators/platonic_solids.py,sha256=v3TMsnK2gI0vnhX9IxP3IsTWqw6GpYQdk6xZk9WEJG0,10134
|
197
197
|
sage/graphs/generators/intersection.py,sha256=N3C3dLzBjL_Jeii1aU_Xm3O78yMLvZoAY1Y6Egu4MxA,20349
|
198
198
|
sage/graphs/generators/classical_geometries.py,sha256=3xoCUEGmShNiGwvc5eKvFbLgeQH-lWM23Iv2uYVtp5A,63415
|
199
199
|
sage/graphs/generators/world_map.py,sha256=YZ992gxxy6kXKaWvbXqG2tfxk5AaHw3a0t991pskPlY,34547
|
200
|
-
sage/graphs/graph_decompositions/bandwidth.cpython-312-darwin.so,sha256=
|
200
|
+
sage/graphs/graph_decompositions/bandwidth.cpython-312-darwin.so,sha256=zg-2W6zJE4vP9r90W2drH7THPuCnSGisNrZOCyJS59U,120976
|
201
201
|
sage/graphs/graph_decompositions/vertex_separation.pyx,sha256=nF-RwfUUZZ-JHi-iMj7D2ibAsrbmLQuEpGRXqN7_DTQ,74865
|
202
|
-
sage/graphs/graph_decompositions/modular_decomposition.cpython-312-darwin.so,sha256=
|
202
|
+
sage/graphs/graph_decompositions/modular_decomposition.cpython-312-darwin.so,sha256=eD93x7MgM4AFppGAusbGMCToDghv1SweIPRKN-CwbMI,561792
|
203
203
|
sage/graphs/graph_decompositions/fast_digraph.pyx,sha256=RwR3geuP8uwPxNlKfHJQHvPsf3_z6DvwQEWyUEf1Df8,7389
|
204
204
|
sage/graphs/graph_decompositions/cutwidth.pyx,sha256=ah8ysfGRlDw3UTeG9uPcQuVAjs0SfaYSnRdJ3z-RvdA,28601
|
205
205
|
sage/graphs/graph_decompositions/tree_decomposition.pxd,sha256=dxfbHIMapSvsj67OLVBfLtvAYhWvDNSwmbmqmrvEYZg,555
|
@@ -208,28 +208,28 @@ sage/graphs/graph_decompositions/all.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZw
|
|
208
208
|
sage/graphs/graph_decompositions/bandwidth.pyx,sha256=9BvA6v6LheIIqwtkvbendaO_aux-ROfaMBcAM4aZFd0,15576
|
209
209
|
sage/graphs/graph_decompositions/modular_decomposition.pyx,sha256=EkuXojAhXF53MXTiat63_EWdglqfodFZQiZk5dHV7-E,51818
|
210
210
|
sage/graphs/graph_decompositions/modular_decomposition.pxd,sha256=SAqgLApPT4pa_e2XpZ7us9PhDV34y5cTZB7YzP_lbkI,1100
|
211
|
-
sage/graphs/graph_decompositions/fast_digraph.cpython-312-darwin.so,sha256=
|
211
|
+
sage/graphs/graph_decompositions/fast_digraph.cpython-312-darwin.so,sha256=wwaMwl8twYe48Mh3iYBo9zuypDDHHCwzn-CCjpHXC40,102456
|
212
212
|
sage/graphs/graph_decompositions/graph_products.pyx,sha256=XcghL4BzFWPPNmpNIKSC37zzBwNMmmaNqnEAtXnP0hw,17139
|
213
213
|
sage/graphs/graph_decompositions/clique_separators.pyx,sha256=nZpjLIQYuRND2eu1jvvawGo19_WSFROk8I1NRhHzhCU,22876
|
214
214
|
sage/graphs/graph_decompositions/slice_decomposition.pxd,sha256=OawVDRv8wbwIP6rbSZHGZQUVF31TNw3fbIXbE2q9XyA,602
|
215
|
-
sage/graphs/graph_decompositions/clique_separators.cpython-312-darwin.so,sha256=
|
215
|
+
sage/graphs/graph_decompositions/clique_separators.cpython-312-darwin.so,sha256=2ckeEHTiqfDnAD3wt6w72OJPucBGgdGY23yQ1bBou9o,251824
|
216
216
|
sage/graphs/graph_decompositions/tree_decomposition.pyx,sha256=IWrChlzZXjEKscgZcbRr4mhvODbAuAbZoHhSNxx-3Dw,73665
|
217
|
-
sage/graphs/graph_decompositions/tree_decomposition.cpython-312-darwin.so,sha256=
|
218
|
-
sage/graphs/graph_decompositions/cutwidth.cpython-312-darwin.so,sha256=
|
219
|
-
sage/graphs/graph_decompositions/vertex_separation.cpython-312-darwin.so,sha256=
|
217
|
+
sage/graphs/graph_decompositions/tree_decomposition.cpython-312-darwin.so,sha256=hqTSNOr0EObqGuUYlDZWiZdoXENFKu2lUsov2v9c3uU,580480
|
218
|
+
sage/graphs/graph_decompositions/cutwidth.cpython-312-darwin.so,sha256=2_eLudhe2fJakUhVeW2sJr5MYtB16LKoq0T6try8xgA,210024
|
219
|
+
sage/graphs/graph_decompositions/vertex_separation.cpython-312-darwin.so,sha256=Na-ed7uyL9OhwJ594km3WY3kJtl7FDwSALfpDR9jAFE,364048
|
220
220
|
sage/graphs/graph_decompositions/fast_digraph.pxd,sha256=vfxjVz_M8l9rkauaJpXkW1_ubTM3mqUdEjUwlqdD4PQ,343
|
221
221
|
sage/graphs/graph_decompositions/vertex_separation.pxd,sha256=kuVp6HcFIRCamGKOy_Z_Qlzb2W_GlrdBRL4b44jdLsw,200
|
222
|
-
sage/graphs/graph_decompositions/slice_decomposition.cpython-312-darwin.so,sha256=
|
223
|
-
sage/graphs/graph_decompositions/graph_products.cpython-312-darwin.so,sha256=
|
224
|
-
sage/graphs/base/static_dense_graph.cpython-312-darwin.so,sha256=
|
222
|
+
sage/graphs/graph_decompositions/slice_decomposition.cpython-312-darwin.so,sha256=jBw0PQC6t0PF6GsSi0mz-kVeC_a3ph6qSQ4xNG1uSFA,302128
|
223
|
+
sage/graphs/graph_decompositions/graph_products.cpython-312-darwin.so,sha256=5-5NSFTJBsWclLTyLvWK2t5BIbRTFGVoSFVj43S28xA,209344
|
224
|
+
sage/graphs/base/static_dense_graph.cpython-312-darwin.so,sha256=_Ir22_Dt1hnN6BLT5RoLj3riRXFALfrUY2SxOqDgwNo,286544
|
225
225
|
sage/graphs/base/static_sparse_graph.pyx,sha256=bnMe1AinoGjIsIlsJGeCCRuihiDtZkGQmG4kh41hvqM,49908
|
226
|
-
sage/graphs/base/c_graph.cpython-312-darwin.so,sha256=
|
226
|
+
sage/graphs/base/c_graph.cpython-312-darwin.so,sha256=lp5hur1-wB9vYFHp_23Rxlinw_0tk9xeVMRPLm2crH4,686912
|
227
227
|
sage/graphs/base/boost_graph.pxd,sha256=K3GCaIXjsmhwgTzlSntrHi3IB1t2vJpOzSS7FQGlxEo,3655
|
228
|
-
sage/graphs/base/sparse_graph.cpython-312-darwin.so,sha256=
|
228
|
+
sage/graphs/base/sparse_graph.cpython-312-darwin.so,sha256=mPY-MufmkGftliQIZ94MwUu3dIAhHRLxHYx9n_wRWps,251872
|
229
229
|
sage/graphs/base/c_graph.pyx,sha256=Lr1cxK2A5mtR0EIQmYIljc2OgYgiBeRn5Rw0mC_k0x8,179656
|
230
|
-
sage/graphs/base/static_sparse_graph.cpython-312-darwin.so,sha256=
|
230
|
+
sage/graphs/base/static_sparse_graph.cpython-312-darwin.so,sha256=E7Z3RlWCMvkVoyVR8hRKlMYh2apou7I_Hn_w2kmQ12M,236560
|
231
231
|
sage/graphs/base/static_sparse_backend.pyx,sha256=Gu5fS7Jq-p2jfNuU-QwV60YsUtyc2jVlZ9h9hWCM9eE,55323
|
232
|
-
sage/graphs/base/boost_graph.cpython-312-darwin.so,sha256=
|
232
|
+
sage/graphs/base/boost_graph.cpython-312-darwin.so,sha256=SiC2chLXcvWaOqYhWqQc7tZ4YH9OApcdUULf7u4Apho,965528
|
233
233
|
sage/graphs/base/sparse_graph.pxd,sha256=O0oPH_Z1-fsxPK-mKMnNq-OL5cE0GcDILqDj-ajytlk,3485
|
234
234
|
sage/graphs/base/dense_graph.pyx,sha256=HfZU7L2IScsA8_a6VCcs8rM6aWRkYTSz8oRhJWHX5mY,24167
|
235
235
|
sage/graphs/base/graph_backends.pxd,sha256=DNjOnDRc2RPV-NtCHuoliKpNfJHC3aK7l0RifUR7DSY,150
|
@@ -241,12 +241,12 @@ sage/graphs/base/dense_graph.pxd,sha256=VltYtRdTHhfpXG11C-lfMPSlm57dyP4Ot3E3FOzl
|
|
241
241
|
sage/graphs/base/graph_backends.pyx,sha256=vl_Cs6xcJJSDlHEfSO55bUQMSziLY3WYnsOza3oK13o,24526
|
242
242
|
sage/graphs/base/static_sparse_backend.pxd,sha256=DbBBsONS0Utp1szKGQaeTpoqiNC23XDaL9tnMrDAxvI,903
|
243
243
|
sage/graphs/base/sparse_graph.pyx,sha256=dNMlc3m2Vl7fXCz5c7a-rse4boVsMSl3AevHmF0AIo0,56300
|
244
|
-
sage/graphs/base/static_sparse_backend.cpython-312-darwin.so,sha256=
|
245
|
-
sage/graphs/base/dense_graph.cpython-312-darwin.so,sha256=
|
244
|
+
sage/graphs/base/static_sparse_backend.cpython-312-darwin.so,sha256=3Y6TVDO7kOxtkEsc30ZvIb6mCnIu9u7UNVse2fZkJCQ,334256
|
245
|
+
sage/graphs/base/dense_graph.cpython-312-darwin.so,sha256=wewfkactRRBqhFp3PC9ArXW3evwlbAOP-axTncljoyM,190608
|
246
246
|
sage/graphs/base/c_graph.pxd,sha256=pUsZ48m4XXx4fq8fRWeeaFkM0gzX0r63Kkw7L0IJdfk,4281
|
247
247
|
sage/graphs/base/boost_graph.pyx,sha256=mWfPc01Gtyy3YDQ93CcOWZMhsUXN5q2BiyKt4wls-c8,111074
|
248
248
|
sage/graphs/base/static_sparse_graph.pxd,sha256=YYCH7F6h1OteiFLfleAb57CCN-gx42n3W_9fzh8avkA,1500
|
249
|
-
sage/graphs/base/graph_backends.cpython-312-darwin.so,sha256=
|
249
|
+
sage/graphs/base/graph_backends.cpython-312-darwin.so,sha256=6Rzj88vSbjWva-bcOXvizCeW8D-LqarS39zzKfAqfRI,165536
|
250
250
|
sage/knots/link.py,sha256=L6vA6oqMri3ZD5xY8zclLwuqywrzoWbfpVTskcyBtkk,177868
|
251
251
|
sage/knots/free_knotinfo_monoid.py,sha256=IyaKmc4kQclQoAe9loqp9Cq2Ny7BoQXwjPFn_QYwMoY,19713
|
252
252
|
sage/knots/knotinfo.py,sha256=ACmrGn9_t6Ff3y5xaTDLO8JJS0_Wkfb2qItWf6Nu9mI,101893
|
sage/all__sagemath_graphs.py
CHANGED
@@ -11,6 +11,11 @@ This distribution makes the following feature available::
|
|
11
11
|
|
12
12
|
from .all__sagemath_categories import *
|
13
13
|
|
14
|
+
try: # extra
|
15
|
+
from sage.all__sagemath_gap import *
|
16
|
+
except ImportError:
|
17
|
+
pass
|
18
|
+
|
14
19
|
try: # extra
|
15
20
|
from sage.all__sagemath_modules import *
|
16
21
|
except ImportError:
|
sage/combinat/abstract_tree.py
CHANGED
@@ -1,6 +1,6 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
Abstract
|
3
|
+
Abstract recursive trees
|
4
4
|
|
5
5
|
The purpose of this class is to help implement trees with a specific structure
|
6
6
|
on the children of each node. For instance, one could want to define a tree in
|
sage/combinat/binary_tree.py
CHANGED
@@ -2,7 +2,7 @@
|
|
2
2
|
r"""
|
3
3
|
Cluster algebras and quivers
|
4
4
|
|
5
|
-
|
5
|
+
A compendium on the cluster algebra and quiver package in Sage [MS2011]_
|
6
6
|
|
7
7
|
- :ref:`sage.combinat.cluster_algebra_quiver.quiver_mutation_type`
|
8
8
|
- :ref:`sage.combinat.cluster_algebra_quiver.quiver`
|
@@ -1,28 +1,34 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.graphs sage.modules sage.libs.singular
|
3
3
|
r"""
|
4
|
-
|
4
|
+
Cluster seeds
|
5
5
|
|
6
|
-
A *cluster seed* is a pair `(B,\mathbf{x})` with `B` being a
|
7
|
-
and with `\mathbf{x}` being an
|
6
|
+
A *cluster seed* is a pair `(B,\mathbf{x})` with `B` being a
|
7
|
+
*skew-symmetrizable* `(n+m) \times n` *-matrix* and with `\mathbf{x}` being an
|
8
|
+
`n`-tuple of *independent elements* in the field of rational functions in `n`
|
9
|
+
variables.
|
8
10
|
|
9
11
|
For the compendium on the cluster algebra and quiver package see
|
10
12
|
[MS2011]_.
|
11
13
|
|
12
|
-
AUTHORS:
|
13
|
-
|
14
|
-
- Gregg Musiker: Initial Version
|
15
|
-
- Christian Stump: Initial Version
|
16
|
-
- Aram Dermenjian (2015-07-01): Updating ability to not rely solely on clusters
|
17
|
-
- Jesse Levitt (2015-07-01): Updating ability to not rely solely on clusters
|
18
|
-
|
19
14
|
REFERENCES:
|
20
15
|
|
21
16
|
- [FZ2007]_
|
22
|
-
|
23
17
|
- [BDP2013]_
|
24
18
|
|
25
|
-
.. SEEALSO::
|
19
|
+
.. SEEALSO::
|
20
|
+
|
21
|
+
For mutation types of cluster seeds, see
|
22
|
+
:meth:`sage.combinat.cluster_algebra_quiver.quiver_mutation_type.QuiverMutationType`.
|
23
|
+
Cluster seeds are closely related to
|
24
|
+
:meth:`sage.combinat.cluster_algebra_quiver.quiver.ClusterQuiver`.
|
25
|
+
|
26
|
+
AUTHORS:
|
27
|
+
|
28
|
+
- Gregg Musiker: initial version
|
29
|
+
- Christian Stump: initial version
|
30
|
+
- Aram Dermenjian (2015-07-01): updating ability to not rely solely on clusters
|
31
|
+
- Jesse Levitt (2015-07-01): updating ability to not rely solely on clusters
|
26
32
|
"""
|
27
33
|
|
28
34
|
# ****************************************************************************
|
@@ -1,11 +1,11 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
|
4
|
-
Squares (MOLS) of a given size.
|
3
|
+
Bounds on the number of mutually orthogonal Latin squares
|
5
4
|
|
6
|
-
This module
|
7
|
-
|
8
|
-
|
5
|
+
This module contains known lower bounds on the number of mutually orthogonal
|
6
|
+
Latin squares (MOLS) of a given size, and consists (almost) entirely of an
|
7
|
+
internal, constant tuple of Python integers corresponding to Table 3.87 in the
|
8
|
+
Handbook of Combinatorial Designs, 2nd edition, by Colbourn and Dinitz. One public
|
9
9
|
function, :func:`lower_bound`, is provided to access it.
|
10
10
|
|
11
11
|
Make sure we have all of the entries::
|
sage/combinat/designs/bibd.py
CHANGED
@@ -1,6 +1,6 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
Balanced
|
3
|
+
Balanced incomplete block designs (BIBD)
|
4
4
|
|
5
5
|
This module gathers everything related to Balanced Incomplete Block Designs. One can build a
|
6
6
|
BIBD (or check that it can be built) with :func:`balanced_incomplete_block_design`::
|
@@ -1,13 +1,13 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
Covering
|
3
|
+
Covering arrays
|
4
4
|
|
5
|
-
A
|
5
|
+
A covering array, denoted `CA(N;t,k,v)`, is an `N` by `k` array with
|
6
6
|
entries from a set of `v` elements with the property that in every
|
7
7
|
selection of `t` columns, every sequence of `t` elements appears in at
|
8
8
|
least one row.
|
9
9
|
|
10
|
-
An
|
10
|
+
An orthogonal array, denoted `OA(N;t,k,v)` is a covering array with the
|
11
11
|
property that every sequence of `t`-elements appears in exactly one row.
|
12
12
|
(See :mod:`sage.combinat.designs.orthogonal_arrays`).
|
13
13
|
|
@@ -49,7 +49,6 @@ Classes and methods
|
|
49
49
|
from urllib.request import urlopen
|
50
50
|
from ssl import create_default_context as default_context
|
51
51
|
|
52
|
-
from sage.misc.sage_eval import sage_eval
|
53
52
|
from sage.structure.sage_object import SageObject
|
54
53
|
from sage.rings.rational import Rational
|
55
54
|
from sage.arith.misc import binomial
|
@@ -513,6 +512,8 @@ def best_known_covering_design_www(v, k, t, verbose=False):
|
|
513
512
|
A :exc:`ValueError` is raised if the ``(v, k, t)`` parameters are not
|
514
513
|
found in the database.
|
515
514
|
"""
|
515
|
+
from sage.misc.sage_eval import sage_eval
|
516
|
+
|
516
517
|
v = int(v)
|
517
518
|
k = int(k)
|
518
519
|
t = int(t)
|
Binary file
|
@@ -1,7 +1,7 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.rings.finite_rings
|
3
3
|
r"""
|
4
|
-
Difference
|
4
|
+
Difference matrices
|
5
5
|
|
6
6
|
This module gathers code related to difference matrices. One can build those
|
7
7
|
objects (or know if they can be built) with :func:`difference_matrix`::
|
Binary file
|
sage/combinat/designs/ext_rep.py
CHANGED
@@ -1,13 +1,13 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
External
|
3
|
+
External representations of block designs
|
4
4
|
|
5
|
-
|
5
|
+
This module is an API to the abstract tree represented by
|
6
6
|
an XML document containing the External Representation of a list of
|
7
7
|
block designs. The module also provides the related I/O operations for
|
8
|
-
reading/writing ext-rep files or data. The parsing is based on expat.
|
8
|
+
reading/writing ``ext-rep`` files or data. The parsing is based on expat.
|
9
9
|
|
10
|
-
This is a modified form of the module ext_rep.py (version 0.8)
|
10
|
+
This is a modified form of the module ``ext_rep.py`` (version 0.8)
|
11
11
|
written by Peter Dobcsanyi [Do2009]_ peter@designtheory.org.
|
12
12
|
|
13
13
|
.. TODO::
|
@@ -16,12 +16,9 @@ written by Peter Dobcsanyi [Do2009]_ peter@designtheory.org.
|
|
16
16
|
information about things like automorphism groups, transitivity, cycle type
|
17
17
|
representatives, etc, but none of this data is made available through the
|
18
18
|
current implementation.
|
19
|
-
|
20
|
-
Functions
|
21
|
-
---------
|
22
19
|
"""
|
23
20
|
|
24
|
-
|
21
|
+
# ***********************************************************************
|
25
22
|
# This software is released under the terms of the GNU General Public
|
26
23
|
# License, version 2 or above (your choice). For details on licensing,
|
27
24
|
# see the accompanying documentation.
|
@@ -29,9 +26,9 @@ Functions
|
|
29
26
|
# This is a modified form of the module ext_rep.py (version 0.8)
|
30
27
|
# written by Peter Dobcsanyi peter@designtheory.org.
|
31
28
|
#
|
32
|
-
# Copyright 2004
|
33
|
-
#
|
34
|
-
|
29
|
+
# Copyright 2004 Peter Dobcsanyi peter@designtheory.org
|
30
|
+
# 2009 Carlo Hamalainen carlo.hamalainen@gmail.com
|
31
|
+
# ***********************************************************************
|
35
32
|
|
36
33
|
import sys
|
37
34
|
import xml.parsers.expat
|
@@ -598,7 +595,6 @@ def _encode_attribute(string):
|
|
598
595
|
sage: _encode_attribute('E')
|
599
596
|
'E'
|
600
597
|
"""
|
601
|
-
|
602
598
|
if pattern_integer.match(string):
|
603
599
|
return int(string)
|
604
600
|
elif pattern_decimal.match(string):
|
@@ -611,8 +607,7 @@ class XTree:
|
|
611
607
|
'''
|
612
608
|
A lazy class to wrap a rooted tree representing an XML document.
|
613
609
|
The tree's nodes are tuples of the structure:
|
614
|
-
|
615
|
-
(name, {dictionary of attributes}, [list of children])
|
610
|
+
(name, {dictionary of attributes}, [list of children])
|
616
611
|
|
617
612
|
Methods and services of an XTree object ``t``:
|
618
613
|
|
Binary file
|
@@ -1,7 +1,7 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.rings.finite_rings
|
3
3
|
r"""
|
4
|
-
Group-
|
4
|
+
Group-divisible designs (GDD)
|
5
5
|
|
6
6
|
This module gathers everything related to Group-Divisible Designs. The
|
7
7
|
constructions defined here can be accessed through ``designs.<tab>``::
|
@@ -1,7 +1,7 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.modules
|
3
3
|
r"""
|
4
|
-
Mutually
|
4
|
+
Mutually orthogonal Latin squares (MOLS)
|
5
5
|
|
6
6
|
The main function of this module is :func:`mutually_orthogonal_latin_squares`
|
7
7
|
and can be can be used to generate MOLS (or check that they exist)::
|
Binary file
|
@@ -1,7 +1,7 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.rings.finite_rings
|
3
3
|
r"""
|
4
|
-
Resolvable
|
4
|
+
Resolvable balanced incomplete block design (RBIBD)
|
5
5
|
|
6
6
|
This module contains everything related to resolvable Balanced Incomplete Block
|
7
7
|
Designs. The constructions implemented here can be obtained through the
|
@@ -1,6 +1,6 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
Steiner
|
3
|
+
Steiner quadruple systems
|
4
4
|
|
5
5
|
A Steiner Quadruple System on `n` points is a family `SQS_n \subset \binom {[n]}
|
6
6
|
4` of `4`-sets, such that any set `S\subset [n]` of size three is a subset of
|
Binary file
|
@@ -1,9 +1,9 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.graphs sage.modules
|
3
3
|
r"""
|
4
|
-
Common
|
4
|
+
Common automata and transducers (finite state machines generators)
|
5
5
|
|
6
|
-
Automata and
|
6
|
+
Automata and transducers in Sage can be built through the
|
7
7
|
:class:`automata <AutomatonGenerators>`
|
8
8
|
and :class:`transducers <TransducerGenerators>` objects, respectively.
|
9
9
|
It contains generators for
|
sage/combinat/graph_path.py
CHANGED
@@ -1,8 +1,8 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
Paths in
|
3
|
+
Paths in directed acyclic graphs
|
4
4
|
"""
|
5
|
-
|
5
|
+
# ****************************************************************************
|
6
6
|
# Copyright (C) 2007 Mike Hansen <mhansen@gmail.com>,
|
7
7
|
#
|
8
8
|
# Distributed under the terms of the GNU General Public License (GPL)
|
@@ -15,7 +15,7 @@ Paths in Directed Acyclic Graphs
|
|
15
15
|
# The full text of the GPL is available at:
|
16
16
|
#
|
17
17
|
# http://www.gnu.org/licenses/
|
18
|
-
|
18
|
+
# ****************************************************************************
|
19
19
|
|
20
20
|
from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
|
21
21
|
from sage.structure.parent import Parent
|
sage/combinat/ordered_tree.py
CHANGED
sage/combinat/posets/forest.py
CHANGED
Binary file
|
@@ -1,7 +1,7 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.modules
|
3
3
|
r"""
|
4
|
-
Incidence
|
4
|
+
Incidence algebras
|
5
5
|
"""
|
6
6
|
# ****************************************************************************
|
7
7
|
# Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>
|
Binary file
|
@@ -1,16 +1,6 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
r"""
|
3
|
-
Linear
|
4
|
-
|
5
|
-
This module defines two classes:
|
6
|
-
|
7
|
-
- :class:`LinearExtensionOfPoset`
|
8
|
-
- :class:`LinearExtensionsOfPoset`
|
9
|
-
- :class:`LinearExtensionsOfPosetWithHooks`
|
10
|
-
- :class:`LinearExtensionsOfForest`
|
11
|
-
|
12
|
-
Classes and methods
|
13
|
-
-------------------
|
3
|
+
Linear extensions of posets
|
14
4
|
"""
|
15
5
|
# ****************************************************************************
|
16
6
|
# Copyright (C) 2012 Anne Schilling <anne at math.ucdavis.edu>
|
@@ -1,7 +1,7 @@
|
|
1
1
|
# sage_setup: distribution = sagemath-graphs
|
2
2
|
# sage.doctest: needs sage.modules
|
3
3
|
r"""
|
4
|
-
Möbius
|
4
|
+
Möbius algebras
|
5
5
|
"""
|
6
6
|
# ****************************************************************************
|
7
7
|
# Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>,
|
sage/combinat/rooted_tree.py
CHANGED
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
sage/graphs/graph_list.py
CHANGED
@@ -19,9 +19,6 @@ AUTHORS:
|
|
19
19
|
# ****************************************************************************
|
20
20
|
|
21
21
|
|
22
|
-
from sage.misc.misc import try_read
|
23
|
-
|
24
|
-
|
25
22
|
def from_whatever(data):
|
26
23
|
r"""
|
27
24
|
Return a list of Sage Graphs, given a list of whatever kind of data.
|
@@ -78,6 +75,8 @@ def _from_whatever(data, fmt=None):
|
|
78
75
|
if isinstance(data, str):
|
79
76
|
lines = data.splitlines()
|
80
77
|
else:
|
78
|
+
from sage.misc.misc import try_read
|
79
|
+
|
81
80
|
lines = try_read(data, splitlines=True)
|
82
81
|
|
83
82
|
if lines is not None and fmt is None:
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
Binary file
|
sage/sandpiles/sandpile.py
CHANGED
@@ -339,7 +339,6 @@ from sage.graphs.digraph import DiGraph
|
|
339
339
|
from sage.graphs.graph import Graph
|
340
340
|
from sage.misc.functional import det, denominator
|
341
341
|
from sage.misc.lazy_import import lazy_import
|
342
|
-
from sage.misc.misc import exists
|
343
342
|
from sage.misc.misc_c import prod
|
344
343
|
from sage.misc.temporary_file import tmp_filename
|
345
344
|
from sage.rings.integer import Integer
|
@@ -1542,7 +1541,7 @@ class Sandpile(DiGraph):
|
|
1542
1541
|
else:
|
1543
1542
|
rec = list(self.recurrents())
|
1544
1543
|
for r in self.recurrents():
|
1545
|
-
if
|
1544
|
+
if any(r > x for x in rec):
|
1546
1545
|
rec.remove(r)
|
1547
1546
|
self._min_recurrents = rec
|
1548
1547
|
|
File without changes
|