<｜begin▁of▁sentence｜>### Instruction:
Given a dictionary of dictionaries, where outer keys represent graph nodes, inner keys are adjacent nodes, and innermost values are the edge attributes, how can you convert this data structure into a NetworkX graph and print its edges along with the edge attributes?
### Response:
import networkx as nx

# Define the dictionary of dictionaries
# Each key is a node and its value is a dict
# Each inner key is a neighbor and its value is the edge data

# Graph with single edge (0,1)
dod = {0: {1: {'weight': 1}}}

# Convert the dictionary of dictionaries to a graph
G = nx.from_dict_of_dicts(dod)

# Print the edges of the graph with weights
print(G.edges(data=True))
<|EOT|>
