Depth First Search
4 posts3 contributors
Articles about Depth First Search
Implement Depth-First Search (DFS) Iteratively in Java
Learn how to implement iterative depth-first search in Java using a stack, track visited nodes, and avoid recursion limits when traversing graphs.
Counting Cycles in Undirected Graph with DFS
This is a graph problem to count the noumber of cycles with length n using Depth First Search
Generating Maze using C# and .NET
This article focuses on how to generate a maze using the depth first search algorithm. This is a very simple but clever algorithm that creates a maze by randomly stripping one available wall between two cells for every cell in the grid.
Generating Maze using C# and .NET
Did you ever get the feeling that cubicles were laid out with the idea that there could be no escape? (Must be I am a bit overworked these days). Today's article focuses on how to generate a maze using the depth first search algorithm. This is a very simple but clever algorithm that creates a maze by randomly stripping one available wall between two cells for every cell in the grid.
