:py:mod:`kosmos.dqc_scheduling.assignment_strategies.greedy_assignment`
=======================================================================

.. py:module:: kosmos.dqc_scheduling.assignment_strategies.greedy_assignment







Classes
-------

.. py:class:: GreedyAssignment(network: kosmos.topology.net.Network)

   Bases: :py:class:`kosmos.dqc_scheduling.assignment_strategies.assignment_strategy.AssignmentStrategy`

   Greedy assignment: assigns partition to nodes with capacity at earliest time.

   Initialize with network topology.

   :param network: Network containing QPU nodes with capacity info.
   :type network: Network





   |

   .. rubric:: Methods

   .. py:method:: allocate(partition: kosmos.partitioning.partition.Partition) -> kosmos.dqc_scheduling.space_time_matrix.SpaceTimeMatrix

      Allocate partition greedily to nodes at earliest available time.

      Strategy: For each qubit, assign it to nodes in ascending ID order (QPU_1, QPU_2, QPU_3).

      :param partition: Partition to allocate.
      :type partition: Partition

      :returns: Matrix with node assignments and timing.
      :rtype: SpaceTimeMatrix