Differences

This shows you the differences between two versions of the page.

--- bfs_and_dfs_implementation [2016/10/23 19:51] – dwallace
+++ bfs_and_dfs_implementation [2016/10/23 19:53] – dwallace
@@ Line 9: / Line 9: @@
 {{ https://i.imgur.com/jVlqEzE.jpg?400x400 }}
 \\ \\ \\
-The photo above depicts an area with obstacles to navigate around, which allows you to from a start point to and end point autonomously. The big picture problem is robotic navigation. Solving this partially or completely is important because it allows for the development of Artificial Intelligence and navigation such as autonomous vehicles. This tutorial shows you how to implement BFS and DFS methods in C++, and takes approximately 3 hours to complete.
+The photo above depicts an area with obstacles to navigate around, which allows you to from a start point to and end point autonomously. The big picture problem is robotic navigation. Solving this partially or completely is important because it allows for the development of Artificial Intelligence and navigation such as autonomous vehicles. This tutorial shows you how to implement BFS and DFS methods in C-plus-plus, and takes approximately 3 hours to complete.
 \\
 ===== Motivation and Audience =====
@@ Line 16: / Line 16: @@
 <fc blue>
-  * Know how to code in C++, especially with concepts such as pointers and linked lists.
+  * Know how to code in C-plus-plus, especially with concepts such as pointers and linked lists.
 \\
   * Know how Breadth-First and Depth-First Search algorithms work. For info on this refer to the [[http://daslhub.org/unlv/wiki/doku.php?id=breadth-first_search_and_depth-first_search|BFS & DFS tutorials]].