在Python中深度遍历图形

Question

I'm trying to depth traverse a graph in Python, with 11 nodes.

graph = {'A': ['B', 'C'],
        'B': ['A', 'F'],
        'C': ['D', 'E'],
        'D': ['H', 'J', 'C'],
        'E': ['C', 'F'],
        'F': ['B', 'G'],
        'G': ['F', 'H'],
        'H': ['G', 'D', 'I'],
        'I': ['H', 'K'],
        'J': ['D', 'E', 'K'],
        'K': ['I', 'J']}


current_node = []
viewed_nodes = []
   for i in graph.keys():
    print("I'm at the " + str(i) + " node." + " The nodes connected to " +str(i) + " are " + str(graph[i]))
    print("I'm going to mark the " + str(i) + " node as visited.")
    viewed_nodes.append(str(i))

This is my code. I'm trying to figure out how to depth traverse it, meaning go through it all in one line before going back and going down different paths

Answer 1

This below already visits all nodes.

graph = {'A': ['B', 'C'],
        'B': ['A', 'F'],
        'C': ['D', 'E'],
        'D': ['H', 'J', 'C'],
        'E': ['C', 'F'],
        'F': ['B', 'G'],
        'G': ['F', 'H'],
        'H': ['G', 'D', 'I'],
        'I': ['H', 'K'],
        'J': ['D', 'E', 'K'],
        'K': ['I', 'J']}


current_node = []
viewed_nodes = []


def traverse(into):
    if into in viewed_nodes:
        return

    viewed_nodes.append(into)

    for outto in graph[into]:
        if outto not in viewed_nodes:
            traverse(outto)

for node in graph:
    traverse(node)

print(sorted(viewed_nodes))

Output:

['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K']