<｜begin▁of▁sentence｜>### Instruction:
Given a weighted undirected graph with an edge set [('A', 'B', 3), ('A', 'C', 2), ('B', 'C', 6), ('B', 'D', 1), ('C', 'D', 2)], how do you compute the current flow closeness centrality for each node using NetworkX?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B', 3), ('A', 'C', 2), ('B', 'C', 6), ('B', 'D', 1), ('C', 'D', 2)])

# Compute the current flow closeness centrality
centrality = nx.current_flow_closeness_centrality(G, weight='weight')

# Print the current flow closeness centrality for each node
print(centrality)
<|EOT|>
