Graph Traversal Algorithms

In this lesson, we will learn the basic logic behind graph traversal and see how it can be done with two most famous graph traversal algorithms.

Types of graph traversals

Graph traversal means visiting every vertex in the graph. There are two basic techniques used for graph traversal:

  1. Breadth First Search (BFS)
  2. Depth First Search (DFS)
...
Access this course and 1400+ top-rated courses and projects.