Added dfs search order figure

liuxinyu95 · Jan 14, 2014 · 5b9a98a · 5b9a98a
1 parent c719451
commit 5b9a98a
Show file tree

Hide file tree

Showing 4 changed files with 296 additions and 3 deletions.
diff --git a/.gitignore b/.gitignore
@@ -7,7 +7,6 @@ semantic.cache
 *.log
 *.out
 *.ps
-*.eps
 *.idx
 *.ilg
 *.ind

diff --git a/search/img/dfs-tree.eps b/search/img/dfs-tree.eps
diff --git a/search/img/xfs.odg b/search/img/xfs.odg
diff --git a/search/search-en.tex b/search/search-en.tex
@@ -3503,9 +3503,16 @@ \subsubsection{Summary of DFS}
 branch stands for a different attemptation, our solution searching process
 is in a manner, that we search deeper and deeper. We won't consider any
 other options in the same depth unless the searching fails so that we've
-to backtrack to upper level of the tree.
+to backtrack to upper level of the tree. Figure \ref{fig:dfs-tree} illustrates
+the order we search a state tree. The arrow indicates how we go down
+and backtrack up. The number of the nodes is the order we visit them.
 
-TODO: Provide a DFS figure.
+\begin{figure}[htbp]
+ \centering
+ \includegraphics[scale=0.5]{img/dfs-tree.eps}
+ \caption{Example of DFS search order.}
+ \label{fig:dfs-tree}
+\end{figure}
 
 This kind of search strategy is called 'DFS' (Deep-first-search). We widely
 use it unintentionally. Some programming environment, Prolog for instance,