算法(algorithm) 101

在Maya中实现深度/广度优先搜索算法
Depth-First-Search And Breadth-First-Search in Maya

[url=http://zh.wikipedia.org/wiki/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2]深度优先搜索算法[/url]（[url=http://en.wikipedia.org/wiki/Depth-first_search]Depth-First-Search[/url]）
[url=http://zh.wikipedia.org/wiki/%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2]广度优先搜索算法[/url]（[url=http://en.wikipedia.org/wiki/Breadth-first_search]Breadth-First-Search[/url]）

# -*- coding: utf-8 -*-

from maya import cmds

def search(rootNode, mod=0):
    """
    search dag nodes with Breadth-First-Search or Depth-First-Search.
        mod 0 Breadth-First-Search
            1 Depth-First-Search
    """
    def BFS(node):
        nodes = []
        childNodes = cmds.listRelatives(node, c=1, type="transform")
        if childNodes:
            nodes += childNodes + BFS(childNodes)
        return nodes

    def DFS(node):
        nodes = []
        childNodes = cmds.listRelatives(node, c=1, type="transform")
        if childNodes:
            for n in childNodes:
                nodes.append(n)
                nodes += DFS(n)
        return nodes

    if mod == 0:
        nodes = [rootNode] + BFS(rootNode)
        for n in nodes:
            # do something
            print n
    elif mod == 1:
        nodes = [rootNode] + DFS(rootNode)
        for n in nodes:
            # do something
            print n
    else:
        raise Exception("unknow search mode...")