Code Pumpkin

Tag Archives: Stack Application

Graph Search – Depth First Search

April 1, 2017
Posted by Dipen Adroja

We discussed about basic search mechanisms for Graph and Breadth First Search(BFS) in previous article. In this article we will start with basic definition of the Depth First Search(DFS). Depth First Search(DFS): In depth first search, we start from the root node then traverse the graph layerwise until we reach the leaf or dead end. In short, One […]

Total Posts : 124
follow us in feedly

Like Us On Facebook