<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1, {'weight': 1.0}), (1, 2, {'weight': 2.0}), (2, 0, {'weight': 1.0})], how can you represent this graph as a dictionary of dictionaries using NetworkX?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([
    (0, 1, {'weight': 1.0}),
    (1, 2, {'weight': 2.0}),
    (2, 0, {'weight': 1.0}),
])

# Convert to a dictionary of dictionaries
adjacency_dict = nx.to_dict_of_dicts(G)

print(adjacency_dict)
<|EOT|>
