New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[Algorithms] BFS and DFS through a graph #33

Open

lpatmo opened this issue Mar 15, 2019 · 1 comment

Member

lpatmo commented Mar 15, 2019

Prompt: Traverse through a graph using BFS and DFS. You can either do this iteratively or recursively.

cs-cordero commented Mar 21, 2019

from collections import deque

def bfs(root: Node):
    queue = deque([root])
    while queue:
        node = queue.popleft()
        # do stuff with node
        queue.extend(node.children)


def dfs(node: Node):
    for child in node.children:
        dfs(child)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment