When to mark visited in iterative DFS? at push or at pop...

In a DAG, how to find vertices where paths converge?...

Find size of maximum connected region in matrix...

Python: Implementing Depth-First Search for Freecell Solitaire...

How to detect cycles in a directed graph using the iterative version of DFS?...

How to extend a spanning tree into a bridgeless subgraph in O(V+E) time?...

DFS in binary tree and graph...

Get list of all sub-keys from a dictionary...

Decode a run-length encoded string...

Dfs Vs Bfs confusion...

Maintaining context of current node in a iterative DFS vs a recursive DFS...

Shortest path through a labyrinth: not always getting correct result...

How to solve boat movements using Graph algorithm?...

Efficient connected components from a 2D array...

Detect if the element im currently in is the youngest son/grandson/grandgrand son of an element...

Speedup depth first search in a grid...

Why is my DFS maze generation algorithm not working?...

Predecessors from scipy depth_first_order...

DFS-compatible coordinate-free neighbors in Haskell...

Blocks-World Problem in Prolog keeps oscillating between the same two states...

Detecting cycles in a graph using DFS: 2 different approaches and what's the difference...

String representation of a tree (nodes) data structure with paths from left to right...

How can I calculate the level of a node in a perfect binary tree from its depth-first order index?...

Yield depth on a depth-first non-recursive tree walker?...

discovery time & finishing time of Depth first search...

Can this generic DFS implementation in Haskell be used to detect cycles in an adjacency list?...

Depth First Search v.s. Greedy Best First Search...

Difference between passing in string vs. array parameters to recursive function...

Is finding the largest cycle on a directed graph with 133 Nodes and 737 Edges Computable?...

Max() function on node ; python DFS...