Small alignment cleanups for ch 2, 3, 4, 5, 8

Author: michelp

Chapter2/Scene7.py

@@ -36,8 +36,7 @@ def construct(self):
                 self.play(Write(bullet))
                 self.wait(0.5)
 
-            self.wait(2)
-            self.play(FadeOut(summary))
+        self.play(FadeOut(summary))
 
         with self.voiceover(
             """In the next chapter, we'll explore masking and put together

Chapter3/Scene1.py

@@ -39,8 +39,8 @@ def construct(self):
                 formatter_style="dracula",
             ).scale(0.7).next_to(title, DOWN, buff=0.5)
             self.play(Write(syntax))
-            self.wait(2)
-            self.play(FadeOut(syntax))
+
+        self.play(FadeOut(syntax))
 
         # Create input vector v (frontier at node 0) - vertical column vector
         v_data = [[1], [0], [0], [0], [0], [0]]

Chapter4/Scene1.py

@@ -37,8 +37,8 @@ def construct(self):
         ], v_buff=0.6, h_buff=0.6).scale(0.5)
 
         # Small graph below the adjacency matrix
-        a_graph = create_small_graph_from_matrix(A_adj_data, scale=0.35, directed=False, edge_color=BLUE)
-        a_col = VGroup(a_mat, a_graph).arrange(DOWN, buff=0.2)
+        a_graph = create_small_graph_from_matrix(A_adj_data, scale=0.6, directed=False, edge_color=BLUE)
+        a_col = VGroup(a_mat, a_graph).arrange(DOWN, buff=0.25)
 
         equals_1 = MathTex("=").scale(0.8)
         result_1 = create_sparse_matrix([[0], [1], [1], [0]], scale=0.5)

Chapter4/Scene2.py

@@ -41,8 +41,8 @@ def construct(self):
             ["", "1", "1", ""],
         ], v_buff=0.6, h_buff=0.6).scale(0.4)
         a_label_1 = MathTex("A").scale(0.7)
-        a_graph_1 = create_small_graph_from_matrix(A_adj_data, scale=0.3, directed=False, edge_color=BLUE)
-        a_col_1 = VGroup(a_label_1, a_mat_1, a_graph_1).arrange(DOWN, buff=0.15)
+        a_graph_1 = create_small_graph_from_matrix(A_adj_data, scale=0.5, directed=False, edge_color=BLUE)
+        a_col_1 = VGroup(a_label_1, a_mat_1, a_graph_1).arrange(DOWN, buff=0.2)
 
         times_2 = MathTex(r"\times").scale(0.8)
 
@@ -53,8 +53,8 @@ def construct(self):
             ["", "1", "1", ""],
         ], v_buff=0.6, h_buff=0.6).scale(0.4)
         a_label_2 = MathTex("A").scale(0.7)
-        a_graph_2 = create_small_graph_from_matrix(A_adj_data, scale=0.3, directed=False, edge_color=BLUE)
-        a_col_2 = VGroup(a_label_2, a_mat_2, a_graph_2).arrange(DOWN, buff=0.15)
+        a_graph_2 = create_small_graph_from_matrix(A_adj_data, scale=0.5, directed=False, edge_color=BLUE)
+        a_col_2 = VGroup(a_label_2, a_mat_2, a_graph_2).arrange(DOWN, buff=0.2)
 
         equals_2 = MathTex("=").scale(0.8)
 
@@ -66,17 +66,17 @@ def construct(self):
             ["2", "", "", "2"],
         ], v_buff=0.6, h_buff=0.6).scale(0.4)
         a2_label = MathTex("A^2").scale(0.7)
-        a2_graph = create_small_graph_from_matrix(A2_adj_data, scale=0.3, directed=False, edge_color=YELLOW)
-        a2_col = VGroup(a2_label, a2_mat, a2_graph).arrange(DOWN, buff=0.15)
+        a2_graph = create_small_graph_from_matrix(A2_adj_data, scale=0.5, directed=False, edge_color=YELLOW)
+        a2_col = VGroup(a2_label, a2_mat, a2_graph).arrange(DOWN, buff=0.2)
 
         mxm_eq = VGroup(
             a_col_1,
             times_2,
             a_col_2,
             equals_2,
             a2_col
-        ).arrange(RIGHT, buff=0.3)
-        mxm_eq.next_to(mxm_title, DOWN, buff=0.4)
+        ).arrange(RIGHT, buff=0.4)
+        mxm_eq.next_to(mxm_title, DOWN, buff=0.5)
 
         label_mxm = Text("2-hop paths", font_size=24, color=YELLOW).next_to(mxm_eq, DOWN, buff=0.3)
 

Chapter4/Scene3.py

@@ -43,8 +43,8 @@ def construct(self):
         B_mat = create_sparse_matrix(B_data, scale=0.5)
 
         # Create small graphs below matrices
-        A_graph = create_small_graph_from_matrix(A_data, scale=0.28, directed=True, edge_color=BLUE)
-        B_graph = create_small_graph_from_matrix(B_data, scale=0.28, directed=True, edge_color=BLUE)
+        A_graph = create_small_graph_from_matrix(A_data, scale=0.45, directed=True, edge_color=BLUE)
+        B_graph = create_small_graph_from_matrix(B_data, scale=0.45, directed=True, edge_color=BLUE)
 
         A_label = MathTex("A").scale(0.8)
         B_label = MathTex("B").scale(0.8)
@@ -63,12 +63,12 @@ def construct(self):
         ], scale=0.5)
 
         # Create empty graph for C (just vertices, no edges)
-        C_graph_group = self.create_empty_graph(scale=0.28)
+        C_graph_group = self.create_empty_graph(scale=0.45)
 
         # Arrange with graphs below matrices
-        A_col = VGroup(A_label, A_mat, A_graph).arrange(DOWN, buff=0.15)
-        B_col = VGroup(B_label, B_mat, B_graph).arrange(DOWN, buff=0.15)
-        C_col = VGroup(C_label.copy(), C_initial, C_graph_group).arrange(DOWN, buff=0.15)
+        A_col = VGroup(A_label, A_mat, A_graph).arrange(DOWN, buff=0.2)
+        B_col = VGroup(B_label, B_mat, B_graph).arrange(DOWN, buff=0.2)
+        C_col = VGroup(C_label.copy(), C_initial, C_graph_group).arrange(DOWN, buff=0.2)
 
         # Arrange equation
         equation = VGroup(

Chapter4/Scene5.py

@@ -50,8 +50,8 @@ def construct(self):
         ]
 
         # Create graph
-        graph = self.create_graph()
-        graph.to_edge(RIGHT, buff=1.5)
+        graph = self.create_graph().scale(0.7)
+        graph.next_to(title, DOWN, buff=0.3)
 
         with self.voiceover(
             """Consider this graph. Node zero connects to node one. Node one
@@ -66,20 +66,6 @@ def construct(self):
         # R_0 = A (direct connections)
         R0_data = A_data
 
-        R0_mat = create_sparse_matrix(R0_data, scale=0.32, v_buff=0.55, h_buff=0.55)
-        R0_label = MathTex("R_0 = A").scale(0.6)
-        R0_small_graph = create_small_graph_from_matrix(R0_data, scale=0.22, directed=False, edge_color=BLUE)
-        R0_desc = Text("Direct edges", font_size=16, color=GRAY)
-        R0_group = VGroup(R0_label, R0_mat, R0_small_graph, R0_desc).arrange(DOWN, buff=0.1).to_edge(LEFT, buff=0.8).shift(UP * 1.5)
-
-        with self.voiceover(
-            """We compute transitive closure iteratively. Start with R-zero
-            equal to A, the direct connections. Then repeatedly add new
-            reachable pairs by multiplying."""
-        ):
-            self.play(Write(R0_group))
-            self.wait(1)
-
         # R_1 = R_0 | (A @ R_0) - adds 2-hop connections
         # Union of direct and 2-hop paths
         R1_data = [
@@ -90,21 +76,6 @@ def construct(self):
             [0, 0, 1, 1, 1],  # 4 can reach 2,3,4
         ]
 
-        R1_mat = create_sparse_matrix(R1_data, scale=0.32, v_buff=0.55, h_buff=0.55)
-        R1_label = MathTex(r"R_1 = R_0 \cup (A \times R_0)").scale(0.5)
-        R1_small_graph = create_small_graph_from_matrix(R1_data, scale=0.22, directed=False, edge_color=GREEN)
-        R1_desc = Text("+ 2-hop paths", font_size=16, color=GREEN)
-        R1_group = VGroup(R1_label, R1_mat, R1_small_graph, R1_desc).arrange(DOWN, buff=0.1).next_to(R0_group, DOWN, buff=0.3)
-
-        with self.voiceover(
-            """R-one equals R-zero union A times R-zero. This adds all
-            two-hop paths to our reachability. Notice how the matrix
-            fills in as new pairs become connected."""
-        ):
-            self.play(Write(R1_group))
-            # Highlight new entries that appeared
-            self.wait(1)
-
         # R_2 = R_1 | (A @ R_1) - converges (all pairs now reachable)
         R2_data = [
             [1, 1, 1, 1, 1],  # 0 can reach all
@@ -114,11 +85,44 @@ def construct(self):
             [1, 1, 1, 1, 1],  # 4 can reach all
         ]
 
+        R0_mat = create_sparse_matrix(R0_data, scale=0.32, v_buff=0.55, h_buff=0.55)
+        R0_label = MathTex("R_0 = A").scale(0.6)
+        R0_small_graph = create_small_graph_from_matrix(R0_data, scale=0.45, directed=False, edge_color=BLUE)
+        R0_desc = Text("Direct edges", font_size=16, color=GRAY)
+        R0_group = VGroup(R0_label, R0_mat, R0_small_graph, R0_desc).arrange(DOWN, buff=0.15)
+
+        R1_mat = create_sparse_matrix(R1_data, scale=0.32, v_buff=0.55, h_buff=0.55)
+        R1_label = MathTex(r"R_1 = R_0 \cup (A \times R_0)").scale(0.5)
+        R1_small_graph = create_small_graph_from_matrix(R1_data, scale=0.45, directed=False, edge_color=GREEN)
+        R1_desc = Text("+ 2-hop paths", font_size=16, color=GREEN)
+        R1_group = VGroup(R1_label, R1_mat, R1_small_graph, R1_desc).arrange(DOWN, buff=0.15)
+
         R2_mat = create_sparse_matrix(R2_data, scale=0.32, v_buff=0.55, h_buff=0.55)
         R2_label = MathTex(r"R_2 = R_1 \cup (A \times R_1)").scale(0.5)
-        R2_small_graph = create_small_graph_from_matrix(R2_data, scale=0.22, directed=False, edge_color=YELLOW)
+        R2_small_graph = create_small_graph_from_matrix(R2_data, scale=0.45, directed=False, edge_color=YELLOW)
         R2_desc = Text("Fixed point", font_size=16, color=YELLOW)
-        R2_group = VGroup(R2_label, R2_mat, R2_small_graph, R2_desc).arrange(DOWN, buff=0.1).next_to(R1_group, DOWN, buff=0.3)
+        R2_group = VGroup(R2_label, R2_mat, R2_small_graph, R2_desc).arrange(DOWN, buff=0.15)
+
+        # Arrange the three iteration groups in a horizontal row below the chain graph
+        r_row = VGroup(R0_group, R1_group, R2_group).arrange(RIGHT, buff=0.6, aligned_edge=UP)
+        r_row.next_to(graph, DOWN, buff=0.4)
+
+        with self.voiceover(
+            """We compute transitive closure iteratively. Start with R-zero
+            equal to A, the direct connections. Then repeatedly add new
+            reachable pairs by multiplying."""
+        ):
+            self.play(Write(R0_group))
+            self.wait(1)
+
+        with self.voiceover(
+            """R-one equals R-zero union A times R-zero. This adds all
+            two-hop paths to our reachability. Notice how the matrix
+            fills in as new pairs become connected."""
+        ):
+            self.play(Write(R1_group))
+            # Highlight new entries that appeared
+            self.wait(1)
 
         with self.voiceover(
             """After another iteration, R-two fills completely. Every node