Add cyclic scheduling and improve resource

• Added cyclical scheduling given a scheduling_time.
• Updated examples to showcase this.
• Added a check to warn the user if the given resources are lower than the theoretical bound.
• Added various checks in the code to warn the user.
• Changed ListScheduler in various places for readability and bug-fixes.
• Fixed bug from #305 (closed)

Closes: #305 (closed) #292 (closed)

b_asic/schedule.py

@@ -120,8 +120,6 @@ class Schedule:
         max_end_time = self.get_max_end_time()
         if not self._schedule_time:
             self._schedule_time = max_end_time
-        elif self._schedule_time < max_end_time:
-            raise ValueError(f"Too short schedule time. Minimum is {max_end_time}.")
 
     def __str__(self) -> str:
         """Return a string representation of this Schedule."""
@@ -306,13 +304,16 @@ class Schedule:
         usage_time = start_time + cast(int, input_port.latency_offset)
         for signal in input_port.signals:
             source = cast(OutputPort, signal.source)
-            available_time = (
-                cast(int, source.latency_offset)
-                + self._start_times[source.operation.graph_id]
-                - self._schedule_time * self._laps[signal.graph_id]
-            )
-            if available_time > self._schedule_time:
-                available_time -= self._schedule_time
+            if source.operation.graph_id.startswith("dontcare"):
+                available_time = 0
+            else:
+                available_time = (
+                    cast(int, source.latency_offset)
+                    + self._start_times[source.operation.graph_id]
+                    - self._schedule_time * self._laps[signal.graph_id]
+                )
+                if available_time > self._schedule_time:
+                    available_time -= self._schedule_time
             input_slacks[signal] = usage_time - available_time
         return input_slacks