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

iterative dfs python

Playful Python answered on April 30, 2022 Popularity 8/10 Helpfulness 4/10

answer iterative dfs python

iterative dfs python

Comment

G = {
    'A': {'C'},
    'B': {'A'},
    'C': {'B', 'D', 'E'},
    'D': {},
    'E': {}
}

def getNeighbors(vertex):
    return list(G[vertex])

# iterative dfs in Python
def dfs(root, target):
    stk = [] # stack (LIFO)
    visited = set() # keep track of vertices we've seen before
    stk.insert(0, root) # push root to top of stack
    visited.add(root) # mark root (start point) as visited
    while len(stk): # while our stk is not empty
        top = stk.pop(0)
        if top == target: # is top of stk our target?
            return True # we found a path from root to target in our graph!
        for neighbor in getNeighbors(top): # you must write a 'getNeighbor' function
            # this function should return all the vertices connected to root
            if neighbor in visited: continue # don't revisit vertices!
            visited.add(neighbor) # mark neighbor as visited
            stk.insert(0, neighbor) # add neighbor to our stack
    
    return False # we went through every path from 'root' and didn't find 'target'

result = dfs('C', 'E')
print(result)

Popularity 8/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: python

Link to this answer
Share Copy Link

Contributed on Apr 30 2022

Playful Python

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

iterative dfs python

Contents

More Related Answers

iterative dfs python

Grepper

Documentation

Social

Legal

Contact

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