strategy_connected_sequential_dfs¶
- strategy_connected_sequential_dfs(G, colors)[source]¶
Returns an iterable over nodes in
G
in the order given by a depth-first traversal.The generated sequence has the property that for each node except the first, at least one neighbor appeared earlier in the sequence.
G
is a NetworkX graph.colors
is ignored.