# Graphs: Depth First Traversal (C#)

Continuing where we left off with Graphs, we saw that Dijkstra’s Shortest Path was an example of a breadth first search traversal. In this tutorial, we will implement a depth first traversal (also called DFS, depth first search). What is depth first searching? The whole idea of DFS algorithm is to go as far as…