<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph whose edge set is [(0, 1), (1, 2), (2, 3), (3, 4), (5, 6)], can you identify the set of nodes that are in the same connected component as node 0 using NetworkX?
### Response:
import networkx as nx

# Create an undirected graph
G = nx.Graph()
# Add edges to the graph
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 4), (5, 6)])

# Get the connected component containing node 0
component = nx.node_connected_component(G, 0)
print('Connected component containing node 0:', component)
<|EOT|>
