Winter Vacation Training Day 1 (01.26)

For a node u, we will search one of v that (u, v) is in E, then search v.
For instance, we search node 5 first. Then we will search 3, then 2, finally 1.

Figure 2.2-a : DFS Searching(a)

Now, we return until we find that there is still an not visited edge(Here we return to 3, then find (3, 8)). We’ll search 8, etc.

Figure 2.2-b : DFS Searching(b)

Here is the result :

Figure 2.2-c : DFS Searching(c)

For a node u, we search all v that (u, v) is in E.
Another example, we search node 5, then we find 2, 3, 4, 6, 7.

Figure 2.3-a : BFS Searching(a)

Then we search 2, 3, 4, 6, 7, etc.

Figure 2.3-b : BFS Searching(b)

Here is the result :

Figure 2.3-c : BFS Searching(c)