NetworkX recursive child nodes

Question

Using the latest NetworkX ( version 1.11 at the time of writing), what is the most efficient way of retrieving all (recursive) child nodes for a given node?
The successors() function retrieves the immediate children and in previous versions there was dfs_preorder_nodes solution .

Answer 1

there is descendants method which will find all children nodes, including children of every child:

 1-2 \\ 3 \\ 4

import networkx as nx

G = nx.DiGraph()
G.add_edge(1, 2)
G.add_edge(1, 3)
G.add_edge(2, 4)
res = nx.descendants(G, 1)
print (res) #{2,3,4}

Answer 2

dfs_preorder_nodes is still valid in the latest version as pointed out by Joel. The documentation is available here .

The following achieves the desired, ie all recursive children for a node of interest:

import networkx as nx 
children = [node for node in nx.dfs_preorder_nodes(network, queryID)]`