passagemath-graphs 10.5.47__cp311-cp311-macosx_14_0_arm64.whl → 10.6.1__cp311-cp311-macosx_14_0_arm64.whl

passagemath_graphs-10.6.1.dist-info/RECORD

@@ -0,0 +1,263 @@
+passagemath_graphs.dylibs/libgmp.10.dylib,sha256=9Zh0g_D30IVg20eXzyK6Q7tW_EozvBqH314SGDdKZRk,464688
+sage_wheels/share/graphs/brouwer_srg_database.json,sha256=eou0RyEcYHJIGx6xxeozEWkdbw-3JpCdY8XJ2AMtQ8M,209408
+sage_wheels/share/graphs/isgci_sage.xml,sha256=ZTmQvqVup945tVS2aAzB2snYNGfiiWllxUd8kMVmfFA,2096522
+sage_wheels/share/graphs/graphs.db,sha256=1OmkX02dccRyHp5NOt_VNnpIj25RR3-O7DOY4GJN0zM,1258496
+sage_wheels/share/graphs/smallgraphs.txt,sha256=0PV9PSz8hlzl1ZmYqBXBpMtewuTWt1u_w8tXdbKiBEg,9222
+passagemath_graphs-10.6.1.dist-info/RECORD,,
+passagemath_graphs-10.6.1.dist-info/METADATA.bak,sha256=9SuDxV9ApQaCrm4H8sV2Sy_SAJ2NKzMA1CFKlGsNZAc,14810
+passagemath_graphs-10.6.1.dist-info/WHEEL,sha256=IDSs5FX6_bA_Je6GNgVyz6rcn2XC7t_ySnnLoSan-5o,136
+passagemath_graphs-10.6.1.dist-info/top_level.txt,sha256=Kmzulf9WsphADFQuqgvdy5mvTLDj_V2zkFHU2s3UXos,6
+passagemath_graphs-10.6.1.dist-info/METADATA,sha256=lOIUMnQA6kwFuGPMJIxiO30QPfXJfJQs1lZR5fB28ug,14743
+sage/all__sagemath_graphs.py,sha256=JDD5JDYqjh6tH5NLMO1XMlbGtBoilMe0Hgq7X0B_6PE,851
+sage/topology/simplicial_complex_catalog.py,sha256=GjQMVaPprLhooPWTetGlb27hL-t8sMIssECeb2ESdi0,4722
+sage/topology/simplicial_complex_homset.py,sha256=8wSfpi6t6qQpRW1CkLSb36eFieflaYQKpcshdEjutZ8,7425
+sage/topology/simplicial_set_constructions.py,sha256=5Qw7TdOn10-NjSf8Vfrfc73-WEjKSnqFcHI3mi2SkcE,115261
+sage/topology/simplicial_complex_morphism.py,sha256=JZc3bVCAwibwccMzL0XdIi8imVTlnkDvd0R-nFBHHCQ,32596
+sage/topology/simplicial_complex_examples.py,sha256=68Ul_u-OiKNgQooX6uTVKuvXv_w3-yokshrBf-ytF58,70188
+sage/topology/delta_complex.py,sha256=qyIID-0j35XBclNbaM1jEdQQwjtf7kwaOVgbofaFL0E,74587
+sage/topology/cubical_complex.py,sha256=xceZuOdl1u4ztlp1tJF2tQX58nSSIH5ylelYpZVBECs,70973
+sage/topology/moment_angle_complex.py,sha256=x4IBzLq8cJ3Vg6jEX_r_iiBJgELl9bwoDp_YCf9u5Rk,32849
+sage/topology/all.py,sha256=A2U5MB47msO-FzH_uDI6A17k0cNQcYlT9kqr6GLE1-c,969
+sage/topology/filtered_simplicial_complex.py,sha256=B1dyj4DuYe6qmLuxtAAtv4UIrC0arhf-QBbixJW44v4,27020
+sage/topology/simplicial_set.py,sha256=YiE4MsCy1qsBFFJYSes9gxh4tXl9bQSirj2PYWaz95c,152633
+sage/topology/simplicial_set_catalog.py,sha256=Kr3lNNBDks_fux7zLfvv5J9ZTW_WFK8wmpYDzlumod0,2172
+sage/topology/simplicial_set_morphism.py,sha256=JeB8BKzOsemRrvXlqdzADa1WOBh3JnuKE47I5VskMiY,55739
+sage/topology/simplicial_set_examples.py,sha256=8SqHHg08N0c43JHK-7pSqF-EOElYhrU8P0qNMdmdYcA,32765
+sage/topology/simplicial_complex.py,sha256=IcEqOQAUvfj2yvld8BZwuWMpt_wlGvzyvVwA5Rl74mo,196261
+sage/topology/cell_complex.py,sha256=2La9yE3TJ5Rtm4CY-LqKC6LrUofaufqQUaoVN7G8p00,47382
+sage/databases/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/databases/knotinfo_db.py,sha256=ijt1goKI2Z_Yst6XTbmH9511cWKZWSd3HlGMO69ugqQ,54189
+sage/combinat/graph_path.py,sha256=enqb7IFVXGZ-roxtMJRTaTmCDY3qr_kkjC-03qg0p5s,13122
+sage/combinat/shard_order.py,sha256=hULsSgJS39xMwEe8UrNCkoTZii41V-cROxE0PAvsE8k,8060
+sage/combinat/binary_tree.py,sha256=BnjdPKrHRxtJrlKmUSHqrDDQ0UvQbm8onuh0IHpSGV0,183189
+sage/combinat/abstract_tree.py,sha256=3KcwC0HaEmFz8O_dR-kvy2xiMp9G64v5SEC4zm7Szqg,94266
+sage/combinat/nu_tamari_lattice.py,sha256=6OASICLeUkAmjeRZu22t68nsSeBkKUasdCDzzTDndQQ,9470
+sage/combinat/ordered_tree.py,sha256=Q08B55_8JZPxiymIAh5bbhiepvWtjj3T96owcR0mLfw,47856
+sage/combinat/finite_state_machine.py,sha256=rngcy9hczCxVkhNQvK6ho3A7xosqi9bv1tUJaLJR2gU,574657
+sage/combinat/finite_state_machine_generators.py,sha256=YqeqpPwWpra88B4GW5IcA2rtbXpbeT9uGxREegTJFdM,73186
+sage/combinat/all__sagemath_graphs.py,sha256=zAse3aKr_WJaFWDL93rOM8mNuHUvs_hs0gJsoxfbqiQ,1329
+sage/combinat/yang_baxter_graph.py,sha256=BGcGaIfAnOzW4g9tCg6uDpKrHHeG-Q5z74TBQa0JYhc,33932
+sage/combinat/interval_posets.py,sha256=n1EpZC2XnwvRAPiG-fA5c66krNlO2V-kox9LwgawHu0,147095
+sage/combinat/rooted_tree.py,sha256=HwZ6OlSwROTXZoZsgPEd4Hz9VqYPMsZYXdrO-PbcT4s,34211
+sage/combinat/tamari_lattices.py,sha256=1K261Ntyt3uZqkFVVTC_PVyimDFomOeJeEW3UAwqpQc,11061
+sage/combinat/designs/covering_array.py,sha256=SC7dwTzNt4lYJk_FKRUt_EsaOYjFRXMJus2i8NKGP84,9600
+sage/combinat/designs/difference_matrices.py,sha256=H1gvPjsH890ASH66zSJj36yiFMIU_C40xYZA609eawE,8610
+sage/combinat/designs/resolvable_bibd.py,sha256=WzDQ_n-_yKX-6YXYbkP5yIrXnU-UW_Mo0I7Mg6zGbyA,30498
+sage/combinat/designs/twographs.py,sha256=gUba7-nivoQpPrPgHMD7UshhY9Q7do9GXylLb_U_xC8,11230
+sage/combinat/designs/steiner_quadruple_systems.py,sha256=-vnODm9iybM9_x36oDOFMZyu_kMaMTZWYbzcWAvaG0E,68601
+sage/combinat/designs/orthogonal_arrays.py,sha256=_F7d167KuXhNPoatn_aHQXnxBY6EELW_FlYQ_c1RyIk,82598
+sage/combinat/designs/subhypergraph_search.cpython-311-darwin.so,sha256=J7v7Os2uw28MgL6wzxtFagE1uC3qm4fclTpyk699dIk,125320
+sage/combinat/designs/evenly_distributed_sets.cpython-311-darwin.so,sha256=AmznDb_aE4Mi8V5orqpvSlaXuU8DwbKfmgi3A5MvA_M,189376
+sage/combinat/designs/gen_quadrangles_with_spread.cpython-311-darwin.so,sha256=Qzw6_bzprqhBvDmCLoXNza4MDOsmK8XuU80TsoEv6vE,144880
+sage/combinat/designs/ext_rep.py,sha256=4t0xjnVqEyZUQn9L4JxvSt2wlhHJoY3Xz6uAP3L6_7g,34884
+sage/combinat/designs/MOLS_handbook_data.py,sha256=SOjglkjrMNtbttoKD5werH6IXSUMwt1Zh_cOLOPSwTU,42437
+sage/combinat/designs/subhypergraph_search.pyx,sha256=EfLrVGZNDSiVgeGNohlO09f0wdqPh6XwQHCrHNgqmng,18146
+sage/combinat/designs/block_design.py,sha256=PHZG5Q9egUb7PwVnX2MQq6UPATxZPp5zq_VpJzWLAxU,38165
+sage/combinat/designs/database.py,sha256=0sfODA8sYjemLejPQNZnQqj_eIgyPuLyTsNWw495w4Q,242955
+sage/combinat/designs/orthogonal_arrays_build_recursive.py,sha256=Ley_eOHwF1sOk9MukJDOM8KlPLT-JVdA7hqPz42Z_YU,70698
+sage/combinat/designs/group_divisible_designs.py,sha256=U8YLCTUbbsdmWH8aiKqxWHv3AFNHqmCh1eoVFELIch4,13037
+sage/combinat/designs/designs_pyx.pxd,sha256=d78q7gQf58kZirLF1TXxNjLi50YYo-EIUM2e4kXS5C8,679
+sage/combinat/designs/all.py,sha256=z1avRgBKp3Gu_OhxVMFYtxWoXCBOcFd_t5-C1JcoAkw,2015
+sage/combinat/designs/bibd.py,sha256=fB_aPra3Cbr4uqef4vLN1sIKJ9yXn-teFGMOzrkRpiw,59071
+sage/combinat/designs/latin_squares.py,sha256=R8tl7zoIGvbxrQdoRMoeW9eF5xeq0m41eZCNwg0i-7w,23159
+sage/combinat/designs/evenly_distributed_sets.pyx,sha256=_ExpH2ImCLYhXG4aovPXKHGa8XMKYlILw-r5Iv1Yr5E,25548
+sage/combinat/designs/gen_quadrangles_with_spread.pyx,sha256=oE049xlfXkX_ly-WpQZnPw2cNXYDueHeuRJ69bfTbkQ,10767
+sage/combinat/designs/designs_pyx.pyx,sha256=_unJWxusmZVUZ5SPiTtgOCYZmhWTFqptLb3MOz37ND0,37170
+sage/combinat/designs/incidence_structures.py,sha256=ki-yG_ebZenomRVE1zA-oQAKzGEAR0ObmaVFSEfHXFg,89645
+sage/combinat/designs/orthogonal_arrays_find_recursive.pyx,sha256=NMqnHcUCSURto_AnwjkXuDc298lLF0m0b0uObekmG0g,34281
+sage/combinat/designs/design_catalog.py,sha256=u9FpOxLuNuEcRxOU3C9P_bw-OGqQL0qgGsjUFFx7Icc,5095
+sage/combinat/designs/designs_pyx.cpython-311-darwin.so,sha256=UnHSX_zUOB-26NKkBaeGHC5gqVvELHEz6JA6bXhcAR4,262096
+sage/combinat/designs/covering_design.py,sha256=GhpSmZALYIwSjSx2oEOxxXhLemJCaKTrIGjZS0xj6AI,17297
+sage/combinat/designs/difference_family.py,sha256=0fhKdWJVL0uErG5BwLfJKt2cDgF8gHIkudLtF6So1rI,155391
+sage/combinat/designs/orthogonal_arrays_find_recursive.cpython-311-darwin.so,sha256=wPWS4tT4py4Dy2kcdrsW6lr1l8bwQ1YThPOawhXdV1k,210864
+sage/combinat/cluster_algebra_quiver/quiver.py,sha256=mDBNojdFE00O_61QeHzwsWb1Zxdv9gWs3cVsXM-zzYY,86160
+sage/combinat/cluster_algebra_quiver/mutation_type.py,sha256=1aVYcY7dOakwBueA3E3Tu7PImQNyw3TiSw_7s5lNA_M,76256
+sage/combinat/cluster_algebra_quiver/mutation_class.py,sha256=cv4g59ZLppsG55L2t5ec0TviJ0yuCqozpakIBGFAUUQ,24134
+sage/combinat/cluster_algebra_quiver/all.py,sha256=Kn96IeqXORbsHL0NSlKT3mKDtcM2biPzgxNrab-BiXY,831
+sage/combinat/cluster_algebra_quiver/quiver_mutation_type.py,sha256=24QBRRseafrBvShSJC_ilP7nY6QwDX0U1GkMDxFhoBA,92005
+sage/combinat/cluster_algebra_quiver/cluster_seed.py,sha256=8WyDGr-i77io5pC5xSCdMP-0ssdWxLZKyKVTN6eMx-Y,197656
+sage/combinat/cluster_algebra_quiver/interact.py,sha256=J-Ka38Eb540DIzet6XP_7qdYh1Bfz-xucAA8YL1BLO0,4250
+sage/combinat/posets/posets.py,sha256=geox_irhoOkz96gNyKD-fFzQZjmHojrks4bpBGE7FFI,340260
+sage/combinat/posets/poset_examples.py,sha256=JVl_HRnMvkLKFUre02tVU9Qbu_ideGcfJsBfkLYkY1Y,79012
+sage/combinat/posets/moebius_algebra.py,sha256=FZY0OqDJd_QBWGzZJpCRk3573wlJBBXU6Cl1TxJt89s,26399
+sage/combinat/posets/lattices.py,sha256=UMfTOqp45FQ35sf-F6LciPvva1Tb6P0mtc0cHG3fqXc,186721
+sage/combinat/posets/hochschild_lattice.py,sha256=wkrxQDkzGoAdhLU7YjiVlGHaoSXUxqwCDjmH-HE4uZQ,4667
+sage/combinat/posets/incidence_algebras.py,sha256=v9QMrN1VW8T4vMfdrJpr4RULr0RlzCIPii0IaN0UVxU,25072
+sage/combinat/posets/linear_extension_iterator.pyx,sha256=1DVxfIsMvtsPGjOi3SUjWtVKFKXQfnk_UXKtmsTpQl4,9272
+sage/combinat/posets/elements.py,sha256=IgixRtTMTRKz3nGJGcYtBwucK22b3I5xy84ephRjpVE,7982
+sage/combinat/posets/mobile.py,sha256=1Fzspx-afq66PO_5BTJoprp4GemROCPnZOacqZiJXI4,10558
+sage/combinat/posets/linear_extensions.py,sha256=LWAWKnGaOf8JmlxOe6mJMyu1nxh9CJJr87PXqNBgrJU,41716
+sage/combinat/posets/all.py,sha256=A-S_eIm6Io7aE5YjG_ETS9Fsam30I8xOIR56QG8hpMs,1438
+sage/combinat/posets/linear_extension_iterator.cpython-311-darwin.so,sha256=9AVhnX1Zo7bDKvtYqfotuuFyEm-Qho5FfrgFqm8j6cQ,146944
+sage/combinat/posets/hasse_diagram.py,sha256=u-A0HrvEuLCUhZwBcTWyrLpDpM03pkpjAqtIuYrxIP4,133205
+sage/combinat/posets/hasse_cython.pyx,sha256=g8C4EGYMN0jl1xLhmeaMzbIIyvGujWT0W5UCT2Qje4g,5988
+sage/combinat/posets/hasse_cython.cpython-311-darwin.so,sha256=FwFalc4ETT4jfq-h__QtUsRVfLBMFSP64csE2wG1aew,150272
+sage/combinat/posets/cartesian_product.py,sha256=_ZyRnB3-t3vQpaHjlXO-a_GHvCyQzxzH5FtLXIKbt88,16945
+sage/combinat/posets/forest.py,sha256=c-3aHa_yyTN2Zo7ddPv4GIxDCG3ebs7hmf3r99FG3kU,1017
+sage/combinat/posets/bubble_shuffle.py,sha256=6EutFGs0dMvjN7f51WAefYRLBRLc1enZ-N2Offx74M0,7485
+sage/combinat/posets/d_complete.py,sha256=3k1llRG7zIgKmvy-gJ6_A2liDvjTiC04OX_vOdmzoUU,6611
+sage/ext_data/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/ext_data/kenzo/S4.txt,sha256=iSXavQqy7ep6HFOWnnsHtqoDhL4Hu3s1SpsaUKbizWs,272
+sage/ext_data/kenzo/CP4.txt,sha256=WXb63Qce3f9Z3Q6K3_zkI0W4-cHBM93XMn7K5bNQD3U,640878
+sage/ext_data/kenzo/CP2.txt,sha256=DYHV8ETaavPvch7t5KdEuGhEqoOAozD7NVAzFGbR3ws,1757
+sage/ext_data/kenzo/CP3.txt,sha256=zyCb_0Lh5zAUrK_RJ-wFdCckivlMRyIEnN9xVg1sDsE,27973
+sage/ext_data/kenzo/README.txt,sha256=SZywXyUDRE8JUt2_JajOYslQiEBSkkB5-14jtxPIt08,1912
+sage/ext_data/graphs/graph_plot_js.html,sha256=OmGUTusnlNQgxC3rb2q_1FR8flYvLT6DNfY0zjY_0_0,9811
+sage/sandpiles/sandpile.py,sha256=yeO4-dNtmYd5LQV86K5XyMkxYVK3w_rnvBudZNTzTpg,211694
+sage/sandpiles/all.py,sha256=GxDiTE98htXEil5sR7gdVNgIh8eCu6q1IyxjHPOLyx8,565
+sage/sandpiles/examples.py,sha256=NNlBeEP0Nd7G4FNDNbsGRH51a1vOX-Pxo2aUjY1cUao,5595
+sage/groups/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/groups/perm_gps/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/groups/perm_gps/partn_ref/refinement_graphs.pyx,sha256=AyuBZ0MJ0x9EIiVzInK__7W4dy_hCONOBHyP4qy721M,56634
+sage/groups/perm_gps/partn_ref/refinement_graphs.cpython-311-darwin.so,sha256=WM3RxKYZtOsfKxD941HHFcBUBcKDVNYV1a-m0cWCdlc,309424
+sage/groups/perm_gps/partn_ref/all__sagemath_graphs.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/groups/perm_gps/partn_ref/refinement_graphs.pxd,sha256=6sU1BVnxoySV9GhDXZsUKBlAgAMBqc8Bp3FELHB3neU,1759
+sage/graphs/weakly_chordal.cpython-311-darwin.so,sha256=4OX1JhyYZuQ9ppaNZCP5hq-Yvo1Me3pEffSmVthKZ30,181744
+sage/graphs/graph_editor.py,sha256=_6wr59GPJfl0lylU_tMsqQbc1jH8E8GD6ZxQdVBxBYQ,2850
+sage/graphs/digraph_generators.py,sha256=jrsVSnxuslJnxYk67WmGr4H0NM4M8kJZv03VS2SmgW0,79755
+sage/graphs/asteroidal_triples.pyx,sha256=kslBS2OY3d7F0k54vb4nvb1pKH4UfvXv0AssHf9U61Y,11269
+sage/graphs/schnyder.py,sha256=OdTuBwHll5p50etHaa6cU_NvEKh7BOS7ILVZcBUZjCc,30683
+sage/graphs/graph_latex.py,sha256=_zJtj4YXZ0wh8wgL2Nk9-6UqKwd8joEqjfWEusX81Jc,99136
+sage/graphs/independent_sets.pxd,sha256=ozW1INPrNhfTHx9P0yQBW9m4C0VyNILAr2MixvI-Ao8,322
+sage/graphs/matching_covered_graph.py,sha256=q6GuGdx8yQNA5uA0LclgD9dWO6RQwJiABIomLScWZeQ,144300
+sage/graphs/trees.pxd,sha256=wyQiHIkw7Zf3CCJqf1hLxJsCHOg_4D2R8cDcTGPHe3E,377
+sage/graphs/traversals.pxd,sha256=B17xUmzx5ar22san3Zcz6iX2borzlmLYHQWBzJ8cuXY,481
+sage/graphs/asteroidal_triples.cpython-311-darwin.so,sha256=jtoIj4TVgghpiDARCDR4io60k8_uWX6KR3eLl6_xHhM,123936
+sage/graphs/edge_connectivity.cpython-311-darwin.so,sha256=RmIrZvON0gNhLZ9beOGaRjAkeKl9iXNIeKVMbp6OYtQ,200240
+sage/graphs/isoperimetric_inequalities.cpython-311-darwin.so,sha256=GPC37VTd7w9zIdktstOwaqCcgo0w5kUt35WaxhR-HUE,145392
+sage/graphs/edge_connectivity.pyx,sha256=SBrTBJaeM8uLsF6d-_5frdbPtWanWvJSxiEO7k7H0b4,44701
+sage/graphs/generic_graph_pyx.pyx,sha256=i5gISutTP3P_Fc5LInP-fDJX_U1nFRocdXOt114lmIU,60287
+sage/graphs/line_graph.pyx,sha256=p_qn8oH7NCwPlmDBD01HO24Gfhsbtfclzng-RJcRHqM,27749
+sage/graphs/hyperbolicity.pyx,sha256=evfeaa76EibW-PTFm2QWr_zOrN5V9G0FaEPZ7xGf4YI,64542
+sage/graphs/graph.py,sha256=Q2GVcF9pUUuXcMLDUIL3eqdsRxDXtUXjXKHk1IT-IVY,381762
+sage/graphs/distances_all_pairs.cpython-311-darwin.so,sha256=5tWaUUBY_W_GEM-8w-5CJqTMz6ctvOAmU_bmcdgc89Q,319392
+sage/graphs/convexity_properties.pyx,sha256=zHhpsRj6qi2oLxoUplnzDDaQL0nYYtot6q6GC1l-8Ls,31137
+sage/graphs/distances_all_pairs.pxd,sha256=RMrpaxs-r98iY6BnCS2H18BFN85BNrYPk9Dipuvva0s,565
+sage/graphs/strongly_regular_db.cpython-311-darwin.so,sha256=v3V_e_ug0vLXNT9YjKkf8PXZvkfpuBooqcrbAo3LtGk,977224
+sage/graphs/graph_coloring.pyx,sha256=sMP53cvRB_mHdtKR44P-uI_kRWxmwXgejcc947yRZno,85604
+sage/graphs/traversals.cpython-311-darwin.so,sha256=EYsmAaoCC5gu6XvMSsBiUKn4SYEGSc5cnE6l_owF_Zo,326768
+sage/graphs/graph_input.py,sha256=r0n78xXCSG6awA0rZDfBPfFsPh4lpvnEBxCkE0WP5A4,28844
+sage/graphs/isgci.py,sha256=6nOGMGYeD95W_IGzRznhkCMl4Ceh2sOsLlZ6QFFDYFU,34105
+sage/graphs/graph_generators_pyx.pyx,sha256=-TP5O6mDg7clGrKcDLUzcFsLYuw8VGGhPvLV56I9wBA,3214
+sage/graphs/all.py,sha256=x8SE1AFbrSgF8NtYDKAPR4Qj1rcawY5NCRN3zdNx76U,1500
+sage/graphs/generic_graph_pyx.cpython-311-darwin.so,sha256=w8LomNd-jg0tVLUOz3x6JuCis6dQY7DDQcxhFhFc7Wc,321440
+sage/graphs/views.pyx,sha256=VVDEBs9ydl_rbpm3737QkuAwWyeyuAEHMsV8sJJiIwU,27957
+sage/graphs/spanning_tree.cpython-311-darwin.so,sha256=VVHBcuGMephgZ0ElkrhV7kSdhaCxGDA6cu9oJa4lvB0,352352
+sage/graphs/hypergraph_generators.py,sha256=0gFR6duplhJ9m6Ecn-APwNIuooR5vcBoQkBdj_hJcSA,13926
+sage/graphs/connectivity.pyx,sha256=Ttl1tzPlXRHmHuoFKcWOmR_YcDvKanDDcoPCqEIAsAQ,183216
+sage/graphs/graph_coloring.cpython-311-darwin.so,sha256=0l3hMzUsX5zaRMx385FEwwDUdvNR5_Cu6um1tlEwe-c,714008
+sage/graphs/convexity_properties.cpython-311-darwin.so,sha256=QCzVmRu7JbhlfNZH_qGlRMWEKnb9R8mhOyH-_Zh3tsU,208560
+sage/graphs/matching.py,sha256=rLuE4t6nErNdDnx7vnMBK8YhZhmrT4N6o75KfKo9Ry0,62208
+sage/graphs/connectivity.pxd,sha256=xbB3JNVdxZDUwuhSrPaioJujxcOOUzCM4nUZ0Cmild0,5378
+sage/graphs/bipartite_graph.py,sha256=GsQhkJMclM0TCT8ifOaPTjweIwA4yX6rcD4yUoLgLXg,105820
+sage/graphs/connectivity.cpython-311-darwin.so,sha256=d8R4FFjw6_5agXJJZB5St2u3m3YJYx-24rvO4lXsrYM,766784
+sage/graphs/graph_plot_js.py,sha256=jhaO_KUhxeOCw1IsZGPeCobW5nfXXEcJqIHEWV9rt0U,12898
+sage/graphs/domination.py,sha256=BRTVApP6SeB-NVe3rcuJDfpSbg6jWRc4rWgTPgMUsVo,48674
+sage/graphs/independent_sets.cpython-311-darwin.so,sha256=lvOTAedPj33EZ3wkbUSRIVrC_Cc9ePDmonpqL5XQMhc,146112
+sage/graphs/convexity_properties.pxd,sha256=5NS5R5LyBnwfiKEo6CNG-aspmA0HqkC0fvsmmr799xo,627
+sage/graphs/distances_all_pairs.pyx,sha256=CEbGv42frddFNp3xGOyC2M4Tnh2M8vLRuNMSYk3oyS4,105359
+sage/graphs/path_enumeration.cpython-311-darwin.so,sha256=mcpWtTYa0IIq0yCK1BFQW0G4Z38laxxy3eSzHHg2hJE,439544
+sage/graphs/centrality.cpython-311-darwin.so,sha256=hIKo4oHjgCN7JVlgdyMSVSF_t18vVu0-Ww4l3xf2LU8,220496
+sage/graphs/line_graph.cpython-311-darwin.so,sha256=BNtq2YWxUtBuRnB1Vip4OAGrPTUudlt10O_GBlDqc7I,240000
+sage/graphs/generic_graph_pyx.pxd,sha256=aVwQbA8BGVHbwufAo6-EHEhyfCFNxRq7pPI_FtOJu3Y,825
+sage/graphs/lovasz_theta.py,sha256=mEZIrYcmhJHNolsSfRVUnXl9FBkDdqbQ1Frg8qmqJjo,2151
+sage/graphs/tutte_polynomial.py,sha256=DNn4VjxZ4dogFM4WhWD1C3jLXl_FRSwxjXRbk23Ah2k,21854
+sage/graphs/pq_trees.py,sha256=6z6pzjeApBLvjx4FTqxklFHjEcwoF9Z78LlvTpcv0G0,39418
+sage/graphs/partial_cube.py,sha256=u4X-fZgUIcaX9QSIv_N8kbVUYRx3dH51LCmEfc2nYkg,16402
+sage/graphs/genus.cpython-311-darwin.so,sha256=DgK0STzS3alYF8ToUkNjpMULsCe66LEd9M496spl1a4,144288
+sage/graphs/graph_plot.py,sha256=4a3j1oUY-TAfNGDJpqONvQKQEFoqDUUN56fJXym80AY,70634
+sage/graphs/graph_list.py,sha256=z7EoLhCRkH5F7acA2r28DzDkLw08xODgOLXl8f6Rf80,14439
+sage/graphs/print_graphs.py,sha256=pBg_hHJxWAcsEzqbqDG4ehZg8C1LreySAbqcoHBmE_A,4931
+sage/graphs/digraph.py,sha256=Uj2hmkx-k27D2DyNAAQ-wmKirOIP-0Hyg_8g_CMFLIE,197705
+sage/graphs/dot2tex_utils.py,sha256=lWUucZKdFsTltrGPeqwHhvbdScFEMltjtTU6C4p2x_E,3173
+sage/graphs/traversals.pyx,sha256=UX2ttDY92aCJPXieOB-VD3dYLfR75gxjLmD1JLBO_z0,65959
+sage/graphs/path_enumeration.pyx,sha256=WAQQiHIroIvpSfWdGvHjuC7tPdEiCX5DWxidHveiXUk,90408
+sage/graphs/isoperimetric_inequalities.pyx,sha256=37Xx8CbEFdLANoztQ13JzxZXrf5L1uIjqUYtCyTDOyk,17019
+sage/graphs/graph_generators_pyx.cpython-311-darwin.so,sha256=VPZch0k5zRPPlxtTklNCRwjzHUZVxjhZhUrhX7rFVpQ,107544
+sage/graphs/weakly_chordal.pyx,sha256=quFw1k-AAmJ3BJs7Wm0YSUZgZbPCMsEvgUZ8oqiFoc0,21563
+sage/graphs/graph_database.py,sha256=TxWGmR7ueILurw77Xk3Uz54gsbjZ00H-_jhbDmNf3m8,51558
+sage/graphs/trees.pyx,sha256=fxCGm1lmkjsaLSg4L0IbnA_gMzYIWhPwbU07_C8e5UA,8733
+sage/graphs/centrality.pyx,sha256=jXYVW5ZFRXYkI_Esw8LaPsdVKLhTG4bUZBgUjzGrDGQ,37670
+sage/graphs/spanning_tree.pyx,sha256=WbPx-yeaNy_UQOOL6UqdHrYvJPhv3J-1t7rWgCo_Rks,55241
+sage/graphs/strongly_regular_db.pyx,sha256=LOmA2tLe7Amewsj0uZt8J9NTHOmtCmCeRdMLVFlQoaM,132917
+sage/graphs/independent_sets.pyx,sha256=AA4D-pjoMyguifXSDRCZJmwZqfTMIv6tVpxXiDo83vs,13082
+sage/graphs/hyperbolicity.cpython-311-darwin.so,sha256=jRqqvCZKA1TvDugL28r4abXQ0TzhN1_n3jp_gdAdlpo,278192
+sage/graphs/views.cpython-311-darwin.so,sha256=YUdcs5epvostHSYTCfBDbLwOP1E5Yedp-QB8_NJaFJQ,204000
+sage/graphs/comparability.cpython-311-darwin.so,sha256=mFL1-EphqlfMWQVYfu6mrXd0es_s4t8q2T_RKWtM-zI,259408
+sage/graphs/cographs.py,sha256=e_IBKmczjffdNkQzZmyliRgXS0j7n5wT_dE_pWj74iY,15184
+sage/graphs/graph_generators.py,sha256=Z7-IqimRFQ_HFJepTs_F-f6noWZkBDCUtMcoDHmHfPg,134580
+sage/graphs/genus.pyx,sha256=xzcRPWKAgtVIQfBOLJNXVm-22LPCBiYSyzmjNpE6U_w,21672
+sage/graphs/generic_graph.py,sha256=4UuxEokBL5D201CsVaG4iz5gaB_XhUyzq_p6l75_JAE,1114294
+sage/graphs/orientations.py,sha256=4PBJOH_ybCyF2uqbknU3QtPdiCOMqbMvN-rboqBif_8,53303
+sage/graphs/comparability.pyx,sha256=txNR4i4nVxETeRuITmZSnF41Bcu5Lc3-9p_Y14U5Ai4,32292
+sage/graphs/trees.cpython-311-darwin.so,sha256=wEkjI7Qe-q2b8b1aYNbb9KGnfqOW0YXddAdXTatco0c,118080
+sage/graphs/generators/degree_sequence.py,sha256=oN9BFV3aC3g0Im_L9v1bx4aBzEf2qFRc8IHpxMVLkF8,8735
+sage/graphs/generators/distance_regular.cpython-311-darwin.so,sha256=Agua9JhXZlLESKpq7RsA96oFmB9kmAiYxBKjewV4e_I,831080
+sage/graphs/generators/distance_regular.pyx,sha256=tfzVRJT3zdrO3yOHr4Q1eNrhmpNlRKCNJoVKgQ5KH9I,96165
+sage/graphs/generators/smallgraphs.py,sha256=y441EzXwvSBnJ-qwp4lbZvlS19FfoC8tV4MO4H_HEpA,202063
+sage/graphs/generators/families.py,sha256=9FS3o44XM-QNBHLDepRJPCyySPvdxzAFIm-zEqRIe1A,164812
+sage/graphs/generators/all.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/graphs/generators/random.py,sha256=lDQxB_YZ6Gwo-_LrqXx4hXC1H2AsP_Tsa0Q8-p44A-8,92227
+sage/graphs/generators/chessboard.py,sha256=AYh9NIWZcueME7xiSL3MUdEa9O8O_NTDXh01cHfP8Js,20682
+sage/graphs/generators/basic.py,sha256=0KtJ29r3lQVXVENR2ceX9SZIQOkM-8yNwhWdrTHG1dM,61442
+sage/graphs/generators/platonic_solids.py,sha256=v3TMsnK2gI0vnhX9IxP3IsTWqw6GpYQdk6xZk9WEJG0,10134
+sage/graphs/generators/intersection.py,sha256=N3C3dLzBjL_Jeii1aU_Xm3O78yMLvZoAY1Y6Egu4MxA,20349
+sage/graphs/generators/classical_geometries.py,sha256=3xoCUEGmShNiGwvc5eKvFbLgeQH-lWM23Iv2uYVtp5A,63415
+sage/graphs/generators/world_map.py,sha256=YZ992gxxy6kXKaWvbXqG2tfxk5AaHw3a0t991pskPlY,34547
+sage/graphs/graph_decompositions/cutwidth.cpython-311-darwin.so,sha256=GyA5tMhRco6-4U8mqj-fwqDx6c6D_dbeYUJWdc9Xeac,207088
+sage/graphs/graph_decompositions/tree_decomposition.cpython-311-darwin.so,sha256=4yoDwc7u7LVX0FmzqH72Ekpo5waK6TMb4ntstjU-g6Y,507888
+sage/graphs/graph_decompositions/vertex_separation.pyx,sha256=nF-RwfUUZZ-JHi-iMj7D2ibAsrbmLQuEpGRXqN7_DTQ,74865
+sage/graphs/graph_decompositions/vertex_separation.cpython-311-darwin.so,sha256=n9zClJoQGnG_2-EPM8kfJudTq9HgPVWApp_paYkwvzw,322016
+sage/graphs/graph_decompositions/fast_digraph.pyx,sha256=02nMqhb4MvzaJFRGSy4ZefAvhChZsMJBlCTaOtOS3Es,7388
+sage/graphs/graph_decompositions/cutwidth.pyx,sha256=ah8ysfGRlDw3UTeG9uPcQuVAjs0SfaYSnRdJ3z-RvdA,28601
+sage/graphs/graph_decompositions/tree_decomposition.pxd,sha256=dxfbHIMapSvsj67OLVBfLtvAYhWvDNSwmbmqmrvEYZg,555
+sage/graphs/graph_decompositions/graph_products.cpython-311-darwin.so,sha256=MiVxb68Cn4xsuhmWBaytzoUspRLvLzae-EUZo6XxGrw,208568
+sage/graphs/graph_decompositions/slice_decomposition.cpython-311-darwin.so,sha256=OQWUOXpN95B_ZmDL4F9tmAi1hha5pn7xSGZACZUK6_0,291808
+sage/graphs/graph_decompositions/fast_digraph.cpython-311-darwin.so,sha256=Adu85Ky7uVhdOxavH31CwNiWxeTeZs99ci850TzUeQE,102032
+sage/graphs/graph_decompositions/slice_decomposition.pyx,sha256=oBp4OVgykHatrhiSLgscsq5B5lUINmCierb3sWpO79w,40359
+sage/graphs/graph_decompositions/all.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/graphs/graph_decompositions/clique_separators.cpython-311-darwin.so,sha256=p3pUwtFFEkVikCG6eIwA_3qoSWbElh9sbyooxFhWdmU,242928
+sage/graphs/graph_decompositions/bandwidth.pyx,sha256=9BvA6v6LheIIqwtkvbendaO_aux-ROfaMBcAM4aZFd0,15576
+sage/graphs/graph_decompositions/modular_decomposition.pyx,sha256=EkuXojAhXF53MXTiat63_EWdglqfodFZQiZk5dHV7-E,51818
+sage/graphs/graph_decompositions/modular_decomposition.pxd,sha256=SAqgLApPT4pa_e2XpZ7us9PhDV34y5cTZB7YzP_lbkI,1100
+sage/graphs/graph_decompositions/graph_products.pyx,sha256=HcTfcex9hrwlcTzBHWMGDonGEUDGGj8jkma0devn5wU,19014
+sage/graphs/graph_decompositions/clique_separators.pyx,sha256=q2Ep-OTAN0u53tg4USepRiw9uOm61XRbsfMKAkbJouk,23690
+sage/graphs/graph_decompositions/slice_decomposition.pxd,sha256=OawVDRv8wbwIP6rbSZHGZQUVF31TNw3fbIXbE2q9XyA,602
+sage/graphs/graph_decompositions/bandwidth.cpython-311-darwin.so,sha256=EAG0WAHldFCFSFMYi1D38ZlkslAHw-kxyRz8zvoytUg,104368
+sage/graphs/graph_decompositions/tree_decomposition.pyx,sha256=IWrChlzZXjEKscgZcbRr4mhvODbAuAbZoHhSNxx-3Dw,73665
+sage/graphs/graph_decompositions/modular_decomposition.cpython-311-darwin.so,sha256=HgleArosdUd71f2f30Gtfp1EYeC5k6yyMCXzh5ZA5O0,492064
+sage/graphs/graph_decompositions/fast_digraph.pxd,sha256=vfxjVz_M8l9rkauaJpXkW1_ubTM3mqUdEjUwlqdD4PQ,343
+sage/graphs/graph_decompositions/vertex_separation.pxd,sha256=kuVp6HcFIRCamGKOy_Z_Qlzb2W_GlrdBRL4b44jdLsw,200
+sage/graphs/base/graph_backends.cpython-311-darwin.so,sha256=3RdD9JgiKlyJWQ_yaTr48FwmpIPklly7tP96Bz8J2PA,163296
+sage/graphs/base/static_sparse_graph.pyx,sha256=79ckrFBDUnAxrn_VAXOHGtCPQnO3OD0KSczE7xas4ls,52381
+sage/graphs/base/boost_graph.pxd,sha256=5Z4FgnxAaZYXOizWEfsxE1D4K2hJTcdhjXxUFJ9rhA0,3654
+sage/graphs/base/c_graph.pyx,sha256=-3-_WEwS5G_jr3gx3f44fSj5zp_JOfK3po-Nu7IVRa8,179658
+sage/graphs/base/static_sparse_backend.pyx,sha256=eKzp6rY9lZD9dX26QwRFk1ojyLTNPywSdPR6tKbdN4o,55396
+sage/graphs/base/dense_graph.cpython-311-darwin.so,sha256=ccoW8BfpjSMwhafVdEhmdyq0tmdZ02WzGKRXGJUfsB4,188896
+sage/graphs/base/sparse_graph.pxd,sha256=O0oPH_Z1-fsxPK-mKMnNq-OL5cE0GcDILqDj-ajytlk,3485
+sage/graphs/base/dense_graph.pyx,sha256=I68QISSmnBJlaFAX59ByG8ght9rxHYtOLMeI7IvjUJ4,25188
+sage/graphs/base/static_sparse_backend.cpython-311-darwin.so,sha256=fzjYl7xZETr8D2JJc7qXIXs94kfyucRv6KhJs4Ypyik,323408
+sage/graphs/base/graph_backends.pxd,sha256=DNjOnDRc2RPV-NtCHuoliKpNfJHC3aK7l0RifUR7DSY,150
+sage/graphs/base/static_dense_graph.pyx,sha256=XyiD925fEEu1z4qu-Mp490Z8Vme_ii_SLRnSAdiLu48,37439
+sage/graphs/base/all.py,sha256=hFccVjiRkLdUqyJcwgIkR5OUo1DvjVPZwsCZIWtgEXM,45
+sage/graphs/base/static_dense_graph.pxd,sha256=1jNghzZMttKdtdD4U2bSrqW0V5LUgoZl9xLIPGkCuAs,238
+sage/graphs/base/overview.py,sha256=WXk4WVm5e6XiCkWCSkHAdMV42DLxVMFnK9k74bbItkk,3186
+sage/graphs/base/dense_graph.pxd,sha256=fZLGgFg8jy8zIWlhlB18ew5Z8ogZN91NsHPmUkLsqms,1211
+sage/graphs/base/graph_backends.pyx,sha256=vl_Cs6xcJJSDlHEfSO55bUQMSziLY3WYnsOza3oK13o,24526
+sage/graphs/base/static_sparse_backend.pxd,sha256=DbBBsONS0Utp1szKGQaeTpoqiNC23XDaL9tnMrDAxvI,903
+sage/graphs/base/sparse_graph.pyx,sha256=dNMlc3m2Vl7fXCz5c7a-rse4boVsMSl3AevHmF0AIo0,56300
+sage/graphs/base/static_sparse_graph.cpython-311-darwin.so,sha256=YZ1-LI33LDQJZo-wgEQuKB0ZsS2nB9ivXTqBctZ5NK8,233712
+sage/graphs/base/boost_graph.cpython-311-darwin.so,sha256=sX8pKCkz6O11IB2JyfozyH9Ds_bTSZcltKXSRaLtwqQ,836464
+sage/graphs/base/c_graph.pxd,sha256=pUsZ48m4XXx4fq8fRWeeaFkM0gzX0r63Kkw7L0IJdfk,4281
+sage/graphs/base/boost_graph.pyx,sha256=mWfPc01Gtyy3YDQ93CcOWZMhsUXN5q2BiyKt4wls-c8,111074
+sage/graphs/base/static_dense_graph.cpython-311-darwin.so,sha256=0Vb8i962-NXblMITIK-qZa1tEMlwe0pTs164iTVUzxc,263312
+sage/graphs/base/static_sparse_graph.pxd,sha256=YYCH7F6h1OteiFLfleAb57CCN-gx42n3W_9fzh8avkA,1500
+sage/graphs/base/c_graph.cpython-311-darwin.so,sha256=sIcU5oPPI3eim9J-VNG9Yl1JRa2YdOiQZqMMwRs10dQ,632688
+sage/graphs/base/sparse_graph.cpython-311-darwin.so,sha256=jzS8EKJkSSUit7ZFHyL9DBIy_8a682CphfZo313IY-M,230256
+sage/knots/link.py,sha256=hU_H43oGYkWMDG4D2xJJawdv7RfXbFYcNiFmSpalhho,179401
+sage/knots/free_knotinfo_monoid.py,sha256=lKx7Z_M4yHt0om_fDYlkAzxGCUycD4yFsrrmKhm5xNM,19714
+sage/knots/knotinfo.py,sha256=4Vkm0-gWRrpnDplo5udTUEUBpv2hDLYTyG2qIFC_Wus,102919
+sage/knots/knot_table.py,sha256=riB4GuRrdOMHmOan1JFsJg4vMzmFEL4u3dwuCHYgj8k,12884
+sage/knots/all.py,sha256=pkVdIL2rSa6WRTBcnx6zew7aZMJJoIKeBmf81XAqyT0,248
+sage/knots/knot.py,sha256=x0eH6Oag_nDOWt6KX0oOnLEogHdvTIlHI3Loj00ZFY8,21094
+sage/knots/gauss_code.py,sha256=XPReZ4_t4FUiV6Nza_8MaCQ-05CuOffdMmk2ckm98jc,8978

