<｜begin▁of▁sentence｜>### Instruction:
Given a directed version of a barbell graph with the edge from node 3 to node 4 removed, can you perform the condensation of the graph to identify and contract its strongly connected components into single nodes, and then provide the mapping of the original nodes to the condensed nodes?
### Response:
import networkx as nx

# Create a directed graph
G = nx.barbell_graph(4, 0)
G.remove_edge(3, 4)
G = nx.DiGraph(G)

# Perform the condensation of the graph
H = nx.condensation(G)

# Print the data for the condensed nodes
print(H.nodes.data())

# Print the mapping between original nodes and the nodes of the condensed graph
print(H.graph['mapping'])
<|EOT|>
