fixes

differt-core/src/rt/graph.rs

@@ -646,7 +646,7 @@ pub mod directed {
                 );
                 self.edges_list
                     .iter_mut()
-                    .zip(to_adjacency.into_iter())
+                    .zip(to_adjacency)
                     .for_each(|(edges, &is_adjacent)| {
                         if is_adjacent {
                             edges.push(to)

docs/source/notebooks/advanced_path_tracing.ipynb

@@ -439,7 +439,7 @@
     "\n",
     "### Numbers getting crazy\n",
     "\n",
-    "To illustrate what we said above, we will load a much large scene that contains quite a few objects, i.e., triangles.\n",
+    "To illustrate what we said above, we will load a much larger scene that contains quite a few objects, i.e., triangles.\n",
     "\n",
     "A transmitter (TX) and a receiver (RX) are placed in the scene as examples."
    ]
@@ -652,7 +652,7 @@
    "id": "7c0354a8",
    "metadata": {},
    "source": [
-    "It is also possible get the number of visible quadrilaterals by\n",
+    "It is also possible to get the number of visible quadrilaterals by\n",
     "counting visible triangles by pairs. If any of the two triangles\n",
     "forming a quadrilateral is visible, then this quadrilateral **is considered visible**."
    ]
@@ -678,10 +678,10 @@
     "\n",
     "As expected, the number of path candidates get reduced to about 44% of the previous value.\n",
     "\n",
-    "However, 44% visibility is probably to high to switch from a\n",
+    "However, 44% visibility is probably too high to switch from a\n",
     "{class}`CompleteGraph<differt_core.rt.graph.CompleteGraph>`\n",
     "to a {class}`DiGraph<differt_core.rt.graph.DiGraph>`,\n",
-    "as iterating through the later is quite slower (because the former is optimized)."
+    "as iterating through the latter is quite slower (because the former is optimized)."
    ]
   },
   {