sage/all__sagemath_graphs.py

@@ -1,4 +1,5 @@
 # sage_setup: distribution = sagemath-graphs
+# delvewheel: patch
 r"""
 Top level of the distribution package sagemath-graphs
 
@@ -26,9 +27,9 @@ try:  # extra
 except ImportError:
     pass
 
-from sage.graphs.all     import *
+from sage.graphs.all import *
 
-from sage.topology.all   import *
+from sage.topology.all import *
 
 from sage.combinat.all__sagemath_graphs import *
 

sage/combinat/abstract_tree.py

@@ -277,8 +277,7 @@ class AbstractTree:
         while stack:
             node = stack.pop()
             action(node)
-            for i in range(len(node)):
-                subtree = node[-i - 1]
+            for subtree in reversed(node):
                 if not subtree.is_empty():
                     stack.append(subtree)
 
@@ -640,8 +639,7 @@ class AbstractTree:
                 # subtrees, and should not be exploded again, but instead
                 # should be manipulated and removed from the stack.
                 stack.append(None)
-                for i in range(len(node)):
-                    subtree = node[-i - 1]
+                for subtree in reversed(node):
                     if not subtree.is_empty():
                         stack.append(subtree)
             else:
@@ -649,6 +647,114 @@ class AbstractTree:
                 node = stack.pop()
                 action(node)
 
+    def contour_traversal(self, first_action=None, middle_action=None, final_action=None, leaf_action=None):
+        r"""
+        Run the counterclockwise contour traversal algorithm (iterative
+        implementation) and subject every node encountered
+        to some procedure ``first_action``, ``middle_action`` or ``final_action`` each time it reaches it.
+
+        ALGORITHM:
+
+        - if the root is a leaf, apply `leaf_action`
+        - else
+            -  apply `first_action` to the root
+            - iteratively apply `middle_action` to the root and traverse each subtree
+              from the leftmost one to the rightmost one
+            - apply `final_action` to the root
+
+        INPUT:
+
+        - ``first_action`` -- (optional) a function which takes a node as
+          input, and does something the first time it is reached during exploration
+
+        - ``middle_action`` -- (optional) a function which takes a node as
+          input, and does something each time it explore one of its children
+
+        - ``final_action`` -- (optional) a function which takes a node as
+          input, and does something the last time it is reached during exploration
+
+        - ``leaf_action`` -- (optional) a function which takes a leaf as
+          input, and does something when it is reached during exploration.
+
+        OUTPUT:
+
+        ``None``. (This is *not* an iterator.)
+
+        TESTS::
+
+            sage: l = []
+            sage: t = OrderedTree([[],[[],[],]]).canonical_labelling()
+            sage: t
+            1[2[], 3[4[], 5[]]]
+            sage: t.contour_traversal(lambda node: (l.append(node.label()),l.append('a')),
+            ....:   lambda node: (l.append(node.label()),l.append('b')),
+            ....:   lambda node: (l.append(node.label()),l.append('c')),
+            ....:   lambda node: (l.append(node.label())))
+            sage: l
+            [1, 'a', 1, 'b', 2, 1, 'b', 3, 'a', 3, 'b', 4, 3, 'b', 5, 3, 'c', 1, 'c']
+
+            sage: l = []
+            sage: b = BinaryTree([[None,[]],[[[],[]],[]]]).canonical_labelling()
+            sage: b
+            3[1[., 2[., .]], 7[5[4[., .], 6[., .]], 8[., .]]]
+            sage: b.contour_traversal(lambda node: l.append(node.label()),
+            ....:   lambda node: l.append(node.label()),
+            ....:   lambda node: l.append(node.label()),
+            ....:   None)
+            sage: l
+            [3, 3, 1, 1, 1, 2, 2, 2, 2, 1, 3, 7, 7, 5, 5, 4, 4, 4, 4, 5, 6, 6, 6, 6, 5, 7, 8, 8, 8, 8, 7, 3]
+
+        The following test checks that things do not go wrong if some among
+        the descendants of the tree are equal or even identical::
+
+            sage: u = BinaryTree(None)
+            sage: v = BinaryTree([u, u])
+            sage: w = BinaryTree([v, v])
+            sage: t = BinaryTree([w, w])
+            sage: t.node_number()
+            7
+            sage: l = []
+            sage: t.contour_traversal(first_action = lambda node: l.append(0))
+            sage: len(l)
+            7
+        """
+        if first_action is None:
+            def first_action(x):
+                return
+        if middle_action is None:
+            def middle_action(x):
+                return
+        if final_action is None:
+            def final_action(x):
+                return
+        if leaf_action is None:
+            def leaf_action(x):
+                return
+        stack = []
+        stack.append(self)
+        corners = [0, 0]
+        while stack:
+            node = stack.pop()
+            if not node:
+                leaf_action(node)
+                corners.pop()
+                corners[-1] += 1
+            elif not corners[-1]:
+                first_action(node)
+                middle_action(node)
+                stack.append(node)
+                stack.append(node[0])
+                corners.append(0)
+            elif corners[-1] == len(node):
+                final_action(node)
+                corners.pop()
+                corners[-1] += 1
+            else:
+                middle_action(node)
+                stack.append(node)
+                stack.append(node[corners[-1]])
+                corners.append(0)
+
     def breadth_first_order_traversal(self, action=None):
         r"""
         Run the breadth-first post-order traversal algorithm
