Add a skip node test.

tests/succession_diagram_test.py

@@ -2,6 +2,7 @@
 
 from biodivine_aeon import AsynchronousGraph, Attractors, BooleanNetwork
 
+import copy
 import biobalm
 import biobalm.succession_diagram
 from biobalm.succession_diagram import SuccessionDiagram
@@ -254,6 +255,13 @@ def test_attractor_detection(network_file: str):
     if not fully_expanded:
         return
 
+    # Partial succession diagrams
+    sd_min_partial = SuccessionDiagram(bn)
+    sd_min_partial.expand_minimal_spaces(size_limit=10, skip_remaining=True)
+    sd_block_partial = SuccessionDiagram(bn)
+    sd_block_partial.expand_block(size_limit=10)
+    sd_block_partial.skip_remaining()
+
     # Compute attractors in diagram nodes.
     # TODO: There will probably be a method that does this in one "go".
     nfvs_attractors: list[BooleanSpace] = []
@@ -265,12 +273,25 @@ def test_attractor_detection(network_file: str):
         if len(attr) > 0:
             nfvs_attractors += attr
 
+    min_partial_attractors: list[BooleanSpace] = []
+    for i in sd_min_partial.node_ids():
+        attr = sd_min_partial.node_attractor_seeds(i, compute=True)
+        if len(attr) > 0:
+            min_partial_attractors += attr
+
+    block_partial_attractors: list[BooleanSpace] = []
+    for i in sd_block_partial.node_ids():
+        attr = sd_block_partial.node_attractor_seeds(i, compute=True)
+        if len(attr) > 0:
+            block_partial_attractors += attr
+
     # Compute symbolic attractors using AEON.
-    symbolic_attractors = Attractors.attractors(stg, stg.mk_unit_colored_vertices())
+    symbolic_attractors_all = Attractors.attractors(stg, stg.mk_unit_colored_vertices())
 
     # Check that every "seed" returned by SuccessionDiagram appears in
     # some symbolic attractor, and that every symbolic attractor contains
     # at most one such "seed" state.
+    symbolic_attractors = copy.copy(symbolic_attractors_all)
     for seed in nfvs_attractors:
         symbolic_seed = stg.mk_subspace(seed)
         found = None
@@ -284,11 +305,37 @@ def test_attractor_detection(network_file: str):
 
         symbolic_attractors.pop(found)
 
-    print("Attractors:", len(nfvs_attractors))
-
     # All symbolic attractors must be covered by some seed at this point.
     assert len(symbolic_attractors) == 0
 
+    # Copy of the test above, but for the results from partially expanded diagrams.
+
+    symbolic_attractors = copy.copy(symbolic_attractors_all)
+    for seed in min_partial_attractors:
+        symbolic_seed = stg.mk_subspace(seed)
+        found = None
+
+        for i in range(len(symbolic_attractors)):
+            if symbolic_seed.is_subset(symbolic_attractors[i]):
+                found = i
+        assert found is not None
+
+        symbolic_attractors.pop(found)
+    assert len(symbolic_attractors) == 0
+
+    symbolic_attractors = copy.copy(symbolic_attractors_all)
+    for seed in block_partial_attractors:
+        symbolic_seed = stg.mk_subspace(seed)
+        found = None
+
+        for i in range(len(symbolic_attractors)):
+            if symbolic_seed.is_subset(symbolic_attractors[i]):
+                found = i
+        assert found is not None
+
+        symbolic_attractors.pop(found)
+    assert len(symbolic_attractors) == 0
+
 
 def test_attractor_expansion(network_file: str):
     # This test is similar to the "test attractor detection" function above, but