python 樹遍曆

標籤：

使用python實現的樹遍曆，包括寬度優先和深度優先

ef dfs():    tree = {        ‘A‘: [‘B‘, ‘C‘],        ‘B‘: [‘D‘, ‘E‘],        ‘C‘: [‘F‘, ‘G‘],        ‘D‘: [‘H‘, ‘I‘],        ‘E‘: [],        ‘F‘: [],        ‘G‘: [],        ‘H‘: [],        ‘I‘: []    }    leaf = []    to_crawl = deque([‘A‘])    while to_crawl:        current = to_crawl.popleft()        print current, to_crawl        children = tree[current]        if len(children)> 0:            # width first            # to_crawl.extend(children)            # depth first            to_crawl.extendleft(children[::-1])            print to_crawl        else:            leaf.append(current)    print leaf

對於圖的遍曆稍微調整一下即可，主要是圖需要考慮的重複遍曆的問題，所以需要記錄已經遍曆過哪些節點，每次獲得新的children之後減去已遍曆過的節點即可

python 樹遍曆