Graph Traversals

M36

In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. There are two graph traversal techniques and they are as follows... 1. DFS (Depth First Search) 2. BFS (Breadth First Search)