@@ -824,12 +930,41 @@ class AbstractTree:
             True
             sage: [T.node_number_at_depth(i) for i in range(3)]
             [0, 0, 0]
+
+        Check that we do not hit a recursion limit::
+
+            sage: T = OrderedTree([])
+            sage: for _ in range(9999):
+            ....:     T = OrderedTree([T])
+            sage: T.node_number_at_depth(2000)
+            1
         """
         if self.is_empty():
-            return Integer(0)
-        if depth == 0:
-            return Integer(1)
-        return sum(son.node_number_at_depth(depth - 1) for son in self)
+            return 0
+        m = 0
+
+        def fr_action(node):
+            nonlocal m, depths, depth
+            if depths[-1] == depth:
+                m += 1
+
+        def m_action(node):
+            nonlocal depths
+            depths.append(depths[-1] + 1)
+
+        def fn_action(node):
+            nonlocal depths
+            depths.pop()
+
+        def lf_action(node):
+            nonlocal m, depths, depth
+            if depths[-1] == depth:
+                m += 1
+            depths.pop()
+
+        depths = [0]
+        self.contour_traversal(fr_action, m_action, fn_action, lf_action)
+        return Integer(m)
 
     def paths_to_the_right(self, path):
         r"""
@@ -1053,11 +1188,25 @@ class AbstractTree:
             2
             sage: BinaryTree([[None, [[], []]], None]).node_number()
             5
