def __get_descendants(node, dfs_data):
list_of_descendants = []<EOL>stack = deque()<EOL>children_lookup = dfs_data['<STR_LIT>']<EOL>current_node = node<EOL>children = children_lookup[current_node]<EOL>dfs_current_node = D(current_node, dfs_data)<EOL>for n in children:<EOL><INDENT>dfs_child = D(n, dfs_data)<EOL>if dfs_child > dfs_current_node:<EOL><INDENT>stack.append(n)<EOL><DEDENT><DEDENT>while len(stack) > <NUM_LIT:0>:<EOL><INDENT>current_node = stack.pop()<EOL>list_of_descendants.append(current_node)<EOL>children = children_lookup[current_node]<EOL>dfs_current_node = D(current_node, dfs_data)<EOL>for n in children:<EOL><INDENT>dfs_child = D(n, dfs_data)<EOL>if dfs_child > dfs_current_node:<EOL><INDENT>stack.append(n)<EOL><DEDENT><DEDENT><DEDENT>return list_of_descendants<EOL>
Gets the descendants of a node.