Generate images from SVGs

1 files changed, 6 insertions, 6 deletions

diff --git a/mgr.tex b/mgr.tex
index 5b9f987..9463dd2 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -477,7 +477,7 @@ The construction is as follows:
 \begin{figure}
     \centering
     \def\svgwidth{\columnwidth}
-    \input{word.pdf_tex}
+    \input{figures/word.pdf_tex}
     \caption{
         The data structure for infix regular questions over word $abaacbc$ and a
         simple automaton with 4 states. As shown by the color blotches below the
@@ -584,12 +584,12 @@ This process will again lead to a coloring with the desired properties that
     \centering
     \def\svgwidth{\columnwidth}
     \begin{subfigure}{0.3\linewidth}
-        \input{tree.pdf_tex}
+        \input{figures/tree.pdf_tex}
         \caption{The original tree $T$}
     \end{subfigure}
     \def\svgwidth{\columnwidth}
     \begin{subfigure}{0.4\linewidth}
-        \input{tree-graph.pdf_tex}
+        \input{figures/tree-graph.pdf_tex}
         \caption{The colored graph}
     \end{subfigure}
     \caption{
@@ -712,7 +712,7 @@ check).
 \begin{figure}
     \centering
     \def\svgwidth{0.5\columnwidth}
-    \input{tree-marked.pdf_tex}
+    \input{figures/tree-marked.pdf_tex}
     \caption{
         A preprocessed marked tree. The marked vertices are colored dark grey.
         To the left of each vertex is its pre-order number. To the right is its
@@ -925,7 +925,7 @@ singletons constructed according to the following rules:
 \begin{figure}
     \centering
     \def\svgwidth{\columnwidth}
-    \input{partition.pdf_tex}
+    \input{figures/partition.pdf_tex}
     \caption{
         An LCA-partition of the tree with respect to the black vertices. The
         dark grey vertices are added when computing the LCA closure, the light
@@ -1114,7 +1114,7 @@ components:
 \begin{figure}
     \centering
     \def\svgwidth{0.5\columnwidth}
-    \input{subtree-with-hole.pdf_tex}
+    \input{figures/subtree-with-hole.pdf_tex}
     \caption{
         The subtree of $v$ with hole $w$. All its nodes can be partitioned into
         the path $u_1, \ldots, u_4 = v$ and the subtrees of $u_1', \ldots,