<｜begin▁of▁sentence｜>### Instruction:
Consider a graph with edges [(0, 1), (1, 2), (2, 3), (2, 4)]. How can you find an ordering of the graph's nodes such that for each node (except the first), at least one neighbor appeared earlier, using the depth-first search traversal strategy?
### Response:
import networkx as nx
from networkx.algorithms.traversal.depth_first_search import strategy_connected_sequential_dfs

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (2, 3), (2, 4)])

# Use the connected sequential DFS strategy to get an iterable
order = list(strategy_connected_sequential_dfs(G))
print('DFS Order:', order)
<|EOT|>
