<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0,1), (0,2), (1,3), (1,4), (2,5), (2,6)], what are all the nodes at a fixed distance of 2 from the source node 0 using NetworkX?
### Response:
import networkx as nx

# Create a Directed Graph
H = nx.DiGraph()
H.add_edges_from([(0,1), (0,2), (1,3), (1,4), (2,5), (2,6)])

# Find all nodes at distance 2 from the source node 0
nodes_at_distance_2 = nx.descendants_at_distance(H, 0, 2)

print('Nodes at distance 2 from node 0:', nodes_at_distance_2)
<|EOT|>
