cotengra.pathfinders.path_compressed ==================================== .. py:module:: cotengra.pathfinders.path_compressed .. autoapi-nested-parse:: Compressed contraction tree finding routines. Classes ------- .. autoapisummary:: cotengra.pathfinders.path_compressed.MiniTree cotengra.pathfinders.path_compressed.EmptyMiniTree cotengra.pathfinders.path_compressed.Node cotengra.pathfinders.path_compressed.WindowedOptimizer Functions --------- .. autoapisummary:: cotengra.pathfinders.path_compressed.ssa_path_to_bit_path cotengra.pathfinders.path_compressed.bit_path_to_ssa_path Module Contents --------------- .. py:class:: MiniTree A very minimal tree data structure for tracking possible contractions within a window only. .. py:attribute:: __slots__ :value: ('children', 'parents', 'leaves', 'candidates') .. py:attribute:: children .. py:attribute:: parents .. py:attribute:: leaves .. py:attribute:: candidates .. py:method:: copy() .. py:method:: add(p, l, r) .. py:method:: contract(p) .. py:method:: __repr__() .. py:class:: EmptyMiniTree(hgi, hgf) .. py:attribute:: __slots__ :value: ('candidates',) .. py:attribute:: candidates .. py:method:: copy() .. py:method:: contract(p) .. py:class:: Node(hg, plr, chi, tracker, compress_late=False) A possible intermediate contraction state. .. py:attribute:: __slots__ :value: ('hg', 'plr', 'chi', 'tracker', 'compress_late') .. py:attribute:: hg .. py:attribute:: plr .. py:attribute:: chi .. py:attribute:: tracker .. py:attribute:: compress_late :value: False .. py:method:: first(inputs, output, size_dict, minimize) :classmethod: .. py:method:: next(p, l, r) .. py:method:: graph_key() .. py:method:: __repr__() .. py:function:: ssa_path_to_bit_path(path) .. py:function:: bit_path_to_ssa_path(bitpath) .. py:class:: WindowedOptimizer(inputs, output, size_dict, minimize, ssa_path, seed=None) .. py:attribute:: nodes .. py:attribute:: rng .. py:attribute:: gumbel .. py:property:: tracker .. py:method:: plot_size_footprint(figsize=(8, 3)) .. py:method:: optimize_window(ci, cf, order_only=False, max_window_tries=1000, score_temperature=0.0, queue_temperature=1.0, scorer=None, queue_scorer=None) .. py:method:: refine(window_size=20, max_iterations=100, order_only=False, max_window_tries=1000, score_temperature=0.01, queue_temperature=1.0, scorer=None, queue_scorer=None, progbar=False, **kwargs) .. py:method:: simulated_anneal(tfinal=0.0001, tstart=0.01, tsteps=50, numiter=50, select='descend', target_size=None, slice_mode=None, progbar=False) .. py:method:: get_ssa_path()