# Introduction Graph is a non-linear data structure that consists of nodes and edges. Depth-first search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking. In this challenge, we will implement DFS on a directed graph.

Click the virtual machine below to start practicing