Traversal The process of visiting each node in a graph. How to visit all nodes once? Depth-first search(DFS) Breadth-first search(BFS) Depth-First Search(DFS) Keep moving until there is no more possible block. Go back the previous step and move other unvisited block. Algorithm of DFS Visit the start vertex. Visit one of unvisited vertices neighboring to the start vertex. Repeat step 2 until ther..
