[AW] Update summary to new version of helpers

semester2/algorithms-and-probability/parts/graphs/connectivity.tex

@@ -74,7 +74,7 @@ $v$ is an articulation point $\Leftrightarrow$ ($v = s$ and $s$ has degree at le
 
 \stepcounter{all}
 \begin{theorem}[]{Articulation points Computation}
-    For a connected graph $G = (V, E)$ that is stored using an adjacency list, we can compute all articulation points in \tco{|E|}
+    For a connected graph $G = (V, E)$ that is stored using an adjacency list, we can compute all articulation points in $\tco{|E|}$
 \end{theorem}
 
 
@@ -104,7 +104,7 @@ The idea now is that every vertex contained in a bridge is either an articulatio
 \end{center}
 
 \begin{theorem}[]{Bridges Computation}
-    For a connected graph $G = (V, E)$ that is stored using an adjacency list, we can compute all bridges and articulation points in \tco{|E|}
+    For a connected graph $G = (V, E)$ that is stored using an adjacency list, we can compute all bridges and articulation points in $\tco{|E|}$
 \end{theorem}
 
 \subsubsection{Block-Decomposition}