Depth First Search (DFS) is an algorithm for traversing or searching a graph by exploring as far as possible along each branch before backtracking. It uses a stack to keep track of vertices and processes the next vertex by popping it from the stack, exploring its neighbors, and pushing any unvisited neighbors onto the stack. The algorithm labels vertices as they are discovered to avoid processing any vertex twice.

1. Depth First Search (DFS)
Algorithm
Αναζήτηση σε Βάθος

2. DFS algorithm
1 procedure DFS-iterative(G,v):
2 let S be a stack
3 S.push(v)
4 while S is not empty
5 v = S.pop()
6 if v is not labeled as discovered:
7 label v as discovered
8 for all edges from v to w in G.adjacentEdges(v) do
9 S.push(w)

3. DFS algorithm

4. DFS algorithm

5. DFS algorithm

6. DFS algorithm

7. DFS algorithm

8. DFS algorithm