Breaking News: Grepper is joining You.com. Read the official announcement!

python depth first search

Add Answer

Experimental Hypothesis answered on January 6, 2021 Popularity 10/10 Helpfulness 5/10

answer python depth first search

related python depth first search

related Python depth first search

python depth first search

Comment

# left to right, pre-order depth first tree search, iterative. O(n) time/space
def depthFirstSearch(root):
    st = [root]
    while st:
        current = st.pop()
        print(current)
        if current.right: st.append(current.right) 
        if current.left: st.append(current.left)

Popularity 10/10 Helpfulness 5/10 Language python

Source: Grepper

Tags: depth-first-search python

Link to this answer
Share Copy Link

Contributed on Jan 06 2021

Experimental Hypothesis

0 Answers Avg Quality 2/10

Closely Related Answers

python depth first search

Comment

# left to right, pre-order depth first tree search, recursive. O(n) time/space
def depthFirstSearchRec(root):
    if root == None: return
    print(root)
    depthFirstSearch(root.left)
    depthFirstSearch(root.right)

Popularity 10/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: depth-first-search depth-first-searc

Link to this answer
Share Copy Link

Contributed on Jan 06 2021

Experimental Hypothesis

0 Answers Avg Quality 2/10

Python depth first search

Comment

from collections import defaultdict

class Graph:
    def __init__(self):
        self.graph = defaultdict(list)
    
    def addEdge(self, u, v):
        self.graph[u].append(v)
        print("This is u" , u)
        
    def DFSUtil(self, v, visited):
        visited.add(v)
        print(v, end=" ")

        for neighbor in self.graph[v]:
            if neighbor not in visited:
                self.DFSUtil(neighbor, visited)
    
    def DFS(self, v):
        visited = set()
        self.DFSUtil(v, visited)

if __name__ == "__main__":
    g = Graph()
    g.addEdge(0, 1)
    g.addEdge(0, 2)
    g.addEdge(1, 2)
    g.addEdge(2, 0)
    g.addEdge(2, 3)
    g.addEdge(3, 3)

    print("It's done")
    g.DFS(2)

Popularity 8/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: depth-first-search depth-first-searc

Link to this answer
Share Copy Link

Contributed on Oct 04 2022

Adam, the developer

0 Answers Avg Quality 2/10

python depth first search

Contents

More Related Answers

python depth first search

Closely Related Answers

python depth first search

Python depth first search

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.