About 50 results
Open links in new tab
  1. Depth-first search (DFS) code in python - Stack Overflow

    Depth-first search (DFS) code in python Asked 8 years, 10 months ago Modified 20 days ago Viewed 114k times

  2. python - Tracing and Returning a Path in Depth First Search - Stack ...

    So I have a problem that I want to use depth first search to solve, returning the first path that DFS finds. Here is my (incomplete) DFS function: start = problem.getStartState() stack = S...

  3. algorithm - How to implement depth first search for graph with a non ...

    Apr 30, 2017 · How to implement depth first search for graph with a non-recursive approach Asked 12 years ago Modified 5 years, 7 months ago Viewed 85k times

  4. depth first search - How can I efficiently parallelize and optimize a ...

    Jun 2, 2025 · I'm working on Python project that involves processing a very large graph - it has millions of nodes and edges. The goal is to perform a breadth-first search (BFS) or depth-first search (DFS) …

  5. Depth first search algorithm in python - Stack Overflow

    Oct 15, 2015 · Depth first search algorithm in python Asked 9 years, 5 months ago Modified 9 years, 5 months ago Viewed 4k times

  6. python - Recursive Depth-first search algorithm - Stack Overflow

    Sep 16, 2015 · I am trying to write a recursive depth-first search algorithm that takes an adjacency list representing a graph and prints the visit order of the vertices. My input is a graph stored as an …

  7. Python DFS (CS 188 Berkeley Pacman) - Stack Overflow

    Jan 10, 2023 · """ Search the deepest nodes in the search tree first. Your search algorithm needs to return a list of actions that reaches the goal. Make sure to implement a graph search algorithm. To …

  8. python - Depth-first search with goal iterative - Stack Overflow

    Jul 29, 2022 · python algorithm depth-first-search edited Aug 3, 2022 at 13:16 asked Jul 29, 2022 at 13:00 Zemelon

  9. python - Depth first search, non-recursive approach - Stack Overflow

    Jan 20, 2021 · I have implemented DFS using the recursive approach. However, my program breaks right after it is executed. # Non Recursive approach def Non_Recursive_dfs(graph, source): path = [] …

  10. algorithm - Breadth First Vs Depth First - Stack Overflow

    Mar 26, 2009 · When Traversing a Tree/Graph what is the difference between Breadth First and Depth first? Any coding or pseudocode examples would be great.