Refactored ListScheduler, made it non-abstract and added better checks to...

• Refactored ListScheduler by breaking into sub-functions.
• Made ListScheduler non-abstract since one may want to provide custom sorting indicies.
• Added better checks to compare recreated SFG with original SFG in tests.
• Converted iteration period bound return type to Fraction

b_asic/scheduler.py

@@ -165,6 +165,9 @@ class ListScheduler(Scheduler):
 
     Parameters
     ----------
+    sort_order : tuple[tuple[int, bool]]
+        Specifies which columns in the priority table to sort on and in
+        which order, where True is ascending order.
     max_resources : dict[TypeName, int] | None, optional
         Max resources available to realize the schedule, by default None
     max_concurrent_reads : int | None, optional
@@ -175,11 +178,6 @@ class ListScheduler(Scheduler):
         Specified input times, by default None
     output_delta_times : dict[GraphID, int] | None, optional
         Specified output delta times, by default None
-    cyclic : bool | None, optional
-        If the scheduler is allowed to schedule cyclically (modulo), by default False
-    sort_order : tuple[tuple[int, bool]]
-        Specifies which columns in the priority table to sort on and in
-        which order, where True is ascending order.
     """
 
     def __init__(