+
+        TESTS:
+
+        Check that we do not hit a recursion limit::
+
+            sage: T = OrderedTree([])
+            sage: for _ in range(9999):
+            ....:     T = OrderedTree([T])
+            sage: T.node_number()
+            10000
         """
-        if self.is_empty():
-            return Integer(0)
-        else:
-            return sum((i.node_number() for i in self), Integer(1))
+        count = 0
+
+        def incr(node):
+            nonlocal count
+            count += 1
+
+        self.iterative_pre_order_traversal(incr)
+        return Integer(count)
 
     def depth(self):
         """
@@ -1080,11 +1229,33 @@ class AbstractTree:
             0
             sage: BinaryTree([[],[[],[]]]).depth()
             3
+
+        TESTS:
+
+        Check that we do not hit a recursion limit::
+
+            sage: T = OrderedTree([])
+            sage: for _ in range(9999):
+            ....:     T = OrderedTree([T])
+            sage: T.depth()
+            10000
         """
-        if self:
-            return Integer(1 + max(i.depth() for i in self))
-        else:
-            return Integer(0 if self.is_empty() else 1)
+        if self.is_empty():
+            return 0
+        m = []
+
+        def action(node):
+            nonlocal m
+            if node.is_empty():
+                m.append(-1)
+            elif not bool(node):
+                m.append(0)
+            else:
+                mx = max(m.pop() for _ in node)
+                m.append(mx + 1)
+
+        self.contour_traversal(final_action=action, leaf_action=action)
+        return Integer(m[0] + 1)
 
     def _ascii_art_(self):
         r"""
@@ -1308,7 +1479,7 @@ class AbstractTree:
         while l_repr:
             tr = l_repr.pop(0)
             acc += UnicodeArt([" "]) + tr
-            if not len(l_repr):
+            if not l_repr:
                 lf_sep += "─" * (tr._root) + "╮"
                 ls_sep += " " * (tr._root) + "│"
             else:

sage/combinat/cluster_algebra_quiver/interact.py

@@ -1,8 +1,7 @@
 # sage_setup: distribution = sagemath-graphs
 r"""
-Interactive window for cluster seed mutations
+Interactive display of quivers
 """
-
 import ipywidgets as widgets
 from sage.misc.latex import latex
 from sage.repl.rich_output.pretty_print import pretty_print