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

parcours en profondeur d'un graphe python

Anas Nadif answered on December 1, 2022 Popularity 3/10 Helpfulness 1/10

answer parcours en profondeur d'un graphe python

parcours en profondeur d'un graphe python

Comment

from collections import deque

def find_paths_dfs(graph, start, end):

    stack = deque()
    stack.append((start, [start]))

    while stack:
        (node, path) = stack.pop()
        adjacent_nodes = [n for n in graph[node] if n not in path]
        for adjacent_node in adjacent_nodes:
            if adjacent_node == end:
                yield path + [adjacent_node]
            else:
                stack.append((adjacent_node, path + [adjacent_node]))

Popularity 3/10 Helpfulness 1/10 Language python

Source: marcarea.com

Tags: python

Link to this answer
Share Copy Link

Contributed on Dec 01 2022

Anas Nadif

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.

parcours en profondeur d'un graphe python

Contents

More Related Answers

parcours en profondeur d'un graphe python

Grepper

Documentation

Social

Legal

Contact

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