# AI News, Artificial Intelligence/Search/Heuristic search/Depth-first search

- On Wednesday, October 3, 2018
- By Read More

## Artificial Intelligence/Search/Heuristic search/Depth-first search

Depth-first search is an algorithm used to find information represented in a graphical format.

[The] “theoretical properties of Tremaux’s maze solving method,” however, where not discovered in the field of computer science until 1970 when John Hopcroft and Robert Tarjan collaborated, using depth-first search to “obtain linear time algorithms” (Tarjan, 1972, p.

Beginning with a single node at the top of the graph, the search moves to each subsequent node, vertically, starting with the left-most side of the tree structure until the search reaches the bottom-most node of the tree structure.

Created by Kravitz, David and Lafferty (1997) this pseudocode shows how a depth first search algorithm works by efficiently keeping track of the nodes already visited and the nodes still left to explore.

This block of code allows the search engine to visit every node on the left most tree segment of the tree structure, turning the nodes from white to grey as they are searched one time.

If, during this process, the user decides that a certain grouping of nodes have potential connections to other nodes not presently represented on the tree structure graph, then the user will know that that particular tree segment must “be kept on the external face” of the planar graph (“Planar,” 2008).

- On Wednesday, September 18, 2019

**Depth First Search Algorithm**

This is one of the important Graph traversal technique. DFS is based on stack data structure. Analysis: The time complexity of DFS using Adjacency list is O(V + ...

**Breadth First Search Algorithm**

This is one of the important Graph traversal technique. BFS is based on Queue data structure. Analysis: The time complexity of BFS using Adjacency list is O(V + ...

**Binary tree traversal - breadth-first and depth-first strategies**

See complete series on data structures here: In this lesson, we have ..

**Graphs: breadth-first search - Beau teaches JavaScript**

Traversal algorithms are algorithms to traverse or visit nodes in a graph. In this video, I will be showing how to implement breadth-first search traversal algorithm ...

**Data structures: Introduction to Trees**

See complete series on data structures here: In this lesson, we have ..

**Binary search tree - Implementation in C/C++**

See complete series on data structures here: In this lesson, we have ..

**Graph Representation part 01 - Edge List**

See complete series on data structures here: In this lesson, we have ..

**Binary tree: Level Order Traversal**

See complete series on data structures here: In this lesson, we have ..

**Find height of a binary tree**

See complete series on data structures here: In this lesson, we have written ..

**C# breadth first and depth first search in 5 min**

Learn in 5 minutes how to do breadth first and depth first search traversal of a binary tree.