Search⌘ K
AI Features
Home
Courses
Data Structures for Coding Interviews in Python

Graph Traversal Algorithms

Explore how to perform graph traversal using breadth first search and depth first search algorithms. Understand traversal levels and the different approaches to visiting vertices. This lesson provides foundational knowledge to apply BFS and DFS in coding with Python for solving graph-based problems.

We'll cover the following...

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)

In order to understand these algorithms, we will have to view graphs from a slightly different perspective.

Any traversal needs a starting point, but a graph does ...