Module Expr Str FunctionDef arguments args NameParam NameParam NameParam defaults body Expr Str Assign NameStore Dict If CompareEq NameLoad Str body Assign NameStore Num Assign NameStore Num orelse If CompareEq NameLoad Str body Assign NameStore Num Assign NameStore Num For NameStore Call NameLoad NameLoad NameLoad NameLoad NameLoad NameLoad body Expr Yield NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam defaults body Expr Str Assign SubscriptStore NameLoad Index NameLoad Num If NameLoad body Expr Yield NameLoad For NameStore SubscriptLoad NameLoad Index NameLoad body If CompareNotIn NameLoad NameLoad body For NameStore Call NameLoad NameLoad NameLoad NameLoad NameLoad NameLoad body Expr Yield NameLoad If NameLoad body Expr Yield NameLoad decorator_list
N/A N/A 
Traversal algorithms.

@sort: traversal
 traversal N/A N/A graph node order N/A N/A N/A 
    Graph traversal iterator.

    @type  graph: graph, digraph
    @param graph: Graph.
    
    @type  node: node
    @param node: Node.
    
    @type  order: string
    @param order: traversal ordering. Possible values are:
        2. 'pre' - Preordering (default)
        1. 'post' - Postordering
    
    @rtype:  iterator
    @return: Traversal iterator.
     N/A visited N/A N/A N/A order pre N/A N/A pre 1 N/A post 0 N/A N/A N/A order post N/A N/A pre 0 N/A post 1 N/A each N/A _dfs graph visited node pre post N/A N/A N/A each N/A _dfs N/A N/A graph visited node pre post N/A N/A N/A 
    Depth-first search subfunction for traversals.
    
    @type  graph: graph, digraph
    @param graph: Graph.

    @type  visited: dictionary
    @param visited: List of nodes (visited nodes are marked non-zero).

    @type  node: node
    @param node: Node to be explored by DFS.
     N/A N/A visited N/A node 1 N/A pre N/A N/A N/A node N/A each N/A graph N/A node N/A N/A N/A each visited N/A N/A other N/A _dfs graph visited each pre post N/A N/A N/A other N/A post N/A N/A N/A node N/A