[AD] Update summary to new version of helpers

semester1/algorithms-and-datastructures/parts/graphs/bfs-dfs.tex

@@ -43,7 +43,7 @@
 \begin{properties}[]{Depth-First Search}
     \begin{itemize}
         \item Can be implemented recursively or iteratively (using a stack).
-        \item Time complexity: \tco{|V| + |E|}, where $|V|$ is the number of vertices and $|E|$ is the number of edges.
+        \item Time complexity: $\tco{|V| + |E|}$, where $|V|$ is the number of vertices and $|E|$ is the number of edges.
         \item Used for:
               \begin{itemize}
                   \item Detecting cycles in directed and undirected graphs.
@@ -81,7 +81,7 @@
 \begin{properties}[]{Breadth-First Search}
     \begin{itemize}
         \item Implements a queue-based approach for level-order traversal.
-        \item Time complexity: \tco{|V| + |E|}.
+        \item Time complexity: $\tco{|V| + |E|}$.
         \item Used for:
               \begin{itemize}
                   \item Finding shortest paths in unweighted graphs.