<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (1, 2), (2, 0), (3, 4), (4, 5), (5, 3), (5, 6)], can you compute the condensation of the graph and display both the mapping from original nodes to the nodes in the condensation graph and the members of each node in the condensation graph using NetworkX?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
G.add_edges_from([(0, 1), (1, 2), (2, 0), (3, 4), (4, 5), (5, 3), (5, 6)])

# Compute the condensation of the graph
C = nx.condensation(G)

# Display nodes in the condensation graph with their members
for node, data in C.nodes(data=True):
    print(f'Node {node}: ', data['members'])

# Display the mapping from original nodes to the nodes in the condensation graph
print('Mapping:', C.graph['mapping'])
<|EOT|>
