<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edge set [(1, 2), (2, 3), (3, 1), (3, 4)], how can you create a directed auxiliary graph to compute flow-based node connectivity including the mapping from the original graph to the auxiliary digraph?
### Response:
import networkx as nx

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

# Build auxiliary node connectivity graph
H = nx.build_auxiliary_node_connectivity(G)

# Print the mapping from G to H
node_mapping = H.graph['mapping']
print('Mapping from G to H:', node_mapping)
<|EOT|>
