Algorithms that visit all the vertices and edges of a graph in a systematic way. Breadth First Search (BFS) and Depth First Search (DFS) are some of the popular ones.
Algorithms that visit all the vertices and edges of a graph in a systematic way. Breadth First Search (BFS) and Depth First Search (DFS) are some of the popular ones.